Set theory and model theory: a symbiosis Jouko Vnnen Helsinki, - - PowerPoint PPT Presentation

Symbiosis Reflection LST Sort logic

Set theory and model theory: a symbiosis

Jouko Väänänen

Helsinki, Finland

Montseny, November 2018

1 / 53

Symbiosis Reflection LST Sort logic

Model theory

Model theory (in this talk) is the study of classes of models, closed under isomorphisms, on the basis of the formal languages used to define the classes.

2 / 53

Symbiosis Reflection LST Sort logic

The basic equivalence

• A model M satisfies the sentence ϕ of a logic L∗ iff a

certain formula Φ(x) of set theory is true for x = M.

• M |

= ϕ ⇐ ⇒ Φ(M)

3 / 53

Symbiosis Reflection LST Sort logic

The basic equivalence, spelled out

• M |

= ϕ if an only if there is a model N of set theory such that M, ϕ ∈ N, in N the first order sentence “M | = ϕ” is true, and N satisfies some absoluteness criteria.

• Φ(M) if and only if there is a binary predicate E on the

universe of M, augmented perhaps with some new sorts, such that E satisfies some set theory, some absoluteness criteria, and in the sense of E the set-theoretical formula Φ(x) is satisfied by an element x = m of the universe such that the structure that E thinks m is, is isomorphic to M.

4 / 53

Symbiosis Reflection LST Sort logic 5 / 53

Symbiosis Reflection LST Sort logic

An early example: simple theory of types

• x, y, z, . . . for individuals.
• X, Y, Z, . . . for sets.
• X, Y, Z, . . . for sets of sets.
• Etc...
• First order logic: x = y, R(x1, . . . , xn)
• Second order logic: X(y)
• Third order logic: X(y), X(Y)
• Etc...

6 / 53

Symbiosis Reflection LST Sort logic

Gödel "On the present situation in the foundations of mathematics" (*1933o):1 "...but it turns out that this system [set theory] is nothing else but a natural generalization of the theory

• f types, or rather, it is what becomes of the theory of

types if certain superfluous restrictions are removed." (Hodges, "Tarski’s Theory of Definition", New Essays on Tarski and Philosophy, 2008, D. Patterson, ed.) "The deductive theories in question (such as RCF) are formulated in simple type theory; by 1935 the axioms for RCF is regarded as a definition within set theory."

1Unpublished manuscript. 7 / 53

Symbiosis Reflection LST Sort logic

Model theory Set theory Sort logic First order logic Second order logic ∆2 in Levy hierarchy First order logic with ∆1 in Levy hierarchy the game quantifier Infinitary logic LHYP ∆KP

1

in Levy hierarchy First order logic ∆KPU−

1

in Levy hierarchy M | = ϕ ⇐ ⇒ Φ(M)

8 / 53

Symbiosis Reflection LST Sort logic

• First order logic Lωω,
• Infinitary logics Lκλ,
• Logic with the generalized quantifier Lωω(Qα),
• Härtig-quantifier logic Lωω(I).
• Second order logic L2.
• Cofinality logic Lωω(Q cf

ω ).

• Stationary logic Lωω(aa).

9 / 53

Symbiosis Reflection LST Sort logic

The map of logics

10 / 53

Symbiosis Reflection LST Sort logic

Two key auxiliary concepts

Definition (V. 78)

Suppose R is a finite set of predicates of set theory and L∗ is a logic.

• 1. ∆1(R) means ∆1 in the extended language {∈, R}.
• 2. ∆(L∗) is the logic the definable model classes of which are

such K that both K and −K are reducts of L∗-definable model classes.

11 / 53

Symbiosis Reflection LST Sort logic

Symbiosis

Definition

A (finite set of) n-ary predicates R and a logic L∗ are symbiotic if the following conditions are satisfied:

• 1. Every L∗-definable model class is ∆1(R)-definable.
• 2. Every2 ∆1(R)-definable model class is ∆(L∗)-definable.

2It is enough that a particular ∆1(R)-definable model class i.e. a

