Kurepa trees and spectra of L__1, -sentences

From MaRDI portal
Publication:2204375



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












This page was built for publication: Kurepa trees and spectra of \(\mathcal{L}_{\omega_1, \omega}\)-sentences

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