• Keine Ergebnisse gefunden

Los Theorem

N/A
N/A
Protected

Academic year: 2022

Aktie " Los Theorem"

Copied!
4
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Los Theorem

Let A := Q

i Ai

U be an ultraproduct of a family Ai

i∈I of σ-structures Ai w.r.t. an ultrafilter U on I. Then, for any ϕ(x) = ϕ(x1, . . . ,xn) ∈ FOn(σ),

and for any a = (a1, . . . ,an) ∈ (Q

i Ai)n:

A | = ϕ

([ a

1

], . . . , [ a

n

])

iff [[ϕ(a)]] ∈ U

NB: [[ϕ(a)]] =

i ∈ I: Ai |= ϕ[a(i)] serves as a set-valued semantic valuation over Q

i Ai and

“truth in Q

i Ai

U is truth in U-many components”

Model Theory Summer 13 M Otto 11/20

compactness via ultra-products

idea: for given Φ ⊆ FO0(σ), find I and ultrafilter U on I together with map s: Φ −→ U

ϕ 7−→ sϕ such that, f.a. i ∈ I, the subset Φi := {ϕ ∈ Φ : i ∈ sϕ} ⊆ Φ is finite then, for a family of models Ai |= Φi, for i ∈ I:

( Los) Q

i Ai

U |= ϕ iff [[ϕ]] ∈ U, and Q

i Ai

U |= ϕ for every ϕ ∈ Φ, since [[ϕ]] ⊇ sϕ ∈ U

. . . and suitable I and U can be found (NB: multiple uses of AC)

Model Theory Summer 13 M Otto 12/20

(2)

compactness via ultra-products: the countable case

for countable Φ = {ϕn: n ∈ N} ⊆ FO0(σ),

can use any non-principal ultrafilter U on N

as U extends the Frechet filter (!), can use Φi := {ϕn: n 6 i} and Ai |= Φi for all i ∈ N guarantees that QAi

U |= Φ:

[[ϕn]] ⊇ {i ∈ N: i > n} ∈ U

corollary: a saturation property

for σ-structures A in at most countable σ and Φ(x) = {ϕn(x) : n ∈ N} ⊆ FO1(σ) such that A |= ∃x V

n6i ϕ for all i:

there is some a ∈ AN such that AN/U,[a] |= Φ

Model Theory Summer 13 M Otto 13/20

compactness via ultraproducts: the general case

for Φ ⊆ FO0(σ) of cardinality κ, Φ = {ϕα: α ∈ κ},

use I := Pfin(κ) = {i ∈ P(κ) : i finite } together with s: α 7−→ sα := {i ∈ I : α ∈ i}, and ultrafilter U on I with U ⊇ B

where B := {sα: α ∈ κ} has f.i.p.

• if every finite Φ0 ⊆ Φ is satisfiable, then Φi := {ϕα: α ∈ i} is satisfiable for all i ∈ I

• if Ai |= Φi for all i ∈ I, then QAi

U |= Φ

Model Theory Summer 13 M Otto 14/20

(3)

I.2 Elementary maps and chains

review: relationships between σ-structures

isomorphy & isomorphisms: π: A ≃ B (or π: A,a ≃ B,b) substructure/extension relationship: A ⊆ B

isomorphic embeddings: π: A ≃ A ⊆ B elementary embeddings π: A −→el B:

π: A → B such that f.a. a ∈ An: A,a ≡ B, π(a) cf. weaker notion of isomorphic embeddings

elementary substructure/extension relationship A 4 B: A ⊆ B (and A ⊆ B) with elementary inclusion map ι: A → B

Model Theory Summer 13 M Otto 15/20

related notions for partial maps

partial isomorphisms π ∈ Part(A,B):

π: dom(π) ⊆ A −→ image(π) ⊆ B such that f.a. a ∈ dom(π)n and all atomic α ∈ FOn(σ): A,a |= ϕ ⇔ B, π(a) |= ϕ

partial elementary maps:

π ∈ Part(A,B) such that f.a. a ∈ dom(π)n: A,a ≡ B, π(a)

partial isomorphisms and partial elementary maps arise as approximations, and in back&forth arguments

(cf. Ehrenfeucht–Fra¨ıss´e techniques)

Model Theory Summer 13 M Otto 16/20

(4)

extensions & elementary extensions

for σ-structure A put σA := σ∪ {˙ ca: a ∈ A}, and let AA be the natural σA expansion of A algebraic (or quantifier-free) diagram:

Dalg(A) := {ϕ(ca) : A |= ϕ[a], ϕ ∈ FO(σ) qfr-free } elementary diagram:

D(A) = Del(A) := {ϕ(ca) : A |= ϕ[a], ϕ ∈ FO(σ) }

≡ Th(AA) up to isomorphism,

• the extensions of A are the σ-reducts of models of Dalg(A)

• the elementary extensions of A are the σ-reducts of models of Del(A)

Model Theory Summer 13 M Otto 17/20

application: a first ‘preservation theorem’

theorem (Tarski)

t.f.a.e. for ϕ(x) ∈ FO(σ):

(i) ϕ is preserved under substructures

(ii) ϕ ≡ ϕ ∈ ∀-FO(σ) (the universal fragment of FO)

NB: (ii) ⇒ (i) is easy by syntactic induction on ϕ ∈ ∀-FO(σ) (i) ⇒ (ii) is a non-trivial expressive completeness result

Model Theory Summer 13 M Otto 18/20

Referenzen

ÄHNLICHE DOKUMENTE

Which steps in the inductive treatment of the usual connectives and quantifiers of FO go through for arbitrary filters (not necessarily ultrafilters).. Provide proofs or

Remark: an FMT version of the Lyndon–Tarski correspondence between preservation under homomorphisms and positive existential definability obtains in restriction to wide classes

Classical and Non-Classical Model Theory Martin Otto Kord Eickmeyer Summer 2013 Exercises No.11?. Exercise 1 [warmup: expressive power

Hint for (b): show that player II can win the m-round 2-pebble game played on a sufficiently long linear ordering versus its variant with a single <-edge in a suitable

Classical and Non-Classical Model Theory Martin Otto Kord Eickmeyer Summer 2013 Exercises No.13. Exercise 1 [warm-up:

Try to think of counter-examples for some of the classical results seen so far if we read them in the sense of finite model theory (fmt), where logical equivalence,

For this exercise consider graph-like structures with a finite relational vocabulary σ consisting of binary and unary relation symbols (think of edge- and vertex-coloured

Show that FO has a 0–1 law over the class of finite tournaments, and that the almost sure theory of tournaments is the ω-categorical theory of the Fra¨ıss´ e limit of the class