0.Index112109

0.Index112109 - INDEX Notation 12 574 2870 6561 32,805 + -...

Info iconThis preview shows pages 1–5. 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

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: INDEX Notation 12 574 2870 6561 32,805 + - +' -' ' \ C . | | < R > R R R = R < X > X X X = X <* <# <** =** # =# ' ** < s **' p(t) ( ) ' * ** k(x) i , i [i,r] #(t) (r) (g,r) 1 (L) < s ** #(t) +** t[i,r] (T,x) L 2 1CSUB x f < A fA R(f) 1-Con A-tree [A] n fE R + R# R|<x R| x R(S,k,r) T-1 T x T|<x T| x X(t) R(x 1 ,...,x k ) y[1:n] (k,n,m,R 1 ,...,R n-1 ) (k,n,R 1 ,...,R n-1 ) (p,q, ) Words, Phrases - - + (E) (r,E) (r,E;p,q) (E;p,< ) (BRT fragment) assertion assignment basic correct elementary inclusions equation equivalent format incorrect formula inclusions inequations pre elementary inclusions standard m functions and n sets m functions and n sets/ statements T correct T incorrect T reduction T secure tabular classification tabular T classification terms valid worklist -A- absoluteness theorem ACA 0 ACA' ACA adequate AF(L) AL( , ) ALF( , ) annotated table arithmetic arithmetic progression conditions asymptotic assignment atomic indiscernibility A(r,n,m, ,a,b) AS(L*) AS(L**) ATR 0 -B- BAF BFCN binary relation Boolean equation Boolean inequation bounded bounded comprehension...
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 / 12

0.Index112109 - INDEX Notation 12 574 2870 6561 32,805 + -...

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

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