• Keine Ergebnisse gefunden

Prove that there is no proper extension B)AwithB|=T

N/A
N/A
Protected

Academic year: 2021

Aktie "Prove that there is no proper extension B)AwithB|=T"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Lehr- und Forschungsgebiet

Mathematische Grundlagen der Informatik RWTH Aachen

Prof. Dr. E. Grädel, R. Rabinovich

WS 2010/11

Mathematical Logic II — Assignment 9 Due: Monday, December 20, 12:00

Exercise 1 2 + 2 Points

LetTF O(τ) be a theory for a signature τ and let Kbe the class ofτ-structures closed under isomorphisms, i.e. if A∼=B and A∈ K then B ∈ K. Let Mod(T) be the class of models of T and let Th(K) be the theory ofK, i.e. Th(K) =TA∈KTh(A). Prove or disprove:

(a) Mod(Th(K)) =K, (b) Th(Mod(T)) =T.

Exercise 2 2 + 3 + 3 Points

A theory T ⊆FO(τ) is model complete if for arbitraryτ-structures A and B with A,B |=T, A⊆Bimplies AB.

(a) LetT ⊆FO(τ) be a model complete theory and letAbe a finite model of T. Prove that there is no proper extension B)AwithB|=T.

(b) Prove or disprove the model completeness of the theories Th(N, S) whereSis the successor function and Th(Z, <).

(c) Prove that all complete theories over the signautre σ = {P} with one unary relation symbolP are model complete.

Hint: What are the the complete theories overσ?

Exercise 3 3 + 3 + 4 + 6 Points

A theory T ⊆ FO(τ) permits quantifier elimination if for each formula ϕ(x) ∈ FO(τ) there exists a quantifier free formulaϑ(x)∈FO(τ) such thatT |=∀x(ϕ(x)↔ϑ(x)).

(a) Prove that a theory T ⊆ FO(τ) permits quantifier elimination if and only if for every quantifier free formula ψ(x, y) ∈ FO(τ) there is a quantifier free formula ϑ(x) ∈ FO(τ) such thatT |=∀x(∃yψ(x, y)↔ϑ(x)).

(b) Let T ⊆ FO(τ) be a theory that permits quantifier elimination. Prove that T is model complete.

(c) Let T ⊆ FO(τ) be a theory that permits quantifier elimination where τ is a signature without constants. Prove thatT is complete.

(d) Prove that the theory of dense linear orders permits quantifier elimination.

Hint: Use the dijunctive normal form to represent the quantifier free formulae over<.

Exercise 4 4 Points

An elementary chain is a sequence (Aβ)β<α of structures with Aγ Aβ for all γ < β < α. Let (Aβ)β<α an elementary chain. Prove that Aβ Sβ<αAβ holds for β < α.

http://logic.rwth-aachen.de/Teaching/MaLo2-WS10

Referenzen

ÄHNLICHE DOKUMENTE

In der 5ten Gruppenübung haben wir zu einem endlichen Wort w =

Abgabe : bis Mittwoch, den 06.07., um 12:00 Uhr im Übungskasten oder in der Vorlesung.. Geben Sie bitte Namen, Matrikelnummer und die

(a) Die Klasse der ungerichteten Graphen (V, E), in denen jeder Kreis die gleiche Länge hat. (b) Die Klasse der Strukturen (A, f) wobei f eine selbst-inverse Funktion

Mathematische Grundlagen der Informatik RWTH

Consider the polarisation experiment from the lecture, where, instead of 45 ◦ , the filter in the middle polarises light with an angle α, for arbitrary α. Specify how much light

Eine Satz ϕ ist in Gaifman-Form , falls ϕ eine Boolesche Kombination von Sätzen der Form.

Mathematische Grundlagen der Informatik RWTH

Eine positionale Strategie σ nennen wir homogen, wenn sie für alle Knoten mit gleicher Nachfolgermenge den gleichen Nachfolger