Now in a new edition!--the classic presentation of the theory of computable functions in the context of the foundations of mathematics. Part I motivates the study of computability with discussions and readings about the crisis in the foundations of mathematics in the early 20th century while presenting the basic ideas of whole number, function, proof, and real number. Part II starts with readings from Turing and Post leading to the formal theory of recursive functions. Part III presents sufficient formal logic to give a full development of Gödel's incompleteness theorems. Part IV considers the significance of the technical work with a discussion of Church's Thesis and readings on the foundations of mathematics. This new edition contains the timeline "Computability and Undecidability" as well as the essay "On mathematics".

eBook - PDF
Computability
Computable Functions, Logic, and the Foundations of Mathematics
- 382 pages
- English
- PDF
- Available on iOS & Android
eBook - PDF
Computability
Computable Functions, Logic, and the Foundations of Mathematics
About this book
Trusted by 375,005 students
Access to over 1 million titles for a fair monthly price.
Study more efficiently using our study tools.
Information
Table of contents
- Table of Contents
- Preface
- 1 Paradoxes
- 2 What Do the Paradoxes Mean?
- 3 Whole Numbers
- 4 Functions
- 5 Proofs
- 6 Infinite Collections?
- 7 Hilbert "On the Infinite"
- 8 Computability
- 9 Turing Machines
- 10 The Most Amazing Fact and Church's Thesis
- 11 Primitive Recursive Functions
- 12 The Grzegorczyk Hierarchy
- 13 Multiple Recursion
- 14 The Least Search Operator
- 15 Partial Recursive Functions
- 16 Numbering the Partial Recursive Functions
- 17 Listability
- 18 Turing Machine Computable = Partial Recursive
- 19 Propositional Logic
- 20 An Overview of First-Order Logic and Gödel's Theorems
- 21 First-Order Arithmetic
- 22 Functions Representable in Formal Arithmetic
- 23 The Undecidability of Arithmetic
- 24 The Unprovability of Consistency
- 25 Church's Thesis
- 26 Constructivist Views of Mathematics
- 27 Mathematics as Modeling
- Computability and Undecidability—A Timeline
- Bibliography
- Glossary and Index of Notation
- Index
Frequently asked questions
Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn how to download books offline
Perlego offers two plans: Essential and Complete
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 990+ topics, we’ve got you covered! Learn about our mission
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more about Read Aloud
Yes! You can use the Perlego app on both iOS and Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app
Yes, you can access Computability by Richard L Epstein,Walter A Carnielli in PDF and/or ePUB format, as well as other popular books in Mathematics & Logic in Mathematics. We have over one million books available in our catalogue for you to explore.