Destructibility and Axiomatizability of Kaufmann Models

Veröffentlichungen: Beitrag in FachzeitschriftArtikelPeer Reviewed

Abstract

A Kaufmann model is an ω 1-like, recursively saturated, rather classless model of PA (or ZF). Such models were constructed by Kaufmann under the combinatorial principle ♢ω1 and Shelah showed they exist in ZFC by an absoluteness argument. Kaufmann models are an important witness to the incompactness of ω 1 similar to Aronszajn trees. In this paper we look at some set theoretic issues related to this motivated by the seemingly naïve question of whether such a model can be “killed” by forcing without collapsing ω 1. We show that the answer to this question is independent of ZFC and closely related to similar questions about Aronszajn trees. As an application of these methods we also show that it is independent of ZFC whether or not Kaufmann models can be axiomatized in the logic Lω1,ω(Q) where Q is the quantifier “there exists uncountably many”.

OriginalspracheEnglisch
Seiten (von - bis)1091-1111
Seitenumfang21
FachzeitschriftArchive for Mathematical Logic
Jahrgang61
Ausgabenummer7-8
DOIs
PublikationsstatusVeröffentlicht - 2022

ÖFOS 2012

  • 101013 Mathematische Logik

Fingerprint

Untersuchen Sie die Forschungsthemen von „Destructibility and Axiomatizability of Kaufmann Models“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitationsweisen