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:
- Does the Feferman-Schutte analysis give a precise characterization of Predicative Second-Order Arithmetic?
- Can the Burgess-Hazen analysis of Predicative Arithmetic be extended to Transfinite Types?
- Did Gödel prove that the Ramified Theory of Types collapses at $\omega_1$?
- Has the Ramified Theory of Types been applied to NBG?
- What is the proof-theoretic ordinal of Hyperarithmetical Comprehension?
- Why is adopting Russell's Axiom of Reducibility as strong as eliminating the Ramified Hierarchy?
- What can be achieved by liberalizing induction for $RCA_0$?
- Proof-theoretic ordinals after liberalizing induction to $RCA_0$
- Does $\text{ACA}_0$ + True Arithmetic prove the well-foundedness of every recursive ordinal?
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.