Linear extensions of partial orders and reverse mathematics

DOI10.1002/malq.201200025zbMath1259.03023arXiv1203.5207OpenAlexW2032211530WikidataQ61834872 ScholiaQ61834872MaRDI QIDQ3144869

Alberto Marcone, Emanuele Frittaion

Publication date: 10 December 2012

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.5207

zbMATH Keywords

ACAembeddabilityreverse mathematicslinearizabilityfinite unioninfinite pigeonhole principle\(\tau \)-likeFUFlinear extensions of partial order

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Related Items (4)

Reverse mathematics, well-quasi-orders, and Noetherian spaces ⋮ Reduction games, provability and compactness ⋮ On the teaching complexity of linear sets ⋮ Reverse mathematics and order theoretic fixed point theorems

Cites Work

• The maximal linear extension theorem in second order arithmetic
• Hilbert versus Hindman
• Weak comparability of well orderings and reverse mathematics
• Computability-theoretic and proof-theoretic aspects of partial and linear orderings
• Equivalence between Fraïssé's conjecture and Jullien's theorem
• On the strength of Ramsey's theorem for pairs
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear extensions of partial orders and reverse mathematics