Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems
eBook
$159.00
Collect stamps to save with Rewards. 10 stamps = $5. Learn More
Select a store to view item availability.
Available on compatible , the free NOOK App, and in My Digital Library
NOOK App
Download NOOK app
NOOK Devices
NOOK eReaders
- NOOK GlowLight 4 Plus
- NOOK GlowLight 4e
- NOOK GlowLight 4
- NOOK GlowLight Plus 7.8"
- NOOK GlowLight 3
- NOOK GlowLight Plus 6"
NOOK Tablets
- NOOK 9" Lenovo Tablet
- NOOK 10" HD Lenovo Tablet
- NOOK Tablet 7" & 10.1"
- NOOK by Samsung Galaxy Tab 7.0 [Tab A and Tab 4]
- NOOK by Samsung [Tab 4 10.1, S2 & E]
Free NOOK Reading Apps
- NOOK for iOS
- NOOK for Android
BN.com website
Go to your Digital Library in My Account
Limit 1 per customer
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...























