Home
Add Document
Sign In
Create An Account
Forcing Arguments in Second-Order Arithmetic - Google Sites
Recommend Documents
No documents
Forcing Arguments in Second-Order Arithmetic - Google Sites
Download PDF
0 downloads
138 Views
80KB Size
Report
Comment
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
×
Report "Forcing Arguments in Second-Order Arithmetic - Google Sites"
Your name
Email
Reason
-Select Reason-
Pornographic
Defamatory
Illegal/Unlawful
Spam
Other Terms Of Service Violation
File a copyright complaint
Description
×
Sign In
Email
Password
Remember me
Forgot password?
Sign In
Our partners will collect data and use cookies for ad personalization and measurement.
Learn how we and our ad partner Google, collect and use data
.
Agree & close