particular generalized quantifier, derived from R, is ∆(L∗)-definable.

12 / 53

Symbiosis Reflection LST Sort logic

The following pairs (R, L∗) are symbiotic. 1.

R: Cd, i.e. the predicate “x is a cardinal". L∗: Lωω(I), where Ixyϕ(x)ψ(y) ↔ |ϕ| = |ψ| is the Härtig quantifier.

2.

R: Cd L∗: Lωω(R), where Rxyϕ(x)ψ(y) ↔ |ϕ| ≤ |ψ| is the Rescher quantifier.

3.

R: Cd L∗: Lωω(W Cd), where W Cdxyϕ(x, y) ↔ ϕ(·, ·) is a well-ordering

• f the order-type of a cardinal.

4.

R: Cd, WI L∗: Lωω(I, W WI), where W WIxϕ(x) ↔ |ϕ(·)| is weakly-inaccessible.

5.

R: Rg, i.e. the predicate “x is a regular cardinal" L∗: Lωω(I, W Rg), where W Rgxyϕ(x, y) ↔ ϕ(·, ·) has the

• rder-type of a regular cardinal.

13 / 53

Symbiosis Reflection LST Sort logic

1.

R: Cd, WC L∗: Lωω(I, QBr), where QBrxyϕ(x, y) ↔ ϕ(·, ·) is a tree order of height some α and has no branch of length α.

2.

R: Cd, WC L∗: Lωω(I, ¯ QBr), where ¯ QBrxyuvϕ(x, y)ψ(u, v) ↔ ϕ(·, ·) is a partial order with a chain of order-type ψ(·, ·).

3.

R: Pw i.e. the predicate {(x, y) : y = P(x)} L∗: The second order logic L2.

14 / 53

Symbiosis Reflection LST Sort logic

Cd and Lωω(I) are symbiotic.

Theorem

TFAE:

• 1. K is ∆(Lωω(I))-definable.
• 2. K is ∆1(Cd)-definable in set theory

Note: If V = L (or Lµ), then ∆(Lωω(I)) = ∆(L2).

15 / 53

Symbiosis Reflection LST Sort logic

Question

Is there a natural canonical inner model for set theory in the vocabulary {∈, Cd}? Is there a minimal transitive class model with true cardinals?

16 / 53

Symbiosis Reflection LST Sort logic

Pw and the L2 are symbiotic.

Let Pw be the relation {(x, y) : y = P(x)}. ∆1(Pw) = ∆2.

Theorem

TFAE:

• 1. K is ∆(L2)-definable.
• 2. K is ∆2-definable in set theory

17 / 53

Symbiosis Reflection LST Sort logic

Structural reflection

Let R be a finite set of predicates or relations.

Definition (Bagaria-V. 2016)

(SR)R(κ) : If K is a Σ1(R) class of models, then for every A ∈ K, there exist B ∈ K of cardinality less than κ and an elementary embedding e : B A.

18 / 53

Symbiosis Reflection LST Sort logic

• The principle (SR)Cd implies 0♯, and much more, e.g.

failure of square at all cardinals from κ on (Magidor and V. 2011, see later).

19 / 53

Symbiosis Reflection LST Sort logic

Weaker forms of structural reflection

(SR)−−

R

: If K is a non-empty Σ1(R) class of models, then there exists A ∈ K of cardinality less than κ.

Proposition (Hanf)

ZFC ⊢ ∃κ((SR)−−

R

holds for κ). Proof: Let {Kn : n < ω} list all non-empty Σ1(R) model classes. Pick An ∈ Kn, for each n < ω. Let κ be the supremum of all the cardinalities of the An, for n < ω. Then κ+ is as required.

20 / 53

Symbiosis Reflection LST Sort logic

(SR)−

R : If K is a Σ1(R) class of models and A ∈ K has

cardinality κ, then there exists B ∈ K of cardinality less than κ and an elementary embedding e : B A.

21 / 53

Symbiosis Reflection LST Sort logic

