Page not found
This question was removed from MathOverflow for reasons of moderation. Please refer to the help center for possible explanations why a question might be removed.
Here are some similar questions that might be relevant:
- Reducing ACA₀ proof to First Order PA
- Why can't proofs have infinitely many steps?
- Existential instantiation in Hilbert-style deduction systems
- Show that Z2 is not conservative over PA
- Which ordinals can be proof-theoretic ordinals of a reasonable theory?
- Let's keep adding once undecidable statements
- Proof-theoretic ordinals: inevitable consistency?
- What does "can almost be proven in PA" mean regarding Theorem 2 of Timothy Chow's expository article, "The Consistency of Arithmetic"?
Try a Google Search
Try searching for similar questions
Browse our recent questions
Browse our popular tags
If you feel something is missing that should be here, contact us.