Kurepa trees and spectra of Lω1,ω-sentences

Abstract

We use set-theoretic tools to make a model-theoretic contribution. In particular, we construct a single Lω1,ω-sentence that codes Kurepa trees to prove the consistency of the following: (1) The spectrum of is consistently equal to [0,ω1] and also consistently equal to [0,21), where 21 is weakly inaccessible. (2) The amalgamation spectrum of is consistently equal to [1,ω1] and [1,21), where again 21 is weakly inaccessible. This is the first example of an Lω1,ω-sentence whose spectrum and amalgamation spectrum are consistently both right-open and right-closed. It also provides a positive answer to a question in [18]. (3) Consistently, has maximal models in finite, countable, and uncountable many cardinalities. This complements the examples given in [1] and [2] of sentences with maximal models in countably many cardinalities. (4) 20<ω1<21 and there exists an Lω1,ω-sentence with models in ω1, but no models in 21. This relates to a conjecture by Shelah that if ω1<20, then any Lω1,ω-sentence with a model of size ω1 also has a model of size 20. Our result proves that 20 can not be replaced by 21, even if 20<ω1.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…