Weak comparability of well orderings and reverse mathematics
From MaRDI portal
Publication:918549
DOI10.1016/0168-0072(90)90014-SzbMath0706.03044MaRDI QIDQ918549
Harvey M. Friedman, Jeffry L. Hirst
Publication date: 1990
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
reverse mathematicsdifferences between strong and weak comparabilitystrongly comparableweakly comparable well orderings
Related Items (18)
1995–1996 Winter Meeting of the Association for Symbolic Logic ⋮ Ordered Groups: A Case Study in Reverse Mathematics ⋮ Ordinal inequalities, transfinite induction, and reverse mathematics ⋮ On the strength of the finite intersection principle ⋮ Unconventional algorithms: complementarity of axiomatics and construction ⋮ The finite intersection principle and genericity ⋮ The maximal linear extension theorem in second order arithmetic ⋮ Reverse mathematics and homeomorphic embeddings ⋮ Borel quasi-orderings in subsystems of second-order arithmetic ⋮ – CA0 and order types of countable ordered groups ⋮ Embeddings between well-orderings: computability-theoretic reductions ⋮ Riesz representation theorem, Borel measures and subsystems of second- order arithmetic ⋮ Ranked structures and arithmetic transfinite recursion ⋮ SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE ⋮ The Baire category theorem in weak subsystems of second-order arithmetic ⋮ Embeddings of countable closed sets and reverse mathematics ⋮ Reverse mathematics and ordinal exponentiation ⋮ Linear extensions of partial orders and reverse mathematics
Cites Work
- Countable algebra and set existence axioms
- Which set existence axioms are needed to prove the separable Hahn-Banach theorem?
- Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Weak comparability of well orderings and reverse mathematics
