Stability and posets
From MaRDI portal
Recommendations
Cites work
- Chains and antichains in partial orderings
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Effective versions of Ramsey's Theorem: Avoiding the cone above 0′
- Generalized cohesiveness
- scientific article; zbMATH DE number 1226875 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- On the strength of Ramsey's theorem for pairs
Cited in
(9)- Chains and antichains in partial orderings
- Stability of regional orthomodular posets under synchronisation and refinement
- On weakly cut-stable maps
- The uniform content of partial and linear orders
- Infinite chains and antichains in computable partial orderings
- Herrmann’s Beautiful Theorem on Computable Partial Orderings
- scientific article; zbMATH DE number 5697709 (Why is no real title available?)
- scientific article; zbMATH DE number 3999988 (Why is no real title available?)
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
This page was built for publication: Stability and posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630588)