scientific article; zbMATH DE number 3825795
zbMATH Open0522.03044MaRDI QIDQ3671967FDOQ3671967
Authors: Harvey M. Friedman, Kenneth McAloon, Stephen G. Simpson 
Publication date: 1982
Title of this publication is not available (Why is that?)
jumpproof-theoretic ordinalprimitive recursive arithmeticsecond order arithmeticpredicative analysisarithmetical transfinite recursion with restricted inductionundecidable statements
Higher-type and set recursion theory (03D65) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15) Second- and higher-order model theory (03C85) Nonstandard models (03H99)
Cited In (24)
- Weak comparability of well orderings and reverse mathematics
- Levels of truth
- Countable algebra and set existence axioms
- The Galvin-Prikry theorem and set existence axioms
- Title not available (Why is that?)
- Borel quasi-orderings in subsystems of second-order arithmetic
- Some combinatorial principles equivalent to restrictions of transfinite induction up to \(\Gamma _ 0\)
- The Operational Perspective: Three Routes
- Strong WQO Tree Theorems
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
- Generalized fusible numbers and their ordinals
- Riesz representation theorem, Borel measures and subsystems of second- order arithmetic
- A dual form of Ramsey's theorem
- Some set-theoretic reduction principles
- Connected components of graphs and reverse mathematics
- Universes in explicit mathematics
- Which set existence axioms are needed to prove the separable Hahn-Banach theorem?
- More on lower bounds for partitioning \(\alpha\)-large sets
- Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
- Analyzing Nash-Williams' partition theorem by means of ordinal types
- The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem
- The strength of infinitary Ramseyan principles can be accessed by their densities
- Fast growing functions based on Ramsey theorems
- Fraïssé's conjecture in \(\Pi_1^1\)-comprehension
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671967)
