On minimal pairs of enumeration degrees
From MaRDI portal
Publication:4723719
DOI10.2307/2273985zbMath0615.03031MaRDI QIDQ4723719
Publication date: 1985
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273985
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Embedding finite lattices into the Σ20 enumeration degrees, The distribution of properly Σ20 e-degrees, Structural properties and Σ20 enumeration degrees, Definability via Kalimullin pairs in the structure of the enumeration degrees, The enumeration degrees: Local and global structural interactions, Bounding nonsplitting enumeration degrees, Bounding and nonbounding minimal pairs in the enumeration degrees, Badness and jump inversion in the enumeration degrees, Strong enumeration reducibilities, A high noncuppable \({\Sigma^0_2}\) \(e\)-degree, Goodness in the enumeration and singleton degrees, Branching in the enumeration degrees of the \(\Sigma_2^0\) sets, Enumeration 1-genericity in the local enumeration degrees, On restricted forms of enumeration reducibility, Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees, There exists a maximal 3-c.e. enumeration degree, Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees, Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees, Diamond embeddings into the enumeration degrees, On the jump classes of noncuppable enumeration degrees, Noncappable enumeration degrees below 0e′, ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS, Properly enumeration degrees and the high/low hierarchy, Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees, 1-genericity in the enumeration degrees, Embedding the diamond in the Σ2 enumeration degrees
Cites Work
- Unnamed Item
- Unnamed Item
- On degrees of recursive unsolvability
- The upper semi-lattice of degrees of recursive unsolvability
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- Sublattices of the Recursively Enumerable Degrees
- Enumeration reducibility and partial degrees
