The limitations of cupping in the local structure of the enumeration degrees

DOI10.1007/S00153-009-0171-1MaRDI QIDQ2267755zbMATH OpenOpenAlexFDO

Authors Mariya I. Soskova

Publication date 2 March 2010

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-009-0171-1

zbMATH Keywords

cuppingenumeration degreeslocal structure

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Review text

In an upper semilattice with greatest element \(\langle{\mathcal A},\leq,\vee,1\rangle\) we say that an element \textbf{a} is cuppable if there exists an element \({\mathbf b} \neq 1\) such that \({\mathbf a}\vee {\mathbf b}=1\) . The element \textbf{b} is called a cupping partner for \textbf{a}. In this paper the author considers cupping properties of the local degree structure of all enumeration degrees reducible to \({\mathbf 0}'_e\), \(D_e( \leq {\mathbf 0}'_e)\), and the following results are obtained: 1.) A sequence of sets containing representatives of cupping partners for every nonzero \(\Delta^{0}_2\) enumeration degree cannot have a \(\Delta^0_2\) enumeration. 2.) Let \textbf{a} be an incomplete \(\Sigma_2^0\) enumeration degree. There exists a nonzero \(3\)-c.e. enumeration degree \({\mathbf b}\) such that \({\mathbf a} \vee {\mathbf b}\neq {\mathbf 0}'_e\).

Recommendations

• Cupping Classes of $\Sigma^0_2$ Enumeration Degrees
• Cupping \Delta₂⁰ Enumeration Degrees to 0 e ′
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
• On the jump classes of noncuppable enumeration degrees
• Cupping Δ₂⁰ enumeration degrees to 0_e′

Cites work

• A Maximum Principle for Degenerate Elliptic Equations
• Branching in the enumeration degrees of the _2⁰ sets
• Cupping \Delta₂⁰ Enumeration Degrees to 0 e ′
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
• Cupping Classes of $\Sigma^0_2$ Enumeration Degrees
• Degrees joining to 0′
• Finite cupping sets
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 1955470 (Why is no real title available?)
• scientific article; zbMATH DE number 1420832 (Why is no real title available?)
• scientific article; zbMATH DE number 3342830 (Why is no real title available?)
• scientific article; zbMATH DE number 3342831 (Why is no real title available?)
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Semirecursive Sets and Positive Reducibility
• The \(n\)-rea enumeration degrees are dense

Cited in

(9)

• Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees
• Modulo computably enumerable degrees by cupping partners
• An almost-universal cupping degree
• Cupping Classes of $\Sigma^0_2$ Enumeration Degrees
• Degrees with almost universal cupping property
• Cupping Δ₂⁰ enumeration degrees to 0_e′
• The method of the Yu–Ding Theorem and its application
• Cupping and definability in the local structure of the enumeration degrees
• Local noncuppability in \(\mathbf R /\mathbf M\)

This page was built for publication: The limitations of cupping in the local structure of the enumeration degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267755)