The maximal linear extension theorem in second order arithmetic
From MaRDI portal
(Redirected from Publication:634769)
Abstract: We show that the maximal linear extension theorem for well partial orders is equivalent over RCA_0 to ATR_0. Analogously, the maximal chain theorem for well partial orders is equivalent to ATR_0 over RCA_0.
Recommendations
- The Recursively Mahlo Property in Second Order Arithmetic
- Linear extensions of semiorders: A maximization problem
- The maximal order of certain arithmetic functions
- Maximal extensions with simple multiplication for the algebra of matrices of the second order
- Determinacy in second order arithmetic
- The mean value theorem in second order arithmetic
- scientific article
- Maximal extensions of ordered fields
- The limits of determinacy in second-order arithmetic
Cites work
- scientific article; zbMATH DE number 4033738 (Why is no real title available?)
- scientific article; zbMATH DE number 4033746 (Why is no real title available?)
- scientific article; zbMATH DE number 3677903 (Why is no real title available?)
- scientific article; zbMATH DE number 16105 (Why is no real title available?)
- scientific article; zbMATH DE number 3210032 (Why is no real title available?)
- scientific article; zbMATH DE number 3248824 (Why is no real title available?)
- scientific article; zbMATH DE number 2236636 (Why is no real title available?)
- scientific article; zbMATH DE number 2236637 (Why is no real title available?)
- scientific article; zbMATH DE number 2236642 (Why is no real title available?)
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Computable linearizations of well-partial-orderings
- Graph minors. XX: Wagner's conjecture
- On Chains and Antichains in well Founded Partially Ordered Sets
- On Fraissé's order type conjecture
- On Fraïssé's conjecture for linear orders of finite Hausdorff rank
- On the strength of Ramsey's theorem for pairs
- Ordered sets
- Ordering by Divisibility in Abstract Algebras
- Ordinal numbers and the Hilbert basis theorem
- Partially well ordered sets and partial ordinals
- Program termination and well partial orderings
- Reverse mathematics and ordinal exponentiation
- Reverse mathematics and the equivalence of definitions for well and better quasi-orders
- Subsystems of second order arithmetic
- The theory of well-quasi-ordering: a frequently discovered concept
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
- Weak comparability of well orderings and reverse mathematics
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
Cited in
(11)- Reverse mathematics and initial intervals
- scientific article; zbMATH DE number 6983478 (Why is no real title available?)
- The reverse mathematics of wqos and bqos
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
- Reverse mathematics, well-quasi-orders, and Noetherian spaces
- (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE
- A computably enumerable partial ordering without computably enumerable maximal chains and antichains
- Computing maximal chains
- Linear extensions of partial orders and reverse mathematics
- Well-partial orderings and their maximal order types
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
This page was built for publication: The maximal linear extension theorem in second order arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q634769)
