Journal of Symbolic Logic 66 (2):923-934 (2001)

Abstract
We show that every infinite computable partial ordering has either an infinite Δ 0 2 chain or an infinite Π 0 2 antichain. Our main result is that this cannot be improved: We construct an infinite computable partial ordering that has neither an infinite Δ 0 2 chain nor an infinite Δ 0 2 antichain
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2695053
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 52,704
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Preface.Douglas Cenzer, Valentina Harizanov, David Marker & Carol Wood - 2009 - Archive for Mathematical Logic 48 (1):1-6.

Add more citations

Similar books and articles

Concerning Infinite Chains, Infinite Trains, and Borrowing a Typewriter.David A. Conway - 1983 - International Journal for Philosophy of Religion 14 (2):71 - 86.
A Note on Partial Meet Package Contraction.Jun Li - 1998 - Journal of Logic, Language and Information 7 (2):139-142.
Infinite Time Decidable Equivalence Relation Theory.Samuel Coskey & Joel David Hamkins - 2011 - Notre Dame Journal of Formal Logic 52 (2):203-228.
The Block Relation in Computable Linear Orders.Michael Moses - 2011 - Notre Dame Journal of Formal Logic 52 (3):289-305.
The Computable Dimension of Trees of Infinite Height.Russell Miller - 2005 - Journal of Symbolic Logic 70 (1):111-141.

Analytics

Added to PP index
2009-01-28

Total views
10 ( #809,566 of 2,340,051 )

Recent downloads (6 months)
1 ( #516,585 of 2,340,051 )

How can I increase my downloads?

Downloads

My notes