Discernible elements in models for Peano arithmetic
From MaRDI portal
Cited in
(13)- Automorphisms of recursively saturated models of arithmetic
- On expandability of models of Peano arithmetic. II
- Ehrenfeucht's lemma in set theory
- The diversity of minimal cofinal extensions
- R.e. Prime powers and total rigidity
- On mathematical realism and applicability of hyperreals
- Interstitial and pseudo gaps in models of Peano arithmetic
- A Galois correspondence for countable short recursively saturated models of PA
- Automorphism groups of models of Peano arithmetic
- Neutrally expandable models of arithmetic
- Leibnizian models of set theory
- Undefinability of truth and nonstandard models
- The lattice problem for models of \(\mathsf{PA}\)
This page was built for publication: Discernible elements in models for Peano arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4404878)