On Models Constructed by Means of the Arithmetized Completeness Theorem
Richard Kaye, Henryk Kotlarski
Abstract
Richard Kaye, Henryk Kotlarski
Abstract
In this paper we study the model theory of extensions of models of first-order Peano Arithmetic (PA) by means of the arithmetized completeness theorem (ACT) 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.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we study the model theory of extensions of models of first-order Peano Arithmetic (PA) by means of the arithmetized completeness theorem (ACT) 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.
Key concepts: Peano axioms, Mathematics, Gödel's completeness theorem, Completeness (order theory), Model theory, Extension (predicate logic), Second-order arithmetic, Consistency (knowledge bases)