Cupping and noncapping in the r.e. weak truth table and turing degrees

DOI10.1007/BF02007561zbMath0619.03032MaRDI QIDQ3755448

Ambos-Spies, Klaus

Publication date: 1985

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/138042

zbMATH Keywords

Turing degreenoncappable degreeanti-cupping propertynoncappable r.e. wtt degrees

Mathematics Subject Classification ID

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

Related Items

Strong enumeration reducibilities ⋮ Infima in the recursively enumerable weak truth table degrees ⋮ Localization of a theorem of Ambos-Spies and the strong anti-splitting property ⋮ Maximal pairs of computably enumerable sets in the computably Lipschitz degrees ⋮ On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets ⋮ Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices ⋮ The distribution of the generic recursively enumerable degrees ⋮ Cappable recursively enumerable degrees and Post's program

Cites Work

• Unnamed Item
• Splitting properties and jump classes
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Wtt-degrees and T-degrees of r.e. sets
• An extension of the nondiamond theorem in classical and α-recursion theory
• Recursively enumerable generic sets
• The weak truth table degrees of recursively enumerable sets
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Sublattices of the Recursively Enumerable Degrees