Recursive Functions and Metamathematics
Problems of Completeness and Decidability, Gödel's Theorems
Published on 14. March 2013
XII, 395 pages
978-94-017-2866-9 (ISBN)
Description
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.
Readership: Scholars and advanced students of logic, mathematics, philosophy of science.
More details
Other editions
Additional editions
Roman Murawski
Recursive Functions and Metamathematics
Problems of Completeness and Decidability, Gödel's Theorems
Book
09/1999
Kluwer Academic Publishers
€171.19
Shipment within 15-20 days
Content
1 Recursive Functions.- 2 Gödel's Incompleteness Theorems.- 3 Decidability Theory.- 4 Philosophical Comments.- List of Symbols.
