A Rather Classless Model

DOI10.2307/2041038MaRDI QIDQ4132525zbMATH OpenOpenAlexFDO

Authors Matt Kaufmann

Publication date 1977

Full work available at URL https://doi.org/10.2307/2041038

Mathematics Subject Classification ID

Other model constructions (03C30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

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

Cited in

(19)

• Models of Peano arithmetic and a question of Sikorski on ordered fields
• Destructibility and axiomatizability of Kaufmann models
• Condensable models of set theory
• Full satisfaction classes, definability, and automorphisms
• Set theoretical analogues of the Barwise-Schlipf theorem
• Models of weak theories of truth
• Peano Arithmetic and Hyper-Ramsey Logic
• Remarks on weak notions of saturation in models of Peano arithmetic
• scientific article; zbMATH DE number 4043829 (Why is no real title available?)
• Extendible Sets in Peano Arithmetic
• scientific article; zbMATH DE number 1420850 (Why is no real title available?)
• Incomparable \(\omega_1\)-like models of set theory
• Totally non-immune sets
• Models of positive truth
• Undefinability of truth and nonstandard models
• A note on a theorem of Kanovei
• Saturation and simple extensions of models of Peano arithmetic
• Recursively saturated \(\omega _ 1\)-like models of arithmetic
• Nonstandard definability

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)