Theorem (Stavi-V. 2002)

If (SR)−

Cd holds for κ, then there exists a weakly inaccessible

cardinal λ ≤ κ.

22 / 53

Symbiosis Reflection LST Sort logic

Let Rg be the predicate “x is a regular ordinal".

Theorem (Bagaria-V. 2016)

If κ satisfies (SR)−

Rg, then there exists a weakly Mahlo cardinal

λ ≤ κ.

23 / 53

Symbiosis Reflection LST Sort logic

• We cannot hope to get from (SR)Rg more than one weakly

Mahlo cardinal ≤ κ. Indeed, starting from a weakly Mahlo cardinal one obtains a model of set theory in which (SR)Rg holds for the least weakly Mahlo cardinal.

• We cannot hope either to obtain from (SR)Rg that κ is

strongly inaccessible, for it can be shown that one can have (SR)Rg for κ = 2ℵ0.

24 / 53

Symbiosis Reflection LST Sort logic

There is a condition between (SR)−

Cd and (SR)− Rg, namely

(SR)−

Cd,WI, where WI is the predicate “x is weakly inaccessible".

Proposition (Bagaria-V. 2016)

If κ satisfies (SR)−

Cd,WI, then there exists a 2-weakly

inaccessible cardinal λ ≤ κ.

25 / 53

Symbiosis Reflection LST Sort logic

• We may also consider predicates α-WI, for α an ordinal.

That is, the predicate “x is α-weakly inaccessible".

• Then, similar arguments would show that the principle

(SR)−

Cd, α- WI implies that there is an (α + 1)-weakly

inaccessible cardinal ≤ κ.

26 / 53

Symbiosis Reflection LST Sort logic

Let WC(x, α) be the Π1 relation “α is a limit ordinal and x is a partial ordering with no chain of order-type α".

Theorem (Bagaria-V. 2016)

If κ satisfies (SR)−

Cd,WC, then there exists a weakly compact

cardinal λ ≤ κ.

27 / 53

Symbiosis Reflection LST Sort logic

Recap

The following pairs (R, L∗) are symbiotic.

• R: Cd

L∗: Lωω(I), where Ixyϕ(x)ψ(y) ↔ |ϕ| = |ψ| is the Härtig quantifier.

• R: Cd

L∗: Lωω(R), where Rxyϕ(x)ψ(y) ↔ |ϕ| ≤ |ψ| is the Rescher quantifier.

• R: Cd

L∗: Lωω(W Cd), where W Cdxyϕ(x, y) ↔ ϕ(·, ·) is a well-ordering

• f the order-type of a cardinal.
• R: Cd, WI

L∗: Lωω(I, W WI), where W WIxϕ(x) ↔ |ϕ(·)| is weakly-inaccessible.

• R: Rg

L∗: Lωω(I, W Rg), where W Rgxyϕ(x, y) ↔ ϕ(·, ·) has the

• rder-type of a regular cardinal.

28 / 53

Symbiosis Reflection LST Sort logic

Recap

• R: Cd, WC

L∗: Lωω(I, QBr), where QBrxyϕ(x, y) ↔ ϕ(·, ·) is a tree order of height some α and has no branch of length α.

• R: Cd, WC

L∗: Lωω(I, ¯ QBr), where ¯ QBrxyuvϕ(x, y)ψ(u, v) ↔ ϕ(·, ·) is a partial order with a chain of order-type ψ(·, ·).

• R: Pw

L∗: The second order logic L2.

29 / 53

Symbiosis Reflection LST Sort logic

Structural reflection as a Downward Löwenheim Skolem Theorem

Theorem (Bagaria-V. 2016)

Suppose L∗ and R are symbiotic. Then the following are equivalent: (i) (SR)R holds for κ. (ii) LST(L∗) holds for κ i.e. for any ϕ ∈ L∗ and any A that satisfies ϕ, there exists B ⊆ A of cardinality less than κ that also satisfies ϕ. The smallest κ such that LST(L) (if any) is called the Löwenheim-Skolem-Tarski number of the logic L.

