Incompleteness and Computability: An Open Introduction to Gödel's Theorems

Open Logic Project (2019)
Download Edit this record How to cite View on PhilPapers
Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.
Reprint years
1077323395   9781077323391
PhilPapers/Archive ID
Upload history
First archival date: 2019-04-04
Latest version: 2 (2019-11-27)
View other versions
Added to PP index

Total views
521 ( #12,660 of 65,651 )

Recent downloads (6 months)
116 ( #5,302 of 65,651 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.