Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Kurepa trees and spectra of $\mathcal{L}_{ω_1,ω}$-sentences (1705.05821v3)

Published 16 May 2017 in math.LO

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}$.

Summary

We haven't generated a summary for this paper yet.