30 / 53

Symbiosis Reflection LST Sort logic

Writing ≡ to indicate that the corresponding cardinals are the same, assuming they exist, we have:

• 1. (SR)Cd ≡ LST(Lωω(I)).
• 2. (SR)Cd,WI ≡ LST(Lωω(I, W WI)).
• 3. (SR)Rg ≡ LST(Lωω(W Rg)).
• 4. (SR)Cd,WC ≡ LST(Lωω(I, QBr)).

31 / 53

Symbiosis Reflection LST Sort logic

Theorem (Magidor-V. 2011)

• 1. Relative to the consistency of a supercompact cardinal, it

is consistent that LST(Lωω(I)) holds for the first weakly inaccessible cardinal.

• 2. Relative to the consistency of a supercompact cardinal, it

is consistent that the first cardinal with LST(Lωω(I)) is the first supercompact cardinal.

• 3. If LST(Lωω(I)) holds for κ, then λ fails for all λ ≥ κ, λ,λ

fails for ω-cofinal λ ≥ κ, and SCH holds above κ.

32 / 53

Symbiosis Reflection LST Sort logic

Theorem (Magidor 1971)

The LST-number of L2, if exists, is the first supercompact cardinal.

33 / 53

Symbiosis Reflection LST Sort logic

Weaker Löwenheim-Skolem-type properties

Definition

• We say that a cardinal κ has the

Löwenheim-Skolem-property for L∗, written LS(L∗), if whenever ϕ ∈ L∗ is such that A | = ϕ for some A, then B | = ϕ for some B such that |B| < κ.

• We say that a cardinal κ has the strict Löwenheim-Skolem-

Tarski property for L∗, written SLST(L∗), if whenever A is a model and ϕ ∈ L∗ is such that A | = ϕ, and |A| = κ, then there is B ⊆ A such that B | = ϕ and |B| < κ.

34 / 53

Symbiosis Reflection LST Sort logic

Theorem (Bagaria-V. 2016)

If R and L∗ are symbiotic, then

• 1. κ has the LS(L∗) property if and only (SR)−−

R

holds for κ.

• 2. κ has the SLST(L∗) property if and only (SR)−

R holds for κ.

35 / 53

Symbiosis Reflection LST Sort logic

We now have the following:

• 1. (SR)−

Cd ≡ SLST(Lωω(I)).

• 2. (SR)−

Cd,WI ≡ SLST(Lωω(I, W WI)).

• 3. (SR)−

Rg ≡ SLST(Lωω(W Rg)).

• 4. (SR)−

Cd,WC ≡ SLST(Lωω(I, QBr)).

36 / 53

Symbiosis Reflection LST Sort logic

Theorem (A. Pinus 1978)

If κ is weakly inaccessible, then SLST(Lωω(I)) holds at κ.

Corollary

SLST(Lωω(I)) = κ if and only if κ is the first weakly inaccessible cardinal.

Theorem (Bagaria-V. 2016)

If κ is 2-weakly inaccessible, then SLST(Lωω(I, W WI)) holds at κ. SLST(Lωω(I, W WI)) = κ if and only if κ is the first 2-weakly inaccessible cardinal.

37 / 53

Symbiosis Reflection LST Sort logic

Theorem (Bagaria-V. 2016)

If κ is weakly Mahlo, then SLST(Lωω(I, W Rg)) holds for κ. SLST(Lωω(I, W Rg)) = κ if and only if κ is the first weakly Mahlo cardinal.

38 / 53

Symbiosis Reflection LST Sort logic

Theorem (Bagaria-V. 2016)

If κ is weakly compact, then SLST(Lωω(I, QBr)) holds for κ. SLST(Lωω(I, QBr)) = κ if and only if κ is the first weakly compact cardinal.

39 / 53

Symbiosis Reflection LST Sort logic

Theorem (Scott 1961)

If κ is a measurable cardinal, then SLST(L2) holds for κ.

40 / 53

