Skip to main content Accessibility help
×
×
Home

Stability and posets

  • Carl G. Jockusch (a1), Bart Kastermans (a2), Steffen Lempp (a2), Manuel Lerman (a3) and Reed Solomon (a3)...

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 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 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 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 WSAC, the corresponding principle for weakly stable posets.

Copyright

References

Hide All
[1]Cholak, Peter A., Jockusch, Carl G. Jr., and Slaman, Theodore A., On the strength of Ramsey's theorem for pairs, this Journal, vol. 66 (2001), pp. 155.
[2]Demuth, Oskar and Kučera, Antonín, Remarks on l-genericity, semigenericity, and related concepts, Commentationes Mathematicae Universitatis Carolinae, vol. 28 (1987), pp. 8594.
[3]Harizanov, Valentina S., Jockusch, Carl G. Jr., and Knight, Julia F., Chains and antichains in partial orderings, Archive for Mathematical Logic, vol. 48 (2009), pp. 3953.
[4]Herrmann, Eberhard, Infinite chains and antichains in computable partial orderings, this Journal, vol. 66 (2001), pp. 923934.
[5]Hirschfeldt, Denis R., Jockusch, Carl G. Jr, Kjos-Hanssen, Bjørn, Lempp, Steffen, and Slaman, Theodore A., The strength of some combinatorial principles related to Ramsey's theorem for pairs, Proceedings of the Program on Computational Prospects of Infinity (Chong, C. T., Feng, Qi, Slaman, Theodore, Woodin, Hugh, and Yang, Yue, editors), IMS Proceedings, World Scientific, 2007, pp. 143161.
[6]Hirschfeldt, Denis R. and Shore, Richard A., >Combinatorial principles weaker than Ramsey's theorem for pairs, this Journal, vol. 72 (2007), pp. 171206.
[7]Hummel, Tamara L., Effective versions of Ramsey's theorem: Avoiding the cone above 0′, this Journal, vol. 59 (1994), pp. 13011325.
[8]Hummel, Tamara L. and Jockusch, Carl G. Jr., Generalized cohesiveness, this Journal, vol. 64 (1999), pp. 489516.
[9]Jockusch, Carl G. Jr., Ramsey's theorem and recursion theory, this Journal, vol. 37 (1972), pp. 268280.
[10]Rogers, Hartley Jr, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York-Toronto-London, 1967.
[11]Simpson, Stephen G., Subsystems of Second Order Arithmetic, Springer-Verlag, Berlin, Heidelberg, 1999.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed