Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems / Edition 1

by Roman Murawski

Overview

Recursive Functions and Metamathematics deals with problems of the completeness and decidability of theories, using as its main tool the theory of recursive functions. This theory is first introduced and discussed. Then Gödel's incompleteness theorems are presented, together with generalizations, strengthenings, and the decidability theory. The book also considers the historical and philosophical context of these issues and their philosophical and methodological consequences. Recent results and trends have been included, such as undecidable sentences of mathematical content, reverse mathematics. All the main results are presented in detail. The book is self-contained and presupposes only some knowledge of elementary mathematical logic. There is an extensive bibliography.
Readership: Scholars and advanced students of logic, mathematics, philosophy of science.

Product Details

ISBN-13:	9780792359043
Publisher:	Springer Netherlands
Publication date:	09/30/1999
Series:	Synthese Library , #286
Edition description:	1999
Pages:	395
Product dimensions:	6.14(w) x 9.21(h) x 0.36(d)

Table of Contents

1 Recursive Functions.- 2 Gödel’s Incompleteness Theorems.- 3 Decidability Theory.- 4 Philosophical Comments.- List of Symbols.