Recursive Functions and Metamathematics
Problems of Completeness and Decidability, Gödel's Theorems
by Roman Murawski
- 0 Ratings
- 0 Want to read
- 0 Currently reading
- 0 Have read
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.
Check nearby libraries
Buy this book
Previews available in: English
Showing 1 featured edition. View all 1 editions?
| Edition | Availability |
|---|---|
1
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems
1999, Springer Netherlands
electronic resource :
in English
9048152984 9789048152988
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Online full text is restricted to subscribers.
Also available in print.
Mode of access: World Wide Web.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?
History
- Created July 6, 2019
- 3 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| February 27, 2022 | Edited by ImportBot | import existing book |
| January 27, 2022 | Edited by ImportBot | import existing book |
| July 6, 2019 | Created by MARC Bot | Imported from Internet Archive item record |