Branching Degrees above low Degrees

DOI10.2307/1999198zbMath0498.03028OpenAlexW4245677890MaRDI QIDQ3962982

Peter A. Fejer

Publication date: 1982

Full work available at URL: https://doi.org/10.2307/1999198

zbMATH Keywords

branching degreerecursively enumerable degreelow degreeautomorphism basegeneralized nondiamond question

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (9)

Non-p-generic and strongly nonbranching degree ⋮ Non-p-generic and strongly nonbranching degree ⋮ Some results about the R.E. 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 ⋮ \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture ⋮ Embeddings of \(N_5\) and the contiguous degrees ⋮ Splitting theorems in recursion theory

Cites Work

• Unnamed Item
• Unnamed Item
• The density of the nonbranching degrees
• Interpolation and embedding in the recursively enumerable degrees
• Decomposition of Recursively Enumerable Degrees
• The infinite injury priority method
• A recursively enumerable degree which will not split over all lesser ones
• Computational complexity, speedable and levelable sets
• Degrees of Unsolvability. (AM-55)
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Sublattices of the Recursively Enumerable Degrees

This page was built for publication: Branching Degrees above low Degrees