Destructibility and Axiomatizability of Kaufmann Models
Corey Bacal Switzer

TL;DR
This paper investigates the set-theoretic properties of Kaufmann models, focusing on their destructibility via forcing and axiomatizability in extended logics, revealing independence results from ZFC.
Contribution
It demonstrates the independence of Kaufmann models' destructibility and axiomatizability from ZFC, connecting these issues to Aronszajn trees and advanced set-theoretic techniques.
Findings
Destructibility of Kaufmann models is independent of ZFC.
Axiomatizability of Kaufmann models in L_{ω_1, ω}(Q) is independent of ZFC.
Results relate Kaufmann models to incompactness phenomena like Aronszajn trees.
Abstract
A Kaufmann model is an -like, recursively saturated, rather classless model of or . Such models were constructed by Kaufmann under the combinatorial principle and Shelah showed they exist in by an absoluteness argument. Kaufmann models are an important witness to the incompactness of similar to Aronszajn trees. In this paper we look at some set theoretic issues related to this motivated by the seemingly na\"{i}ve question of whether such a model can be "killed" by forcing without collapsing . We show that the answer to this question is independent of and closely related to similar questions about Aronszajn trees. As an application of these methods we also show that it is independent of whether or not Kaufmann models can be axiomatized in the logic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Advanced Graph Theory Research
