Universal theories and compactly expandable models
Enrique Casanovas and Saharon Shelah
Research partially supported by European Research Council grant 338821. No. 1116 on Shelah’s publication list. The first author has been partially funded by the Spanish government grant MTM2014-59178-P.
(May 5, 2017. Last revised February 23, 2019.)
Abstract
Our aim is to solve a quite old question on the difference between expandability and compact expandability. Toward this, we further investigate the logic of countable cofinality.
1 Introduction
In this article we solve an open problem on expandability of models by an application of some new results we obtain on the logic L(Qℵ0cf), first-order logic with the additional quantifier Qℵ0cf of cofinality ℵ0. The syntax of L(Qℵ0cf) allows the construction of formulas of the form Qℵ0cfxyφ(x,y,z). The meaning of this formula in a structure M is given by the rule: M⊨Qℵ0cfxyφ(x,y,a) if and only if the relation {(b,c):M⊨φ(b,c,a)} is a linear ordering of the set {c:M⊨∃xφ(x,c,a)} and has cofinality ℵ0.
The second author has introduced L(Qℵ0cf) in [Sh:43] and has proved that is a fully compact logic, i.e., a set Σ of L(Qℵ0cf)-sentences (of any cardinality) has a model if every finite subset of Σ has a model. In the same article it is proved that L(Qℵ0cf) satisfies the Löwenheim-Skolem theorem down to ℵ1, in the following particularly strong form combining downward an upward Löwenheim-Skolem theorems: if Σ is a set of L(Qℵ0cf)-sentences having an infinite model, then Σ has a model in every cardinal κ≥ℵ1,∣Σ∣. See theorems 2.5 and 2.6 of [Sh:43] applied to n=0, μ=1 and λ0=ℵ0. Compactness of L(Qℵ0cf) will be used here to show that for any cardinal κ=2<κ>ℵ0, L(Qℵ0cf) has a κ-universal theory. The Löwenheim-Skolem theorem won’t be used until the very end, in the proof of Proposition 3.6.
In section 2 we define some classes of L(Qℵ0cf)-theories, in particular the class T<κec of theories with vocabulary of cardinality <κ which are in some sense an analog of existentially closed models and its extension T<κab, the class of theories with vocabulary of cardinality <κ which are amalgamation bases. We prove that if κ=2<κ>ℵ0, then any amalgamation base T∗∈T<κab can be extended to some existentially closed T∈T<κ+ec which is universal over T∗, meaning that every consistent extension of T∗ of cardinality ≤κ can be embedded over T∗ in T. The proof only uses compactness and some basic facts of the logic L(Qℵ0cf), such as finitary character and possibility of renaming, and they can be easily generalized to other similar compact logics (see Remark 2.8).
The notions of expandability and compact expandability were introduced by the first author in [Cas95] and further discussed in [Cas98]. They are notions of largeness for models related to first-order theories, similar to resplendency but without the use of parameters. In these articles the existence of a compactly expandable model which is not expandable is left as an open problem. In Section 3 we solve the problem using the tools developed in Section 2.
To simplify notation, we will only consider relational languages, but the results can be easily adapted to languages with constants and function symbols. A vocabulary τ is a set of symbols, predicates in our case. If T is a theory (a first-order theory or a L(Qℵ0cf)-theory) τ(T) will be the vocabulary of T. L(Qℵ0cf)(τ) is the set of L(Qℵ0cf)-sentences of vocabulary τ. Along the whole article κ,μ are infinite cardinal numbers. Along all this paper, consistent means finitely satisfiable. Since we are dealing with a compact logic, this is the same thing as being satisfiable.
2 Universal theories in L(Qℵ0cf)
In this section we work with sentences and theories of the compact logic L(Qℵ0cf) of countable cofinality.
Definition 2.1
Let τ1,τ2 be vocabularies.
-
An embedding of τ1 in τ2 is a one-to-one mapping f:τ1→τ2 that preserves arities. It is over τ0⊆τ1 if every symbol of τ0 remains fixed by f. It is an isomorphism if it is moreover surjective. If R=⟨R1,…,Rn⟩ and S=⟨S1,…,Sm⟩ are tuples of predicates, we write R≈S if they have the same length n=m and the mapping defined by Ri↦Si is an isomorphism of vocabularies, i.e., it is one-to-one and preserves arities.
2. 2.
Any embedding f:τ1→τ2 induces a renaming, a mapping from L(Qℵ0cf)(τ1) into L(Qℵ0cf)(τ2) for which we will use the same notation f. If σ∈L(Qℵ0cf)(τ1), f(σ) is the sentence obtained by substitution of every symbol R∈τ1 of σ by the corresponding symbol f(R)∈τ2.
3. 3.
Assume τ1⊆τ2. The notation ψ(R,S) will be used for L(Qℵ0cf)(τ2)-sentences with the understanding that R⊆τ1 and S⊆τ2∖τ1 are tuples of predicates without repetitions and they include all predicates appearing in the sentence.
Definition 2.2
-
Let T<κ be the class of consistent L(Qℵ0cf)-theories T such that τ(T) has cardinality <κ.
2. 2.
Let T<κc be the class of all theories T∈T<κ which are complete in L(Qℵ0cf)(τ(T)), so in particular are closed under conjunction.
3. 3.
Let T<κab be the class of all T0∈T<κc which are amalgamation bases in the following sense: if τ0=τ(T0) and τ1,τ2 are vocabularies with τ0=τ1∩τ2 and Tl∈T<κ for l=1,2 are theories with τ(Tl)=τl and T0=T1∩T2, then T1∪T2 is consistent in L(Qℵ0cf).
4. 4.
Finally, let T<κec be the class of all theories T∈T<κc which are existentially closed in the following sense: for any vocabulary τ1⊇τ(T), for any L(Qℵ0cf)-sentence ψ(R,S), where R⊆τ(T) and S⊆τ1∖τ(T) are tuples of predicates without repetitions, if T∪{ψ(R,S)} is consistent, then ψ(R,S′)∈T for some tuple of predicates S′⊆τ(T) such that S≈S′.
Existentially closed theories are a parallel of existentially closed models. We do not mean, of course, that they are theories of existentially closed models.
Lemma 2.3
-
T<κ⊇T<κc⊇T<κab⊇T<κec.
2. 2.
Any T∈T<κ can be extended to a member of T<κc with the same vocabulary.
3. 3.
Assume τi∩τj=τ for i<j<μ, Ti∈T<κ, T∈T<κab, τ(Ti)=τi, τ(T)=τ, and T⊆Ti. Then ⋃i<μTi is consistent.
4. 4.
If κ>ℵ0 and T∈T<κ, then it can be extended to a member of T<κec.
5. 5.
For l=c,ab,ec: if f is an isomorphism from τ1 onto τ2, and T∈T<κl, then f(T)∈T<κl.
Proof: 1. We check that T<κec⊆T<κab. Let T0∈T<κec be of vocabulary τ0, let τ1,τ2 be vocabularies such that τ0=τ1∩τ2 and let Tl∈T<κc for l=1,2 be corresponding theories with τ(Tl)=τl and T0=T1∩T2. Toward a contradiction, assume ψ(R,S)∈T1, R⊆τ0, S⊆τ1∖τ0 have no repetitions and {ψ(R,S)}∪T2 is inconsistent. Since {ψ(R,S)}∪T0 is consistent and T0∈T<κec, for some tuple of predicates S′≈S we have ψ(R,S′)∈T0 and hence {ψ(R,S′)}∪T2 is consistent. Since the predicates of S do not belong to τ2, we may rename again the formula, showing the consistency of {ψ(R,S)}∪T2, which is against our assumption.
2. By compactness of the logic L(Qℵ0cf).
3. The amalgamation of finitely many theories with common intersection in T<κab can be proved by induction. The general case follows by compactness.
4. Fix a countable vocabulary τ∞ disjoint of τ(T) and containing for each natural number n≥1 infinitely many n-ary predicates. Let T0=T and τ0=τ(T). We claim that for some vocabulary τ1⊇τ0 of cardinality ∣τ0∣+ℵ0 and disjoint of τ∞, there is some complete L(Qℵ0cf)(τ1)-theory T1⊇T0 such that for every L(Qℵ0cf)-sentence ψ(R,S), if T1∪{ψ(R,S)} is consistent and R⊆τ0 and S⊆τ∞, then there is a tuple of predicates S′⊆τ1 such that S′≈S and ψ(R,S′)∈T1. For this purpose, let μ=∣τ0∣+ℵ0 and let us enumerate (σi:i<μ) all L(Qℵ0cf)(τ0∪τ∞)-sentences. We inductively define a continuous ascending chain (Σi:i<μ) of sets of L(Qℵ0cf)-sentences. Start with Σ0=T0. If σi=ψ(R,S) (with R⊆τ0 and S⊆τ∞) is consistent with Σi, take a new tuple S′≈S of predicates and put Σi+1=Σi∪{ψ(R,S′)}. Otherwise, Σi+1=Σi. In the limit case take the union. Then let τ1 be the vocabulary of ⋃i<μΣi and let T1 be a complete L(Qℵ0cf)(τ1)-theory extending ⋃i<μΣi.
Iterating, we define Ti+1 for i<ω as a complete extension of Ti in a vocabulary τi+1⊇τi=τ(Ti) of cardinality ∣τi+1∣=∣τi∣+ℵ0 which is disjoint with τ∞. We require that for every L(Qℵ0cf)(τi∪τ∞)-sentence ψ(R,S), if Ti+1∪{ψ(R,S)} is consistent and R⊆τi and S⊆τ∞, then there is a tuple of predicates S′⊆τi+1 such that S′≈S and ψ(R,S′)∈Ti+1. Then T′=⋃i<ωTi has the required properties: T′∈T<kec extends T. In fact, its vocabulary τ′=⋃i<ωτi verifies ∣τ′∣=∣τ(T)∣+ℵ0<κ. Moreover, if T′∪{ψ(R,S)} is consistent, R⊆τ′ and S∩τ′=∅, we may assume that S⊆τ∞ and we may fix i<ω such that R⊆τi. Hence ψ(R,S′)∈Ti+1⊆T′ for some S′≈S.
5. Obvious.
□
Lemma 2.4
-
Assume l=c,ab or ec and Ti∈T<κl for every i<δ. If Ti⊆Tj for all i<j<δ and ⋃i<δTi has vocabulary τδ with ∣τδ∣<κ (in particular, if cf(δ)<cf(κ)), then ⋃i<δTi∈T<κl.
2. 2.
Assume l=c,ab or ec, T0⊆T2∈T<κl, μ<κ and ∣T0∣≤μ. Then T0⊆T1⊆T2 for some T1∈T<μ+l.
3. 3.
If ℵ0<κ1<κ2 and ∣τ(T)∣<κ1, then for l=c,ab or ec: T∈T<κ1l if and only if T∈T<κ2l.
4. 4.
Let ∣τ(T)∣<κ. Then for l=c,ab or ec: T∈T<κl if and only if for some club E⊆[τ(T)]≤ℵ0, for every τ∈E, T∩L(Qℵ0cf)(τ)∈T<ℵ1l.
Proof: 1. Clear, using compactness of L(Qℵ0cf).
2. This is obvious for complete theories (case l=c). Let us consider existentially closed theories (case l=ec). Fix, as above, a countable vocabulary τ∞ disjoint of τ(T2) and containing for each n≥1 infinitely many n-ary predicates. Let (σi:i<μ) be an enumeration of all L(Qℵ0cf)(τ(T0)∪τ∞)-sentences σi=ψ(R,S) consistent with T0 with R⊆τ(T0) and S⊆τ∞. We inductively define a corresponding sequence (σi′:i<μ) of sentences σi′∈T2. If σi=ψ(R,S) is consistent with T2, we use the fact that T2∈T<κec to find some tuple S′⊆τ(T2) such that S′≈S and ψ(R,S′)∈T2, and we put σi′=ψ(R,S′). If σi is not consistent with T2 we choose as σi′ some sentence in T2 inconsistent with σi. Let τ0 be the vocabulary of {σi′:i<μ} and let Σ0=T2↾τ0. Notice that T0⊆Σ0. Notice that every L(Qℵ0cf)-sentence ψ(R,S) with R⊆τ(T0) and S⊆τ∞ which is consistent with Σ0 is also consistent with T2, and therefore there is some S′⊆τ0 such that S′≈S and ψ(R,S′)∈Σ0. Now we iterate this construction ω times, obtaining an ascending chain of vocabularies (τi:i<ω) with τ(T0)⊆τ0, τi⊆τ(T2) and ∣τi∣=μ together with corresponding theories Σi=T2↾τi such that for every L(Qℵ0cf)-sentence ψ(R,S) consistent with Σi+1 and with R⊆τi and S⊆τ∞, there is some S′⊆τi+1 such that S′≈S and ψ(R,S′)∈Σi+1. Then T1=⋃i<ωΣi satisfies the requirements.
The case of an amalgamation base (l=ab) is similar. We extend T0 to T1∈T<μ+c such that T1⊆T2 and every sentence ψ(R,S) consistent with T1 with R⊆τ(T1) and S⊆τ∞ is consistent with T2, and then one easily checks that T1∈T<μ+ab.
3 is clear and 4 follows from 1 and 2.
□
Lemma 2.5
Let T0,T1,T2∈T<κec and assume T0⊆T1 and the embedding f:τ(T0)→τ(T2) maps T0 into T2. Then there is some T3∈T<κec such that T2⊆T3 and there is some embedding g:τ(T1)→τ(T3) extending f and mapping T1 into T3.
Proof: Extend f to an embedding g with domain τ(T1) and such that g(τ(T1))∩τ(T2)=f(τ(T0)), define T0′ and T1′ as the images of T0 and T1 by g respectively, and apply items 5 and 1 of Lemma 2.3 to T0 to show that T0′∈T<κab. Now, obviously, T0′⊆T1′∈T<κ, T0′⊆T2∈T<κ and hence, by definition of T0′∈T<κab,
T1′∪T2 is consistent. By item 4 of Lemma 2.3, it can be extended to some T3∈T<κec. Clearly, g maps T1 into T3.
□
Definition 2.6
Assume T∗∈T<κ, T∈T<κ+ec, and T∗⊆T. We call the theory T κ-universal over T∗ if for every T′∈T<κ+ec such that T∗⊆T′, there is some embedding f:τ(T′)→τ(T) over τ∗=τ(T∗) mapping T′ into T.
Theorem 2.7
Assume T∗∈T<κab, i.e., it is an amalgamation base. If κ=2<κ>ℵ0, then there exists some κ-universal theory T∈T<κ+ec over T∗.
Proof: Case 1. κ is regular.
Let τ∞ be some vocabulary such that τ∗⊆τ∞, ∣τ∞∣=κ and for every n≥1, τ∞ has κ many n-ary predicates. Let (Si:i<κ) be a enumeration of all theories in T<κec whose vocabulary is a subset of τ∞.
Notice that every theory in T<κec is a renaming of some Si.
We are going to construct a continuous ascending chain of L(Qℵ0cf)-theories (Ti:i<κ) extending T∗ such that for every i<κ:
-
Ti∈T<κ+ec
2. 2.
If j,l<i, Sj⊆Sl and f is an embedding of :τ(Sj) into τ(Ti) mapping Sj into Ti, then f can be extended to an embedding g:τ(Sl)→τ(Ti+1) mapping Sl into Ti+1.
We start by choosing some arbitrary initial theory T0∈T<κec with T∗⊆T0 and τ0=τ(T0)⊆τ∞. By Lemma 2.4, we may take unions at limit stages. Now we show how to obtain Ti+1. Let us consider a particular case of j,l<i, such that Sj⊆Sl and f:τ(Sj)→τ(Ti), an embedding mapping Sj into Ti. By Lemma 2.5, there is some Tj,l,f∈T<κ+ec extending Ti and some embedding g:τ(Sl)→τ(Tj,l,f) that maps Sl into Tj,l,f and extends f. The number of the possible triples (j,l,f) is ≤κ and hence, by iteration and taking unions at limits, we obtain Ti+1∈T<κ+ec as desired.
Now let T=⋃i<κTi. By Lemma 2.4, T∈T<κ+ec.
Claim 1. If S,S′∈T<κec, S⊆S′ and f:τ(S)→τ(T) is an embedding mapping S into T, then there is an embedding f′:τ(S′)→τ(T) extending f that maps S′ into T.
Proof of Claim 1. Since for some l<κ there is some isomorphism between τ(Sl) and τ(S′) mapping Sl onto S′, we may assume that S′=Sl and S=Sj for some j,l<κ. Now choose i<κ such that i>j,l and the range of f is contained in τ(Ti) and notice that f maps Sj into Ti. By construction of Ti+1, there is some extension f′:τ(Sl)→τ(Ti+1) of f mapping Sl into Ti+1 and hence into T. This proves the claim.
We show now that T is κ-universal over T∗. Let T′∈T<κ+ec be such that T∗⊆T′ and decompose it (using Lemma 2.4) as T′=⋃i<κTi′ where (Ti′:i<κ) is a continuous ascending chain of theories Ti′∈T<κec. Since T∗∈T<κab, we may assume that T0⊆T′, and hence, without loss of generality, T0′=T0. We claim that there is a continuous ascending chain (fi:i<κ) of embeddings fi:τ(Ti′)→τ(T) over τ∗ mapping Ti′ into T. Notice that in this case f=⋃i<κfi will be an embedding of τ(T′) into τ(T) over τ∗ mapping T′ into T. We start taking f0 as the identity in τ(T0′) and we take unions at limit stages. If fi:τ(Ti′)→τ(T) has been obtained, then by Claim 1 we can extend fi to fi+1 mapping Ti+1′ into T.
Case 2. κ is singular.
By König’s Theorem on cofinality, κ is a strong limit. Let θ=cf(κ) and choose (κi:i<θ), an increasing sequence of cardinal numbers which is cofinal in κ and such that ∣τ∗∣<κ0+ and 2κi≤κi+1 for all i<θ. For each i<θ let τi,∞ be some vocabulary such that τ∗⊆τi,∞, ∣τi,∞∣=κi and for every n≥1, τi,∞ has κi many n-ary predicates. Let (Si,j:j<2κi) be a enumeration of all theories in T<κi+ec whose vocabulary is a subset of τi,∞.
Every theory in T<κi+ec is a renaming of some Si,j.
We inductively construct a continuous ascending chain of L(Qℵ0cf)-theories (Ti:i<θ) such that for every i<θ:
-
Ti∈T<κi+ec
2. 2.
If j,l<2κi, Si,j⊆Si,l, and f:τ(Si,j)→τ(Ti) is an embedding mapping Si,j into Ti, then f can be extended to an embedding g:τ(Si,l)→τ(Ti+1) mapping Si,l into Ti+1.
We choose T0∈T<κ0+ec arbitrary with T∗⊆T0 and τ0=τ(T0)⊆τ0,∞ and we take unions at limit stages. This is possible by Lemma 2.4, since for any limit ordinal δ<θ, ∣⋃i<δτ(Ti)∣≤κδ. In order to obtain Ti+1, we consider a particular case of j,l<2κi such that Si,j⊆Si,l and there is some embedding f:τ(Si,j)→τ(Ti) mapping Si,j into Ti. By Lemma 2.5, there is some Tj,l,f∈T<κec extending Ti and some embedding g:τ(Si,l)→τ(Tj,l,f) that extends f and maps Si,l into Tj,l,f. By Lemma 2.4 we may find such Tj,l,f with the additional property that ∣τ(Tj,l,f)∣<κi+. Note that the number of possible embeddings f from τ(Si,j) into τ(Ti) is ≤κiκi≤κi+1 and therefore the number of triples (j,l,f) is ≤κi+1. We may assume that τ(Tj,l,f)∩τ(Tj′,l′,f′)=τ(Ti) whenever (j,l,f)=(j′,l′,f′). By item 3 of Lemma 2.3, we see that the union of all Tj,l,f is consistent. Since it has cardinality ≤κi+1, by item 4 of Lemma 2.3 this union can be extended to Ti+1∈T<κi+1+ec as required.
Now let T=⋃i<θTi. It is clear that T∈T<κ+ec.
Claim 2. If S,S′∈T<κiec, S⊆S′ and f:τ(S)→τ(Ti) is an embedding mapping S into Ti, then there is an embedding f′:τ(S′)→τ(Ti+1) extending f that maps S′ into Ti+1.
Proof of Claim 2. Like in the proof of Claim 1, we may assume that S′=Si,l and S=Si,j for some j,l<2κi.
We finally check that also in this case T is κ-universal over T∗. Let T′∈T<κ+ec and decompose it (using Lemma 2.4) as T′=⋃i<θTi′ where (Ti′:i<θ) is a continuous ascending chain of theories Ti′∈T<κi+ec. As before, we may assume that T0⊆T′ and hence that T0′=T0. We claim that there is a continuous ascending chain (fi:i<θ) of embeddings fi:τ(Ti′)→τ(Ti+1) over τ0 mapping Ti′ into Ti+1. Notice that in this case f=⋃i<θfi will be an embedding of τ(T′) into τ(T) over τ∗ mapping T′ into T. We start by taking f0 as the identity in τ0 and we take unions at limit stages. If fi:τ(Ti′)→τ(Ti+1) has been obtained, we use Claim 2 (applied to i+1) to extend fi to fi+1 mapping Ti+1′ into Ti+2.
□
The proof of Theorem 2.7 and the preceeding lemmas use only a few properties of the logic L(Qℵ0cf). The reader can easily check that, besides compactness and the possibility of building negations and conjunctions of sentences, we only need to rename symbols and to give small upper bounds to the number of sentences in given vocabularies. We are only interested here in applications of the logic L(Qℵ0cf), but it may be convenient to state the main results of this section in the more general setting of abstract model theory. This is done in the next observation, whose proof is left to the reader.
Remark 2.8
Let L be a compact logic, in the sense of abstract model theory. Assume L admits renaming, is closed under boolean operators, in every sentence only finitely many symbols occur, and in every finite vocabulary there are only countably many (or ≤θ) sentences. Define the classes T<κl and the notion of κ-universal theory in an analogous way for L. If T∗∈T<κab and κ=2<κ>ℵ0 (or >θ), then there exists some κ-universal theory T∈T<κ+ec over T∗. And similarly the other claims of this section.
3 Compact expandability
The following definition and the facts stated subsequently are given for models of countable vocabularies. This is only for simplification purposes, everything can be formulated with full generality with a few modifications.
Definition 3.1
Let M be a model of countable vocabulary τ and of cardinality κ.
-
M* is expandable if for every vocabulary τ′⊇τ of cardinality ≤κ, if Σ is a first-order set of sentences of vocabulary τ′ consistent with the first-order theory Th(M) of M, then there is some expansion M′ of M to τ′ such that M′⊨Σ.*
2. 2.
Call a set of first-order sentences Σ of vocabulary τ′⊇τ finitely satisfiable in M if for every finite subset Σ0⊆Σ there is an expansion of M that satisfies Σ0.
3. 3.
M* is compactly expandable if for every vocabulary τ′⊇τ of cardinality ≤κ, if Σ is a first-order set of sentences of vocabulary τ′ finitely satisfiable in M, then there is some expansion M′ of M to τ′ such that M′⊨Σ.*
The motivation for studying compactly expandable models came originally from the interest in restricted forms of the compactness theorem for logics with standard part. These logics were considered by M. Morley in [Mor73] as generalizations of ω-logic. In ω-logic some notions concerning the natural numbers remain fixed, in M-logic the structure M replaces the structure of natural numbers. If M is a model of cardinality κ, for trivial reasons the M-logic does not satisfy the compactness theorem for sets of sentences of cardinality larger than κ. One can prove that the model M is compactly expandable if and only if M-logic is κ-compact, that is, if it satisfies the compactness theorem for sets of sentences of cardinality at most κ. For more on this see [Cas95] and [Cas98].
For a proof of the following list of facts, see [Cas95].
Facts 3.2
-
Saturated and special models are expandable.
2. 2.
Expandable models are compactly expandable.
3. 3.
Compactly expandable models are ω-saturated and universal.
4. 4.
The countable compactly expandable models are the countable saturated models.
5. 5.
If T is superstable and does not have the finite cover property, then every compactly expandable model of T of cardinality ≥2ℵ0 is saturated.
6. 6.
If T is ℵ0-stable and does not have the finite cover property, then every compactly expandable model of T is saturated.
7. 7.
If T is superstable and has the finite cover property, T has compactly expandable models which are not saturated.
8. 8.
Every unsuperstable theory having a saturated model of cardinality κ>ℵ0, has a compactly expandable model of cardinality κ which is not saturated.
The methods used in [Cas95] to obtain compactly expandable models which are not saturated nor special are based on ultrapowers and chains of ultrapowers. They always provide expandable models. In [Cas98] several examples of theories are discussed where every compactly expandable model is expandable. The question of whether in some theory there exists a compactly expandable model which is not expandable was asked in [Cas95] in general and also particularly for the theory of linear dense orders without endpoints. We will give now an affirmative answer.
We are going to apply the results of the previous section to the particular case of the vocabulary τ<={<} and to some complete L(Qℵ0cf)-theory T< in this vocabulary. We only require from T< to extend the first-order theory DLO of the dense linear order without endpoints and to contain the L(Qℵ0cf)-sentences expressing that < has cofinality ℵ0 while > has cofinality larger than ℵ0 and for every point a, both ({b:b<a},<) and ({b:b>a},>) have cofinality larger than ℵ0. More precisely:
Definition 3.3
Let τ<={<} and let
T< be the L(Qℵ0cf)(τ<)-theory with the following axioms:
-
∀xyz(x<y∧y<z→x<z)∧∀x(¬x<x)∧∀xy(x<y∨y<x∨x=y)**
2. 2.
∀xy(x<y→∃z(x<z∧z<y))∧∀x∃yz(y<x∧x<z)**
3. 3.
Qℵ0cfxy(x<y)∧¬Qℵ0cfyx(x<y)**
4. 4.
∀x(¬Qℵ0cfzy(x<y∧y<z)∧¬Qℵ0cfyz(y<z∧z<x))**
Remark 3.4
T<* is consistent and complete.*
Proof: Let (A,<A) be an ℵ1-saturated dense linear ordering without endpoints and consider the lexicographic order of the product (ω,<)×(A,<A). All the axioms hold in this ordering. For completeness, use the quantifier elimination of the first-order theory of linear dense orders without endpoints.
□
Remark 3.5
There is a countable T∗⊇T< with vocabulary τ∗=τ(T∗)⊇τ< such that T∗∈T<ℵ1ec; in particular, T∗ is an amalgamation base.
Proof: T<∈T<ℵ1, and by items 4 and 1 of Lemma 2.3, it can be extended to some T∗∈T<ℵ1ec⊆T<ℵ1ab.
□
Proposition 3.6
Let κ=2<κ>ℵ0 (for instance κ=ℶω) and let T∈T<κ+ec be κ-universal over the theory T∗ from Remark 3.5 (and hence extend T∗⊇T<). Then:
-
T* has a model of cardinality κ.*
2. 2.
If M is a model of T of cardinality κ and M<=M↾{<}, then
- (a)
M<* is compactly expandable, and*
2. (b)
M<* is not expandable.*
Proof: 1. Because L(Qℵ0cf) satisfies the Löwenheim-Skolem theorem down to any uncountable cardinal.
2 (a). Let T′ be a first-order theory in a vocabulary τ′ containing the symbol < and such that ∣τ′∣≤κ, and assume that T′ is finitely satisfiable in M<. We can assume that τ∗∩τ(T′)={<} and then T∗∪T′ is finitely satisfiable in M< and can be extended to some T′′∈T<κ+ec. Since T is κ-universal over T∗, there is some embedding f:τ(T′′)→τ(T) over τ<={<} (and even over τ∗) mapping T′′ into T. Since M⊨T, T′′ holds in an expansion of M and therefore in an expansion of M<.
2 (b). Notice that the first-order theory of M< is DLO, the theory of dense linear orders without endpoints. There are models of DLO, hence elementarily equivalent to M<, where every open interval is isomorphic to the whole model, e.g., the ordering of the real numbers. Borrowing terminology from permutation group theory, they are sometimes called doubly transitive linear orders. This property can be expressed adding a new predicate to the language, that is, there is a finite vocabulary τ′ containing < and some first-order theory T′ of vocabulary τ′ which is consistent with DLO and in every model of T′ every open interval is order isomorphic to the whole model. Since M< has cofinality ℵ0 and all open intervals have cofinality >ℵ0, it is not doubly transitive and, hence, no expansion of M< satisfies T′.
□
Corollary 3.7
There are compactly expandable linear dense orderings without endpoints which are not expandable.
Proof: By Proposition 3.6.
□
Remark 3.8
In the proof of Proposition 3.6 we can use a DLO isomorphic to its inverse. There are different choices for the theory T< of Definition 3.3. We can specify the cofinality of the reverse order > to be ℵ0. In fact, we can even not require density of the order.