• Keine Ergebnisse gefunden

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

N/A
N/A
Protected

Academic year: 2022

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

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.1

Exercise 1 [filters]

Consider I 6= ∅ and B ⊆ P(I) with the finite intersection property (f.i.p.). Show the following:

(a) closure under intersection (∩) and supersets (⊇) preserves f.i.p.

(b) F(B), defined as the closure under supersets of the closure under (finite) intersec- tions of B, is a filter extendingB.

(c) if s, s6∈ B then at least one of B ∪ {s} orB ∪ {s} has f.i.p. (and hence extends to a filter).

(d) if B ⊆ P(I) is maximal with f.i.p., thenB=F(B) is an ultrafilter on I.

Use Zorn’s Lemma to show that every B ⊆ P(I) with f.i.p. can be extended to an ultrafilter U ⊇ B.

Exercise 2 [cf. Lemma 1.3]

LetF be a filter on I.

(a) Show that the relation ∼F is an equivalence relation on Q

iAi (for any family of non-empty sets (Ai)i∈I).

(b) Show that ∼F is a congruence w.r.t. any function fA in the direct product A :=

Q

iAi of a family of structures (Ai = (Ai, fAi))i∈I.

(c) Show that for a family of structures (Ai = (Ai, RAi))i∈I with relation R, and for a∼F a0 (component-wise equivalence): kRak ∈ F ⇔ kRa0k ∈ F.

Exercise 3 [cf. Los Theorem, Theorem 1.5]

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 coun- terexamples (for ∨,∀, and ¬).

Suggested Homework Exercises

Exercise 4 [reduced products preserve Horn formulae]

A Horn clause is a formula of the form

ϕ= (θ1∧. . .∧θm)→σ,

where θ1, . . . , θm and σ are atomic formulae. We allow m = 0 and σ = ⊥. A Horn formula is a formula that is built from Horn clauses using ∧,∃ and ∀.

Show that Horn formulae are preserved under taking reduced products, i.e., if ϕ is a Horn formula and (Ai,a(i)) such that

kϕ[a]k ∈ F, then

AI/F |=ϕ.

(2)

Exercise 5 [non-standard models]

Analyse non-standard extensions R < R and N < N obtained as ultrapowers AN/U w.r.t. suitable ultrafilters U overN in relation to the base structures A=R,N.

For instance,

(i) which sequences (an)∈NN represent infinitely large numbers?

(ii) which sequences (an)∈RN represent points in the infinitesimal neighbourhood of a∈R?

(iii) what are the possible order-types forN and R?

(iv) investigate the equivalence relations of being “finitely far apart” inN and of being

“of the same order of magnitude” in R \ {0}.

Referenzen

ÄHNLICHE DOKUMENTE

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 &lt;-edge in a suitable

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

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

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

[r]