5.4limForm071110 - 1 5.4. Limited formulas, limited...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 5.4. Limited formulas, limited indiscernibles, x-definability, normal form. We fix M = (A,<,0,1,+,-,, ,log,E,c 1 ,c 2 ,...) as given by Lemma 5.3.18. DEFINITION 5.4.1. Let L(E) be the first order predicate calculus with equality, using <,0,1,+,-,, ,log,E, where E is 1-ary. The c's are not allowed in L(E). We will always write t E instead of E(t). We follow the convention that (v 1 ,...,v k ) represents a formula of L(E) whose free variables are among v 1 ,...,v k . This does not require that v k be free or even appear in . Recall that all variables are of the form v n , where n 1. In this section, we will only be concerned with what we call the E formulas of L(E). DEFINITION 5.4.2. The E formulas of L(E) are inductively defined as follows. i) Every atomic formula of L(E) is an E formula; ii) If , are E formulas then ( ), ( ), ( ), ( ), ( ) are E formulas; iii) If is an E formula and n 1, then ( v n E)( ), ( v n E)( ) are E formulas. DEFINITION 5.4.3. We take ( v n E)( ), ( v n E)( ) to be abbreviations of ( v n )(v n E ), ( v n )(v n E ). Although general formulas of L(E) will arise in this section, content will be focused on their relativizations, which are E formulas of L(E). DEFINITION 5.4.4. Let (v 1 ,...,v k ) be a formula of L(E) and v be a variable not among v 1 ,...,v k . We let (v 1 ,...,v k ) v be the result of bounding all quantifiers in (v 1 ,...,v k ) to E [0,v]. I.e., we replace each quantifier 2 ( u) by ( u E [0,v]) ( u) by ( u E [0,v]). These bounded quantifiers are (can be) expanded in the well known way to create an actual formula in L(E). We now define a very important 6-ary relation. DEFINITION 5.4.5. We define A(r,n,m, ,a,b) if and only if i) r,n,m,a,b N\{0}, n < m; ii) = (v 1 ,...,v r ) is a formula of L(E); i.e., all free variables of are among v 1 ,...,v r ; iii) Let x 1 ,...,x r E [0,c n ]. Then (x 1 ,...,x r ) c_n aCODE(c m ;c n ,...,c m-1 ,x 1 ,...,x r )+b E. LEMMA 5.4.1. Let r,n 1 and (v 1 ,...,v r ) be a quantifier free formula of L. There exist a,b such that A(r,n,n+1, ,a,b). Proof: Let r,n, be as given. Note that c_n = . By Lemma 5.3.18 vii), let a,b N\{0} be such that the following holds. Let n 1 and x 1 ,...,x r E [0,c n ]. ( y E)(y |c n ,x 1 ,...,x r | y |x 1 ,...,x r | (c n ,x 1 ,...,x r ,y)) ( y E)(y |c n ,x 1 ,...,x r | (c n ,x 1 ,...,x r ,y)) aCODE(c n+1 ;c n ,x 1 ,...,x r )+b E....
View Full Document

This note was uploaded on 08/05/2011 for the course MATH 366 taught by Professor Joshua during the Fall '08 term at Ohio State.

Page1 / 15

5.4limForm071110 - 1 5.4. Limited formulas, limited...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online