Boolos-style proofs of limitative theorems

2003/09/20 by Gyorgy Sereny, György Serény, Sereny, Gyorgy
Mathematics · Psychology · #03F30 #FOS: Mathematics #Logic (math.LO) #Philosophy and Theoretical Science #math.LO #msc:03F30

paper · pdf · doi:10.48550/arxiv.math/0309345

6 pages

arxiv created 2003/09/20 · openalex publication_date 2003/09/20 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Boolos's proof of incompleteness is extended straightforwardly to yield simple ``diagonalization-free'' proofs of some classical limitative theorems of logic.

Related

• Boolos' Hardest Logic Puzzle Ever can be solved in no less than three admissible questions: axiomatic framework and rigorous proof
• A Completeness Theorem for "Total Boolean Functions"
• Boole's Method I. A Modern Version
• Reflexivity and the diagonal argument in proofs of limitative theorems
• The diagonal lemma as the formalized Grelling paradox