On Models Constructed by Means of the Arithmetized Completeness Theorem

Mathematical Logic Quarterly 46 (4):505-516 (2000)
  Copy   BIBTEX

Abstract

In this paper we study the model theory of extensions of models of first-order Peano Arithmetic by means of the arithmetized completeness theorem applied to a definable complete extension of PA in the original model. This leads us to many interesting model theoretic properties equivalent to reflection principles and ω-consistency, and these properties together with the associated first-order schemes extending PA are studied

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,290

External links

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

Through your library

Similar books and articles

Resplendent models and $${\Sigma_1^1}$$ -definability with an oracle.Andrey Bovykin - 2008 - Archive for Mathematical Logic 47 (6):607-623.
Completeness and categoricity: Frege, gödel and model theory.Stephen Read - 1997 - History and Philosophy of Logic 18 (2):79-93.
Blunt and topless end extensions of models of set theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.
Other Proofs of Old Results.Henryk Kotlarski - 1998 - Mathematical Logic Quarterly 44 (4):474-480.
A Model–Theoretic Approach to Proof Theory.Henryk Kotlarski - 2019 - Cham, Switzerland: Springer Verlag.
Omega‐ and Beta‐Models of Alternative Set Theory.Athanassios Tzouvaras - 1994 - Mathematical Logic Quarterly 40 (4):547-569.

Analytics

Added to PP
2013-12-01

Downloads
42 (#524,884)

6 months
5 (#1,013,651)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references