This thoroughly revised second edition of a classic book on the main ideas and results of general meta-mathematics contains new results and simplified proofs, as well as an up to date bibliography. In addition to the standard results of Gödel and others on incompleteness, (non) finite axiomatizability, interpretability, etc.., it contains a thorough treatment of partial conservativity and degrees of interpretability. The reader should be familiar with the widely used method of arithmetization and with the elements of recursion theory.
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
0 of 2 people found the following review helpful:
4.0 out of 5 stars
Solid Introduction to Logic,
Amazon Verified Purchase(What's this?)
This review is from: Aspects of Incompleteness: Lecture Notes in Logic 10 (Paperback)
This book is well written and a good resource but nothing earth shattering. You'll learn a lot more my taking a good course in advanced logic.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
Let T be a sufficiently strong theory formalized in the language LA of (first order) arithmetic. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
partial conservativity, finite subtheory, fixed point lemma, primitive recursive relation, arithmetical theories, sufficiently large degree, primitive recursive function, recursion theory, optimal with respect, incompleteness theorem Key Phrases - Capitalized Phrases (CAPs): (learn more)
Use Exercise, Robinson's Arithmetic, These Facts New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Let T be a sufficiently strong theory formalized in the language LA of (first order) arithmetic. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
partial conservativity, finite subtheory, fixed point lemma, primitive recursive relation, arithmetical theories, sufficiently large degree, primitive recursive function, recursion theory, optimal with respect, incompleteness theorem Key Phrases - Capitalized Phrases (CAPs): (learn more)
Use Exercise, Robinson's Arithmetic, These Facts New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 9
books:
See all 9 books this book cites
- Mathematical Logic by Petio P. Petkov in Back Matter (1), and Back Matter (2)
- Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman, Lecture Notes in Logic 15 by Wilfried Sieg in Back Matter
- The Logic of Provability by George S. Boolos in Back Matter
- The Unprovability of Consistency: An Essay in Modal Logic by George Boolos in Back Matter
- Introduction to Mathematical Logic, Fourth Edition by E. Mendelson in Back Matter
See all 9 books this book cites
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
