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

DOI10.1007/BF02007561zbMATH Open0619.03032MaRDI QIDQ3755448FDOQ3755448

Klaus Ambos-Spies

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

Recommendations

• The extendibility of relatively capping degrees under the weak truth table reducibility
• Minimal weak truth table degrees and computably enumerable Turing degrees
• A c.e. weak truth table degree which is array noncomputable and r-maximal
• Hypersimplicity and semicomputability in the weak truth table degrees
• Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees
• Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding
• Infimum properties differ in the weak truth-table degrees and the Turing degrees
• Strong noncuppability in low computably enumerable degrees
• The theory of the recursively enumerable weak truth-table degrees is undecidable
• scientific article

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)

Cites Work

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

Cited In (15)

• Title not available (Why is that?)
• Infima in the recursively enumerable weak truth table degrees
• The distribution of the generic recursively enumerable degrees
• \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems
• On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets
• Infimum properties differ in the weak truth-table degrees and the Turing degrees
• Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
• Cappable recursively enumerable degrees and Post's program
• Strong enumeration reducibilities
• Localization of a theorem of Ambos-Spies and the strong anti-splitting property
• Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices
• Two Theorems on Truth Table Degrees
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Title not available (Why is that?)
• Some results about the R.E. degrees

This page was built for publication: Cupping and noncapping in the r.e. weak truth table and turing degrees

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