Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 74, Issue 2 (2009), 693-711.
Stability and posets
Hirschfeldt and Shore have introduced a notion of stability for infinite posets. We define an arguably more natural notion called weak stability, and we study the existence of infinite computable or low chains or antichains, and of infinite Π01 chains and antichains, in infinite computable stable and weakly stable posets. For example, we extend a result of Hirschfeldt and Shore to show that every infinite computable weakly stable poset contains either an infinite low chain or an infinite computable antichain. Our hardest result is that there is an infinite computable weakly stable poset with no infinite Π01 chains or antichains. On the other hand, it is easily seen that every infinite computable stable poset contains an infinite computable chain or an infinite Π01 antichain. In Reverse Mathematics, we show that SCAC, the principle that every infinite stable poset contains an infinite chain or antichain, is equivalent over RCA0 to WSCAC, the corresponding principle for weakly stable posets.
J. Symbolic Logic Volume 74, Issue 2 (2009), 693-711.
First available in Project Euclid: 2 June 2009
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Primary: 03C57: Effective and recursion-theoretic model theory [See also 03D45]
Secondary: 03D45: Theory of numerations, effectively presented structures [See also 03C57; for intuitionistic and similar approaches see 03F55] 06A06: Partial order, general
Jockusch, Jr., Carl G.; Kastermans, Bart; Lempp, Steffen; Lerman, Manuel; Solomon, Reed. Stability and posets. J. Symbolic Logic 74 (2009), no. 2, 693--711. doi:10.2178/jsl/1243948336. https://projecteuclid.org/euclid.jsl/1243948336.