Incompleteness and Computability: An Open Introduction to Gödel's Theorems
Overview & Synopsis
This book is an introduction to metamathematics and Gödel's Theorems. It covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.
Indexed from repository: FreeComputerBooks.com
(
freecomputerbooks.com)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Incompleteness and Computability: An Open Introduction to Gödel's Theorems |
|---|---|
| Author / Organization | Richard Zach |
| Subject & Discipline | Mathematical Logic - Computability, Set Theory, Model Theory, etc, Theory of Computation and Computing, Computational Complexity |
| Categories | Mathematical Logic - Computability, Set Theory, Model Theory, etc |
| Publication Year | 2019 |
| ISBN | 1077323395 |
| License / Rights | CC BY 4.0 |
| Resource Verification | Access Restricted / Protected Host |
| Alternative Mirrors & Links | |
| Original Host Website |
FreeComputerBooks.com
(freecomputerbooks.com)
|
| File Format | application/pdf (Portable Document Format) |
| Language | ENGLISH |
| Catalog ID | DOC-71815 |
| Original Source Link | Visit Source Page on freecomputerbooks.com » |
Commercial / Print Edition
Prefer a Physical Book or Kindle Edition?
Incompleteness and Computability: An Open Introduction to Gödel's Theorems • Print Edition
As an Amazon Associate, MainReads earns from qualifying purchases.