Four problems concerning recursively saturated models of arithmetic
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4010521 (Why is no real title available?)
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- scientific article; zbMATH DE number 3566838 (Why is no real title available?)
- A certain class of models of Peano arithmetic
- A note on initial segment constructions in recursively saturated models of arithmetic
- Automorphisms of recursively saturated models of arithmetic
- Elementary extensions of recursively saturated models of arithmetic
- Full satisfaction classes: A survey
- Hanf numbers for omitting types over particular theories
- Minimal satisfaction classes with an application to rigid models of Peano arithmetic
- Models and types of Peano's arithmetic
- On maximal subgroups of the automorphism group of a countable recursively saturated model of PA
- Results on automorphisms of recursively saturated models of PA
Cited in
(7)- The complexity of classification problems for models of arithmetic
- GAME APPROXIMATIONS OF SATISFACTION CLASSES MODELS
- Undefinability of truth and nonstandard models
- Truth in generic cuts
- Recursively saturated nonstandard models of arithmetic; addendum
- scientific article; zbMATH DE number 1415871 (Why is no real title available?)
- Recursively saturated \(\omega _ 1\)-like models of arithmetic
This page was built for publication: Four problems concerning recursively saturated models of arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1913627)