Stability and posets

DOI10.2178/JSL/1243948336zbMath1171.03034OpenAlexW2111205855MaRDI QIDQ3630588

Steffen Lempp, Bart Kastermans, Carl G. jun. Jockusch, Manuel Lerman, D. Reed Solomon

Publication date: 4 June 2009

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1243948336

zbMATH Keywords

posetreverse mathematicscomputabilityweak stabilityCAC

Mathematics Subject Classification ID

Partial orders, general (06A06) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (4)

The uniform content of partial and linear orders ⋮ Herrmann’s Beautiful Theorem on Computable Partial Orderings ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ Chains and antichains in partial orderings

Cites Work

• Unnamed Item
• Unnamed Item
• Chains and antichains in partial orderings
• On the strength of Ramsey's theorem for pairs
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Generalized cohesiveness
• Effective versions of Ramsey's Theorem: Avoiding the cone above 0′

This page was built for publication: Stability and posets