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.

Other Versions

No versions found

Similar books and articles

Analytics

Added to PP
2019-04-04

Downloads
2,083 (#6,419)

6 months
232 (#12,801)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Richard Zach
University of Calgary

Citations of this work

Logical Disagreement.Frederik J. Andersen - 2024 - Dissertation, University of St. Andrews

Add more citations

References found in this work

A note on the entscheidungsproblem.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (1):40-41.
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.
An Introduction to Gödel's Theorems.Peter Smith - 2007 - New York: Cambridge University Press.
An Introduction to Gödel's Theorems.Peter Smith - 2009 - Bulletin of Symbolic Logic 15 (2):218-222.

View all 15 references / Add more references