Translator Disclaimer
June 2009 Stability and posets
Carl G. Jockusch, Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon
J. Symbolic Logic 74(2): 693-711 (June 2009). DOI: 10.2178/jsl/1243948336

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.

Citation

Download Citation

Carl G. Jockusch, Jr.. Bart Kastermans. Steffen Lempp. Manuel Lerman. Reed Solomon. "Stability and posets." J. Symbolic Logic 74 (2) 693 - 711, June 2009. https://doi.org/10.2178/jsl/1243948336

Information

Published: June 2009
First available in Project Euclid: 2 June 2009

zbMATH: 1171.03034
MathSciNet: MR2518820
Digital Object Identifier: 10.2178/jsl/1243948336

Subjects:
Primary: 03C57
Secondary: 03D45, 06A06

Rights: Copyright © 2009 Association for Symbolic Logic

JOURNAL ARTICLE
19 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.74 • No. 2 • June 2009
Back to Top