Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNeutrally Expandable Models of Arithmetic
97
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A subset of a model of ${sf PA}$ is called neutral if it does not change the $mathrm{dcl}$ relation. A model with undefinable neutral classes is called neutrally expandable. We study the existence and non-existence of neutral sets in various models of ${sf PA}$. We show that cofinal extensions of prime models are neutrally expandable, and $omega_1$-like neutrally expandable models exist, while no recursively saturated model is neutrally expandable. We also show that neutrality is not a first-order property. In the last section, we study a local version of neutral expandability.
rate research
Read More
Simpson showed that every countable model $mathcal{M} models mathsf{PA}$ has an expansion $(mathcal{M}, X) models mathsf{PA}^*$ 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 $mathcal{M} models mathsf{PA}$ such that for each undefinable class $X$ of $mathcal{M}$, the expansion $(mathcal{M}, X)$ is pointwise definable. We call models with this property Enayat models. In this paper, we study Enayat models and show that a model of $mathsf{PA}$ 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 $gamma$, if there is a model $mathcal{M}$ such that $mathrm{Lt}(mathcal{M}) cong gamma$, then there is an Enayat model $mathcal{M}$ such that $mathrm{Lt}(mathcal{M}) cong gamma$.
We study notions of genericity in models of $mathsf{PA}$, inspired by lines of inquiry initiated by Chatzidakis and Pillay and continued by Dolich, Miller and Steinhorn in general model-theoretic contexts. These papers studied the theories obtained by adding a random predicate to a class of structures. Chatzidakis and Pillay axiomatized the theories obtained in this way. In this article, we look at the subsets of models of $mathsf{PA}$ which satisfy the axiomatization given by Chatzidakis and Pillay; we refer to these subsets in models of $mathsf{PA}$ as CP-generics. We study a more natural property, called strong CP-genericity, which implies CP-genericity. We use an arithmetic version of Cohen forcing to construct (strong) CP-generics with various properties, including ones in which every element of the model is definable in the expansion, and, on the other extreme, ones in which the definable closure relation is unchanged.
If $M prec N$ are models of Peano Arithmetic and Lt$(N/M)$ is the pentagon lattice $N_5$, then $N$ is either a cofinal or an end extension of $M$. In contrast, there are $M prec N$ that are models of PA* (PA in a language with countably many new predicate symbols) such that Lt$(N/M) cong N_5$ and $N$ is neither a cofinal nor an end extension of $M$.
We show that Browns lemma is equivalent to Sigma02-induction over RCA0* and that the finite version of Browns lemma is provable in RCA0 but not in RCA0*.
We analyze Ekelands variational principle in the context of reverse mathematics. We find that that the full variational principle is equivalent to $Pi^1_1$-${sf CA}_0$, a strong theory of second-order arithmetic, while natural restrictions (e.g.~to compact spaces or continuous functions) yield statements equivalent to weak Konigs lemma (${sf WKL}_0$) and to arithmetical comprehension (${sf ACA}_0$). We also find that the localized version of Ekelands variational principle is equivalent to $Pi^1_1$-${sf CA}_0$ even when restricting to continuous functions. This is a rare example of a statement about continuous functions having great logical strength.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
