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...
Main Author: | |
---|---|
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 |
Table of Contents:
- 1 Recursive Functions
- 2 Gödel’s Incompleteness Theorems
- 3 Decidability Theory
- 4 Philosophical Comments
- List of Symbols