Forcing Arguments in Second-Order Arithmetic - Google Sites

0 downloads 138 Views 80KB Size Report
Feb 20, 2012 - p = (Tp,f p,hp) ∈ P if and only if. ▷ Tp ⊆ ω
Forcing Arguments in Second-Order Arithmetic Kenji Omoto Tohoku University

2012/2/20

Reverse Mathematics I



Setting: Second order arithmetic.



Main Question: What axioms are necessary to prove the theorems of Mathematics?



Axiom systems(Big 5): RCA0 ≡ ∆11 -Comprehension + Σ01 -Induction + Semiring ax WKL0 ≡ RCA0 + Weak K¨onig’s lemma ACA0 ≡ RCA0 + Arithmetic Comprehension ATR0 1 Π1 -CA0

≡ ACA0 + Arithmetic Transfinite recursion ≡ ACA0 + Π11 -Comprehension

Theories of Second-Order Arithmetic I ▶

∪ A set is called arithmetical ( n

Suggest Documents