A Rather Classless Model
From MaRDI portal
Publication:4132525
DOI10.2307/2041038zbMath0359.02054OpenAlexW4240806172MaRDI QIDQ4132525
Publication date: 1977
Full work available at URL: https://doi.org/10.2307/2041038
Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Other model constructions (03C30)
Related Items (14)
Condensable models of set theory ⋮ Full satisfaction classes, definability, and automorphisms ⋮ Set theoretical analogues of the Barwise-Schlipf theorem ⋮ Peano Arithmetic and Hyper-Ramsey Logic ⋮ Models of weak theories of truth ⋮ Undefinability of truth and nonstandard models ⋮ Incomparable ω1‐like models of set theory ⋮ Nonstandard definability ⋮ MODELS OF POSITIVE TRUTH ⋮ Totally non‐immune sets ⋮ Saturation and simple extensions of models of Peano arithmetic ⋮ Destructibility and axiomatizability of Kaufmann models ⋮ Models of Peano arithmetic and a question of Sikorski on ordered fields ⋮ Extendible Sets in Peano Arithmetic
Cites Work
This page was built for publication: A Rather Classless Model
