Recursive Functions and Metamathematics Problems of Completeness and Decidability, Gödel’s Theorems

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 generalization...

Full description

Bibliographic Details
Main Author: Murawski, Roman
Format: eBook
Language:English
Published: Dordrecht Springer Netherlands 1999, 1999
Edition:1st ed. 1999
Series:Synthese Library, Studies in Epistemology, Logic, Methodology, and Philosophy of Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Description
Summary: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
Physical Description:XII, 395 p online resource
ISBN:9789401728669