paper

Kurepa trees and spectra of -sentences

arXiv:1705.05821 · doi:10.1007/s00153-020-00729-4

Abstract

We use set-theoretic tools to make a model-theoretic contribution. In particular, we construct a \emph{single} -sentence that codes Kurepa trees to prove the consistency of the following: (1) The spectrum of is consistently equal to and also consistently equal to , where is weakly inaccessible. (2) The amalgamation spectrum of is consistently equal to and , where again is weakly inaccessible. This is the first example of an -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) and there exists an -sentence with models in , but no models in . This relates to a conjecture by Shelah that if , then any -sentence with a model of size also has a model of size . Our result proves that can not be replaced by , even if .

to appear in the Journal of Mathematical Logic

References in corpus (3)

Cited by in corpus (1)