The density of the nonbranching degrees
From MaRDI portal
Publication:1055403
DOI10.1016/0168-0072(83)90028-3zbMATH Open0521.03026OpenAlexW2055472336MaRDI QIDQ1055403FDOQ1055403
Authors: Peter A. Fejer 
Publication date: 1983
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(83)90028-3
Cites Work
- The recursively enumerable degrees are dense
- Recursively enumerable sets of positive integers and their decision problems
- On the degrees less than 0'
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- Title not available (Why is that?)
- The upper semi-lattice of degrees of recursive unsolvability
- The undecidability of the recursively enumerable degrees
- A recursively enumerable degree which will not split over all lesser ones
- Title not available (Why is that?)
- The infinite injury priority method
- Not every finite lattice is embeddable in the recursively enumerable degrees
- Title not available (Why is that?)
- The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
Cited In (21)
- Undecidability and 1-types in intervals of the computably enumerable degrees
- Infima in the d.r.e. degrees
- Undecidability and 1-types in the recursively enumerable degrees
- The distribution of the generic recursively enumerable degrees
- Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees
- Initial segments of the lattice of ideals of r.e. degrees
- Degrees containing members of thin \(\Pi_1^0\) classes are dense and co-dense
- Non-p-generic and strongly nonbranching degree
- Splitting properties of r.e. sets and degrees
- Lattice nonembeddings and initial segments of the recursively enumerable degrees
- 1996–97 Annual Meeting of the Association for Symbolic Logic
- Members of thin \(\Pi_1^0\) classes and generic degrees
- Branching Degrees above low Degrees
- Lattice nonembeddings and intervals of the recursively enumerable degrees
- Non-p-generic and strongly nonbranching degree
- Infima of d.r.e. degrees
- Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective
- Decomposition and infima in the computably enumerable degrees
- Branching in the enumeration degrees of the \(\Sigma_2^0\) sets
- Structural interactions of the recursively enumerable T- and W-degrees
- Annual Meeting of the Association for Symbolic Logic, Berkeley, 1990
This page was built for publication: The density of the nonbranching degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1055403)
