Skip to content
Register Sign in Wishlist
Inexhaustibility

Inexhaustibility
A Non-Exhaustive Treatment

$92.00 ( ) USD

Part of Lecture Notes in Logic

  • Publication planned for: April 2020
  • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • format: Adobe eBook Reader
  • isbn: 9781108641630

$ 92.00 USD ( )
Adobe eBook Reader

You will be taken to ebooks.com for this purchase
Buy eBook Add to wishlist

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the sixteenth publication in the Lecture Notes in Logic series, gives a sustained presentation of a particular view of the topic of Gödelian extensions of theories. It presents the basic material in predicate logic, set theory and recursion theory, leading to a proof of Gödel's incompleteness theorems. The inexhaustibility of mathematics is treated based on the concept of transfinite progressions of theories as conceived by Turing and Feferman. All concepts and results are introduced as needed, making the presentation self-contained and thorough. Philosophers, mathematicians and others will find the book helpful in acquiring a basic grasp of the philosophical and logical results and issues.

    • Allows philosophers and mathematicians to acquire a basic grasp of the philosophical and logical results and issues around inexhaustibility
    • A self-contained presentation, aimed at readers who wish to understand the inexhaustibility phenomenon pointed out by Gödel, whatever their level of expertise in logic
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Publication planned for: April 2020
    • format: Adobe eBook Reader
    • isbn: 9781108641630
    • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • Table of Contents

    Preface
    1. Introduction
    2. Arithmetical preliminaries
    3. Primes and proofs
    4. The language of arithmetic
    5. The language of analysis
    6. Ordinals and inductive definitions
    7. Formal languages and the definition of truth
    8. Logic and theories
    9. Peano arithmetic and computability
    10. Elementary and classical analysis
    11. The recursion theorem and ordinal notations
    12. The incompleteness theorems
    13. Iterated consistency
    14. Iterated reflection
    15. Iterated iteration and inexhaustibility
    References
    Index.

  • Author

    Torkel Franzén, Luleå Tekniska Universitet, Sweden
    Torkel Franzén works in the Computer Science Department at Luleå Tekniska Universitet, Sweden.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×