• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems

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

Paperback

Series: Synthese Library, Book 286

FictionHistory & Philosophy of ScienceLogic

ISBN10: 9048152984
ISBN13: 9789048152988
Publisher: Springer Nature
Published: Dec 6 2010
Pages: 395
Weight: 1.25
Height: 0.84 Width: 6.14 Depth: 9.21
Language: English
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.

1 different editions

Also available

Also in

Logic