A Rather Classless Model
From MaRDI portal
Publication:4132525
DOI10.2307/2041038zbMATH Open0359.02054OpenAlexW4240806172MaRDI QIDQ4132525FDOQ4132525
Authors: Matt Kaufmann
Publication date: 1977
Full work available at URL: https://doi.org/10.2307/2041038
Recommendations
- Recursively saturated \(\omega _ 1\)-like models of arithmetic
- Remarks on weak notions of saturation in models of Peano arithmetic
- Minimal satisfaction classes with an application to rigid models of Peano arithmetic
- scientific article; zbMATH DE number 3882429
- scientific article; zbMATH DE number 1222930
Other model constructions (03C30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Cites Work
Cited In (19)
- A note on a theorem of Kanovei
- Totally non‐immune sets
- Title not available (Why is that?)
- Remarks on weak notions of saturation in models of Peano arithmetic
- Extendible Sets in Peano Arithmetic
- Undefinability of truth and nonstandard models
- Title not available (Why is that?)
- Full satisfaction classes, definability, and automorphisms
- Incomparable ω1‐like models of set theory
- Set theoretical analogues of the Barwise-Schlipf theorem
- Saturation and simple extensions of models of Peano arithmetic
- Nonstandard definability
- Peano Arithmetic and Hyper-Ramsey Logic
- Recursively saturated \(\omega _ 1\)-like models of arithmetic
- Models of Peano arithmetic and a question of Sikorski on ordered fields
- Destructibility and axiomatizability of Kaufmann models
- Models of weak theories of truth
- MODELS OF POSITIVE TRUTH
- Condensable models of set theory
This page was built for publication: A Rather Classless Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132525)