A Note on Real Subsets of A Recursively Saturated Model
Let \(L\) be the language of Peano Arithmetic and \(M\) be a countable recursively saturated model of PA. For every \(a\in M\) let \(\sim_ a\) be the equivalence \[ x\sim_ ay\hbox{ iff for all }\varphi(v_ 0,v_ i)\in L,\quad M\models\varphi(x,a) \Leftrightarrow \varphi(y,a). \] The sets \(X\subseteq M\) which consist of whole equivalence classes with respect to some \(\sim_ a\) are called real. The nonreal sets are called imaginary. It is shown that all usual sorts of objects whose construction in \(M\) need some kind of choice are imaginary. Namely: a) nontrivial automorphisms of \(M\), b) well-orderings of \(M\), c) bijections between coded subsets of \(M\) of ``very different internal cardinalities, and d) nontrivial ultrafilters, are imaginary subsets of \(M\). An open problem concerning ultrafilters is also stated.
- Automorphisms of recursively saturated models of arithmetic
- Vive la différence. II: The Ax-Kochen isomorphism theorem
- Proper and piecewise proper families of reals
- A note on standard systems and ultrafilters
- scientific article; zbMATH DE number 4010521 (Why is no real title available?)
- On expandability of models of Peano arithmetic to models of the alternative set theory
- Some highly saturated models of Peano arithmetic
- UNCOUNTABLE REAL CLOSED FIELDS WITH PA INTEGER PARTS
This page was built for publication: A Note on Real Subsets of A Recursively Saturated Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989272)
