• Keine Ergebnisse gefunden

Classical and Non-Classical Model Theory Martin Otto Kord Eickmeyer Summer 2013 Exercises No.2

N/A
N/A
Protected

Academic year: 2022

Aktie "Classical and Non-Classical Model Theory Martin Otto Kord Eickmeyer Summer 2013 Exercises No.2"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Classical and Non-Classical Model Theory Martin Otto Kord Eickmeyer Summer 2013 Exercises No.2

Exercise 1 [warm-up]

LetI be an index set and (Ai)i∈I a family of structures.

(i) Let Uj := {s ⊆ I: j ∈ s} be the principal ultrafilter generated by {j}. Then Q

iAi

Uj ∼=Aj.

(ii) For nonempty s0 ⊆I, let Fs0 :={s ⊆I: s0 ⊆ s} be the principal filter generated bys0. Then Q

iAi

Fs0 ∼=Q

i∈s0Ai. (iii) For the trivial filterF :={I} we have Q

iAi

F ∼=Q

iAi. Exercise 2 [elementary embedding into ultrapowers]

Forσ-structure A and an ultrafilterU onI, let ι:A→AI

U be the function ι: A −→ AI

U a 7−→ [aI]

where aI := (a)i∈I is the family with constant entry a. Show that ι is an elementary embedding of Ainto AI

U. In particular, A≡AI U. Exercise 3 [4-criterion, Lemma 2.7]

Show that the following are equivalent for any subset A⊆B of a σ-structure B:

(i) A:=BA is a σ-structure s.t. A4B.

(ii) for every ϕ(x, x)∈FO(σ) and a over A:

ex. b∈B s.t. B|=ϕ[a, b]

⇒ ex. a∈A s.t.B|=ϕ[a, a].

Exercise 4 [countable algebraically closed field of characteristic zero]

Show the existence of countable, algebraically closed (respectively real closed) fields of characteristic zero. These cam be obtained as limits of suitable chains of substructures of suitable larger fields.

Suggested Homework Exercises

Exercise 5 [Lemma 2.5]

Prove the following assertions about the algebraic diagram Dalg(A) and the elementary diagram Del(A) of a σ-structure A.

(a) T.f.a.e. for any σ-structure B:

(i) there is an isomorphic embedding of A intoB (ii) B=BAσ for some BA |= Dalg(A).

(b) T.f.a.e. for any σ-structure B:

(i) there is an elementary embedding of Ainto B (ii) B=BAσ for some BA |= Del(A).

(2)

Exercise 6 [preservation of ∀-FO under substructures]

Show by syntactic induction on ϕ(x) ∈ ∀-FO(σ) that universal FO-formulae are pre- served under substructures, i.e., that for allA⊆B and alla inA:

B|=ϕ[a] ⇒ A|=ϕ[a].

Give examples of common model classes that are closed under substructures and consider whether they admit an axiomatisation in ∀-FO(σ) (note that this may depend on the choice of signatures; why?).

Exercise 7 [saturation property of countable ultrapowers]

Letσ be an at most countable signature, A a σ-structure, and Φ(x) ⊆FO1(σ) a set of formulae such that

A|=∃x ^ Φ0

for all finite Φ0 ⊆ Φ. Then for all non-principal ultrafilters U on N there is some (ai)i∈N∈AN such that

AN

U,[(ai)i∈N]|= Φ.

What kind of density property does this imply for a countable ultrapower of (Q, <)?

Note how the construction of ultrapowers is compatible with expansions/reducts.

Referenzen

ÄHNLICHE DOKUMENTE

If R is a real closed field with natural valuation v, value group G , and residue field k, then R is recursively saturated in the language of ordered rings if and only if there is

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

Classical and Non-Classical Model Theory Martin Otto Kord Eickmeyer Summer 2013 Exercises No.3.. Exercise 1

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

(b) Investigate the completions and the type spaces of the (incomplete) theory of one equivalence relation ∼ (to be continued in Exercise 5 below).. Suggested

Show that T cannot have any atomic models, but that all models of T are ω-homogeneous (and even

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

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,