190 likes | 297 Vues
Max Euwe. Model Theory. Jouko Väänänen. Lemma. Denote A k B if has a winning strategy in EF k [A,B]. TFAE (A, a ) k+1 (B, b ) For every cA, then there is dB such that (A, a c) k (B, b d), and for every dB there is cA such that (A, a c) k (B, b d). Game normal formulas.
E N D
Max Euwe Model Theory Jouko Väänänen Model theory
Lemma • Denote AkB if has a winning strategy in EFk[A,B]. • TFAE • (A,a) k+1(B,b) • For every cA, then there is dB such that (A,ac) k(B,bd), and for every dB there is cA such that (A,ac) k(B,bd). Model theory
Game normal formulas • Let 0,…,m-1 be all the unnested atomic formulas in x0,…,xn-1. We assume the signature is finite. • Let n,0 be the finite set of all consistent 0s(0)…m-1s(m-1) where s:m{0,1} and 1= , 0= . • Let 0,…,j-1 be all the finitely many formulas in x0,…,xn inn+1,k • Let n,k+1be the finite set of all iXxni(x0,…,xn)xniXi(x0,…,xn) where X{0,…,j-1}. • Elements of n,k are called game normal formulas. Model theory
Formulas in n,k are mutually contradictory. • k=0: Clear by definition. • Suppose AiXxni(a0,…,an-1,xn)xniXi(a0,…,an-1,xn) AkYxnk(a0,…,an-1,xn)xnkYk(a0,…,an-1,xn) • We show X=Y. If iX, then Ai(a0,…,an) for some an. Hence Ak(a0,…,an) for some kY. By Induction Hypothesis, i=k. Converse is similar. Model theory
Formulas in n,k cover all cases. • A any model, a a sequence a0,…,an-1 in A. • Claim: There is some (x0,…,xn-1) in n,k such that A(a0,…,an-1). • k=0: clear. • k+1: Let 0,…,j-1 be all the finitely many formulas in x0,…,xn inn+1,k. Let X={i:Ai(a0,…,an-1,b) for some b}. • ThenAiXxni(a0,…,an-1,xn)xniXi(a0,…,an-1,xn). Model theory
Formulas in n,k describe winning positions. TFAE • (A,a) k(B,b) • a satisfies the same formula in n,k as b in B. True if k=0. Assume (A,a) k+1(B,b) and AiXxni(a,xn)xniXi(a,xn). We show BiXxni(b,xn)xniXi(b,xn). Fix i. There is c in A such that Ai(a,c). By assumption, there is d in B such that (A,ac) k(B,bd). By Induction Hypothesis, Bi(b,d). Fix then d in B such that for some i Bi(b,d). Again by assumption, there is c in A such that (A,ac) k(B,bd). By Induction Hypothesis, Ai(a,c). Assume then (2), e.g. AiXxni(a,xn)xniXi(a,xn) and BiXxni(b,xn)xniXi(b,xn). To prove (A,a) k+1(B,b), let c in A. There is i such that Ai(a,c). Hence there is d such that Bi(b,d). By Induction Hupothesis, (A,ac) k(B,bd), as desired. Similarly if d in B and Bi(b,d), there is c in A such that Ai(a,c), and again (A,ac) k(B,bd). QED
Every unnested formula of quantifier rank k is equivalent to a disjunction of formulas in n,k • Let (x0,…,xn-1) have quantifier rank k. • Let 0,…,m-1 be all the finitely many formulas in x0,…,xn inn,k that are consistent with (x0,…,xn-1). • Claim: For all A and a: A (a)i i(a). • “” is clear, because n,k “covers all cases”. • “” Suppose Ai(a). There are B and b such that B (b)i(b). (A,a) k(B,b). So A (a). QED Model theory
Equivalence relation AnB i.e. the same sentence of 0,n is true in A and B Only finitely many classes, because each 0,n is finite Lecture 3
n - classes of models Each equivalence class is definable by a sentence of 0,n
n - classes Every model class which is definable by a sentence of quantifier rank n, is a union of equivalence classes
A game characterization of first order logic A model class is first order definable if and only if For somen the model class is closed under n Lecture 3
Game normal form • Every first order formula (x0,...,xn-1) of quantifier rank at most k is equivalent to a disjunction of a finite number of formulas in n,k. Model theory
Not first order definable M is finite Infinite At least n elements n Lecture 3
Not first order definable Among finite models: M has even number of elements 2n+1 elements 2n elenemts n Lecture 3
Not first order definable Lecture 3
Compactness • Compactness Theorem: Let T be a first order theory. If every finite subset of T has a model, then so does T. • Proof: Add constant symbols, as many as there are formulas. Extend T to a Hintikka set T’. T’ has a model A’. The reduct A of A’ to the original signature is a model of T. Model theory
Upward Löwenheim-Skolem Theorem • Suppose A is a model of size in a signature of size . Then A has an elementary extension of size . • Add names to all elements of A • Let T=eldiag(A){cicj: i<k<}. • By compactness T has a model B of cardinality . W.l.o.g. A≺ B. • By Downward Löwenheim-Skolem Theorem there is C of cardinality such that A≺C≺B. Model theory
On the number of models • Let T be a countable complete first order theory. • Let nT() be the number of models of T of cardinality (up to isomorphism). • Löwenheim-Skolem Theorem:nT()>0 for some infinite if and only if nT()>0 for all infinite . • Morley’s Theorem: nT()=1 for some uncountable if and only if nT()=1 for all uncountable . • Shelah’s Theorem:If , then nT()nT(). • Shelah’s Main Gap: For all T,nT() is either very slowly growing (sc. structure case) or very fast growing (sc non-structure case) Model theory
Vaught’s Conjecture • Vaught Conjecture says: If T is countable complete first order theory then nT() or nT()=2. Model theory