### Stability and posets

Carl G. Jockusch, Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, and Reed Solomon
Source: J. Symbolic Logic Volume 74, Issue 2 (2009), 693-711.

#### Abstract

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.

First Page:
Primary Subjects: 03C57
Secondary Subjects: 03D45, 06A06
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.

Permanent link to this document: http://projecteuclid.org/euclid.jsl/1243948336
Digital Object Identifier: doi:10.2178/jsl/1243948336
Mathematical Reviews number (MathSciNet): MR2518820

### References

Peter A. Cholak, Carl G. Jockusch Jr., and Theodore A. Slaman, On the strength of Ramsey's theorem for pairs, Journal of Symbolic Logic, vol. 66 (2001), pp. 1--55.
Mathematical Reviews (MathSciNet): MR1825173
Digital Object Identifier: doi:10.2307/2694910
Oskar Demuth and Antonín Kučera, Remarks on $1$-genericity, semigenericity, and related concepts, Commentationes Mathematicae Universitatis Carolinae, vol. 28 (1987), pp. 85--94.
Mathematical Reviews (MathSciNet): MR889770
Valentina S. Harizanov, Carl G. Jockusch Jr., and Julia F. Knight, Chains and antichains in partial orderings, Archive for Mathematical Logic, vol. 48 (2009), pp. 39--53.
Mathematical Reviews (MathSciNet): MR2480934
Digital Object Identifier: doi:10.1007/s00153-008-0114-2
Zentralblatt MATH: 1160.03013
Eberhard Herrmann, Infinite chains and antichains in computable partial orderings, Journal of Symbolic Logic, vol. 66 (2001), pp. 923--934.
Mathematical Reviews (MathSciNet): MR1833487
Digital Object Identifier: doi:10.2307/2695053
Zentralblatt MATH: 1018.03038
Denis R. Hirschfeldt, Carl G. Jockusch Jr, Bjørn Kjos-Hanssen, Steffen Lempp, and Theodore A. Slaman, The strength of some combinatorial principles related to Ramsey's theorem for pairs, Proceedings of the Program on Computational Prospects of Infinity (C. T. Chong, Qi Feng, Theodore Slaman, Hugh Woodin, and Yue Yang, editors), IMS Proceedings, World Scientific, 2007, pp. 143--161.
Denis R. Hirschfeldt and Richard A. Shore, Combinatorial principles weaker than Ramsey's theorem for pairs, Journal of Symbolic Logic, vol. 72 (2007), pp. 171--206.
Mathematical Reviews (MathSciNet): MR2298478
Digital Object Identifier: doi:10.2178/jsl/1174668391
Project Euclid: euclid.jsl/1174668391
Zentralblatt MATH: 1118.03055
Tamara L. Hummel, Effective versions of Ramsey's theorem: Avoiding the cone above $\bf 0'$, Journal of Symbolic Logic, vol. 59 (1994), pp. 1301--1325.
Mathematical Reviews (MathSciNet): MR1312312
Digital Object Identifier: doi:10.2307/2275707
Zentralblatt MATH: 0815.03028
Tamara L. Hummel and Carl G. Jockusch Jr., Generalized cohesiveness, Journal of Symbolic Logic, vol. 64 (1999), pp. 489--516.
Mathematical Reviews (MathSciNet): MR1777768
Digital Object Identifier: doi:10.2307/2586482
Carl G. Jockusch Jr., Ramsey's theorem and recursion theory, Journal of Symbolic Logic, vol. 37 (1972), pp. 268--280.
Mathematical Reviews (MathSciNet): MR376319
Digital Object Identifier: doi:10.2307/2272972
Zentralblatt MATH: 0262.02042
Hartley Rogers Jr, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York-Toronto-London, 1967.
Mathematical Reviews (MathSciNet): MR224462
Stephen G. Simpson, Subsystems of Second Order Arithmetic, Springer-Verlag, Berlin, Heidelberg, 1999.
Mathematical Reviews (MathSciNet): MR1723993