Destructibility and Axiomatizability of Kaufmann Models

DOI10.1007/S00153-022-00826-6MaRDI QIDQ6348073arXivFDO

Publication date 31 August 2020

Full work available at URL https://doi.org/10.1007/S00153-022-00826-6

Models of arithmetic and set theory (03C62) Logic with extra quantifiers and operators (03C80) Consistency and independence results (03E35) Continuum hypothesis and Martin's axiom (03E50)

arXiv classification

math.LO

Abstract: A Kaufmann model is an

o m e g a_{1}

-like, recursively saturated, rather classless model of

m a t h r m P A

or

m a t h r m Z F

. Such models were constructed by Kaufmann under the combinatorial principle

d i a m o n d s u i t_{o m e g a_{1}}

and Shelah showed they exist in

m a t h r m Z F C

by an absoluteness argument. Kaufmann models are an important witness to the incompactness of

o m e g a_{1}

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

o m e g a_{1}

. We show that the answer to this question is independent of

m a t h r m Z F C

and closely related to similar questions about Aronszajn trees. As an application of these methods we also show that it is independent of

m a t h r m Z F C

whether or not Kaufmann models can be axiomatized in the logic

L_{o m e g a_{1}, o m e g a} (Q)

where

Q

is the quantifier "there exists uncountably many".

This page was built for publication: Destructibility and Axiomatizability of Kaufmann Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6348073)