Existentially closed structures and gödel's second incompleteness theorem

Journal of Symbolic Logic 66 (1):349-356 (2001)
  Copy   BIBTEX

Abstract

We prove that any 1-closed (see def 1.1) model of the Π 2 consequences of PA satisfies ¬Cons PA which gives a proof of the second Godel incompleteness theorem without the use of the Godel diagonal lemma. We prove a few other theorems by the same method.

Other Versions

No versions found

Analytics

Added to PP
2009-01-28

Downloads
404 (#121,022)

6 months
47 (#176,809)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Current Research on Gödel’s Incompleteness Theorems.Yong Cheng - 2021 - Bulletin of Symbolic Logic 27 (2):113-167.
The incompleteness theorems after 70 years.Henryk Kotlarski - 2004 - Annals of Pure and Applied Logic 126 (1-3):125-138.
Passive induction and a solution to a Paris–Wilkie open question.Dan E. Willard - 2007 - Annals of Pure and Applied Logic 146 (2-3):124-149.
The Model Theory of Generic Cuts.Richard Kaye & Tin Lok Wong - 2015 - In Åsa Hirvonen, Juha Kontinen, Roman Kossak & Andrés Villaveces, Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics. Boston: De Gruyter. pp. 281-296.
The Scope of Gödel’s First Incompleteness Theorem.Bernd Buldt - 2014 - Logica Universalis 8 (3-4):499-552.

View all 10 citations / Add more citations

References found in this work

A Note on Boolos' Proof of the Incompleteness Theorem.Makoto Kikuchi - 1994 - Mathematical Logic Quarterly 40 (4):528-532.
Kolmogorov complexity and the second incompleteness theorem.Makoto Kikuchi - 1997 - Archive for Mathematical Logic 36 (6):437-443.
Other Proofs of Old Results.Henryk Kotlarski - 1998 - Mathematical Logic Quarterly 44 (4):474-480.
Overspill and fragments of arithmetic.C. Dimitracopoulos - 1989 - Archive for Mathematical Logic 28 (3):173-179.

Add more references