Enayat Models of Peano Arithmetic
Athar Abdul-Quader

TL;DR
This paper investigates Enayat models of Peano Arithmetic, characterizing their properties and demonstrating their existence for any countable linear order, thus advancing understanding of models with specific definability features.
Contribution
It provides a characterization of Enayat models of PA and proves their existence for all countable linear orders, expanding the class of known models with unique definability properties.
Findings
Enayat models are countable, have no proper cofinal submodels, and are conservative extensions of all their elementary cuts.
Such models exist for any countable linear order.
The paper establishes conditions under which Enayat models can be constructed.
Abstract
Simpson showed that every countable model has an expansion that is pointwise definable. A natural question is whether, in general, one can obtain expansions of a non-prime model in which the definable elements coincide with those of the underlying model. Enayat showed that this is impossible by proving that there is such that for each undefinable class of , the expansion is pointwise definable. We call models with this property Enayat models. In this paper, we study Enayat models and show that a model of is Enayat if it is countable, has no proper cofinal submodels and is a conservative extension of all of its elementary cuts. We then show that, for any countable linear order , if there is a model such that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