Symbiosis Reflection LST Sort logic 41 / 53

Symbiosis Reflection LST Sort logic

A hierarchy of strong logics

Definition

Sort logic is the smallest extension of second order logic which is closed under taking reducts of definable model classes. Iterating taking reducts and complements gives rise to the ∆n-fragment of sort logic.

42 / 53

Symbiosis Reflection LST Sort logic

A hierarchy of strong logics

Example

• ∆1 is first order logic.
• ∆2 is essentially second order logic.
• ∆3 is essentially the extension of second order logic by the

quantifier “there are supercompactly many" (assuming there are a proper class of supercompact cardinals).

• ∆4 is essentially the extension of second order logic by the

quantifier “there are extendibly many" (assuming there are a proper class of extendible cardinals).

43 / 53

Symbiosis Reflection LST Sort logic

Theorem (V. 78)

The following conditions are equivalent for any model class K and for any n > 1: (1) K is definable in the level ∆n of sort logic. (2) K is ∆n-definable in the Levy-hierarchy.

44 / 53

Symbiosis Reflection LST Sort logic

The strongest logic

In class theory:

Corollary

Every (set-theoretically definable) model class is definable in sort logic. Sort logic is therefore the strongest logic. The logics ∆n, n = 2, 3, . . ., provide a sequence of stronger and stronger logics, covering eventually every other logic.

45 / 53

Symbiosis Reflection LST Sort logic

Model theory Set theory Sort logic First order logic Second order logic ∆2 in Levy hierarchy ∆2 in sort logic First order logic with ∆1 in Levy hierarchy the game quantifier Infinitary logic LHYP ∆KP

1

in Levy hierarchy First order logic ∆KPU−

1

in Levy hierarchy

46 / 53

Symbiosis Reflection LST Sort logic

Definition (Bagaria 2012)

Let C(n) be the club class of ordinals α such that Rα ≺n V. C(n)-supercompact, C(n)-extendible, C(n)-huge, C(n)-superhuge, etc.

47 / 53

Symbiosis Reflection LST Sort logic

Theorem (V. 1978)

• 1. The Hanf-number hn of the logic ∆n is the supremum of

Σn-definable ordinals.

• 2. The Löwenheim number3 ℓn of the logic ∆n is the

supremum of Πn-definable ordinals.

• 3. The decision problem of the logic ∆n is the complete

Πn-definable set of natural numbers.

• 4. ℓn+1 = hn for all n > 1.
• 5. ℓn < tn < hn for all n > 1, where tn = min(C(n)).

3I.e. least cardinal with the Löwenheim-Skolem property 48 / 53

Symbiosis Reflection LST Sort logic

Definition

Q(n)xϕ(x) ⇐ ⇒ |{x : ϕ(x)}| ∈ C(n).

Theorem

The following conditions are equivalent for any model class K and for any n > 1: (1) K is definable in the logic ∆(Lωω(I, Q(n))). (2) K is ∆n+1-definable in the Levy-hierarchy.

49 / 53

Symbiosis Reflection LST Sort logic

Proposition

LST(∆n+1) holds for every C(n)-supercompact cardinal.

50 / 53

Symbiosis Reflection LST Sort logic

• Model theory (in this talk) is based on logics, such as first
• rder logic, second order logic, infinitary logic, sort logic,

etc.

• Logics (however strong) treat mathematical structures up

to isomorphism only, there is no preference of one construction of a structure over another, and this is in line with common mathematical thinking about structures.

51 / 53

Symbiosis Reflection LST Sort logic

• Model theory of strong logics gives rise to interesting

reflection principles via the Löwenheim-Skolem-Tarski properties.

• Model theory of strong logics provides a natural model

theoretic scale for investigating complicated set theoretical properties of models, without going into the nuts and bolts

• f the constructions of specific structures.
• Ultimately, strong logics, and thereby also model theory,

and set theory live in a symbiosis.

52 / 53

Symbiosis Reflection LST Sort logic

Happy Birthday, Joan!

53 / 53