Four problems concerning recursively saturated models of arithmetic
DOI10.1305/NDJFL/1040136913zbMATH Open0848.03016OpenAlexW2090746463MaRDI QIDQ1913627FDOQ1913627
Authors: Roman Kossak 
Publication date: 22 May 1996
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1040136913
Recommendations
Peano arithmeticopen problemsrecursive saturationrecursively saturated models of PAextendability of automorphismsinductive satisfaction classes
Models with special properties (saturated, rigid, etc.) (03C50) Models of arithmetic and set theory (03C62)
Cites Work
- Title not available (Why is that?)
- Elementary extensions of recursively saturated models of arithmetic
- Title not available (Why is that?)
- Full satisfaction classes: A survey
- Minimal satisfaction classes with an application to rigid models of Peano arithmetic
- A certain class of models of Peano arithmetic
- A note on initial segment constructions in recursively saturated models of arithmetic
- Title not available (Why is that?)
- Automorphisms of recursively saturated models of arithmetic
- Results on automorphisms of recursively saturated models of PA
- Models and types of Peano's arithmetic
- Hanf numbers for omitting types over particular theories
- On maximal subgroups of the automorphism group of a countable recursively saturated model of PA
Cited In (7)
- GAME APPROXIMATIONS OF SATISFACTION CLASSES MODELS
- Undefinability of truth and nonstandard models
- Truth in generic cuts
- Recursively saturated nonstandard models of arithmetic; addendum
- Title not available (Why is that?)
- Recursively saturated \(\omega _ 1\)-like models of arithmetic
- The complexity of classification problems for 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)
