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

Open Logic Project (2019)
  Copy   BIBTEX

Abstract

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.

Author's Profile

Richard Zach
University of Calgary

Analytics

Added to PP
2019-04-04

Downloads
1,695 (#5,932)

6 months
533 (#2,731)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?