# Kurepa trees and spectra of $\mathcal{L}_{\omega_1,\omega}$-sentences

**Authors:** Dima Sinapova, Ioannis Souldatos

arXiv: 1705.05821 · 2020-03-23

## TL;DR

This paper constructs a single $_{_1,}$-sentence coding Kurepa trees to demonstrate various consistent spectra and amalgamation spectra, providing new insights into model theory and set theory interactions.

## Contribution

It introduces the first $_{_1,}$-sentence with both right-open and right-closed spectra, addressing open questions and exploring maximal models and size relations.

## Key findings

- Spectra can be both right-open and right-closed.
- Existence of $_{_1,}$-sentences with multiple maximal models.
- Models exist in $\u0005_{_1}$ but not in $2^{_1}$, disproving a conjecture.

## Abstract

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

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1705.05821/full.md

## References

20 references — full list in the complete paper: https://tomesphere.com/paper/1705.05821/full.md

---
Source: https://tomesphere.com/paper/1705.05821