2019
DOI: 10.1002/malq.201800010
|View full text |Cite
|
Sign up to set email alerts
|

Complete Lω1,ω‐sentences with maximal models in multiple cardinalities

Abstract: In [BKS14] examples of incomplete sentences are given with maximal models in more than one cardinality. The question was raised whether one can find similar examples of complete sentences. In this paper we give examples of complete Lω 1 ,ωsentences with maximal models in more than one cardinality. From (homogeneous) characterizability of κ we construct sentences with maximal models in κ and in one of κ + , κ ω , 2 κ and more. Indeed, consistently we find sentences with maximal models in uncountably many distin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(15 citation statements)
references
References 14 publications
0
15
0
Order By: Relevance
“…They also asserted that they had a similar construction to characterize all cardinals up to ℵ ω , but there was a mistake in the proof. 8 We remedy that now.…”
Section: Homogeneous Characterizabilitymentioning
confidence: 95%
See 3 more Smart Citations
“…They also asserted that they had a similar construction to characterize all cardinals up to ℵ ω , but there was a mistake in the proof. 8 We remedy that now.…”
Section: Homogeneous Characterizabilitymentioning
confidence: 95%
“…The examples of Kolesnikov and Lambie-Hanson are distinctive as amalgamation is equivalent to disjoint amalgamation: some results depend on a generalized Martin axiom. The construction of non-trivial spectra of disjoint embedding [6] and of maximal models for complete sentences [8] rely on the current paper.…”
Section: Context and Conclusionmentioning
confidence: 99%
See 2 more Smart Citations
“…Again, the result is considerably more complicated for complete sentences. But [BS15b] show that there is a sentence φ in a vocabulary with a predicate X such that if M |= φ, |M | ≤ |X(M )| + and for every κ there is a model with |M | = κ + and |X(M )| = κ. Further they note that if there is a sentence φ that homogenously characterizes κ, then there is a sentence φ ′ with a new predicate B such that φ ′ also characterizes κ, B defines a set of absolute indiscernibles in the countable model, and there are models M λ for λ ≤ κ such that (|M |, |B(M λ )|) = (κ, λ).…”
Section: The Big Gapmentioning
confidence: 97%