Formal Background for the Incompleteness and Undefinability Theorems

Abstract

A teaching document I've used in my courses on truth and on incompleteness. Aimed at students who have a good grasp of basic logic, and decent math skills, it attempts to give them the background they need to understand a proper statement of the classic results due to Gödel and Tarski, and sketches their proofs. Topics covered include the notions of language and theory, the basics of formal syntax and arithmetization, formal arithmetic (Q and PA), representability, diagonalization, and the incompleteness and undefinability theorems.

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2022-08-14

Downloads
261 (#74,527)

6 months
86 (#48,621)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Richard Kimberly Heck
Brown University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references