Non-Branching Degrees in the Medvedev Lattice of [image] Classes

Journal of Symbolic Logic 72 (1):81 - 97 (2007)
A $\Pi _{1}^{0}$ class is the set of paths through a computable tree. Given classes P and Q, P is Medvedev reducible to Q, P ≤M Q, if there is a computably continuous functional mapping Q into P. We look at the lattice formed by $\Pi _{1}^{0}$ subclasses of 2ω under this reduction. It is known that the degree of a splitting class of c.e. sets is non-branching. We further characterize non-branching degrees, providing two additional properties which guarantee non-branching: inseparable and hyperinseparable. Our main result is to show that non-branching iff inseparable if hyperinseparable if homogeneous and that all unstated implications do not hold. We also show that inseparable and not hyperinseparable degrees are downward dense
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1174668385
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,674
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles
Paul Shafer (2010). Characterizing the Join-Irreducible Medvedev Degrees. Notre Dame Journal of Formal Logic 52 (1):21-38.
Su Gao (1994). The Degrees of Conditional Problems. Journal of Symbolic Logic 59 (1):166-181.
Stephen Binns (2008). Π⁰₁ Classes with Complex Elements. Journal of Symbolic Logic 73 (4):1341-1353.
Andrea Sorbi (1991). Embedding Brouwer Algebras in the Medvedev Lattice. Notre Dame Journal of Formal Logic 32 (2):266-275.

Monthly downloads

Added to index


Total downloads

3 ( #666,019 of 1,903,102 )

Recent downloads (6 months)

1 ( #446,023 of 1,903,102 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.