The weak truth table degrees of recursively enumerable sets

DOI10.1016/0003-4843(75)90007-8zbMath0324.02028OpenAlexW2038443311MaRDI QIDQ4087157

Leonard P. Jun. Sasso, Richard E. Ladner

Publication date: 1975

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(75)90007-8

Mathematics Subject Classification ID

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

Related Items (39)

Structural interactions of the recursively enumerable T- and W-degrees ⋮ Maximal contiguous degrees ⋮ An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees ⋮ Infimum properties differ in the weak truth-table degrees and the Turing degrees ⋮ Intervals and sublattices of the r.e. weak truth table degrees. I: Density ⋮ Classification of degree classes associated with r.e. subspaces ⋮ Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees ⋮ On the problem of the critical bound ⋮ Random non-cupping revisited ⋮ Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ An extended Lachlan splitting theorem ⋮ Intervals containing exactly one c.e. degree ⋮ Where join preservation fails in the bounded Turing degrees of c.e. sets ⋮ Cupping and noncapping in the r.e. weak truth table and turing degrees ⋮ Infima in the recursively enumerable weak truth table degrees ⋮ The theory of the recursively enumerable weak truth-table degrees is undecidable ⋮ Embedding lattices into the wtt-degrees below 0′ ⋮ Localization of a theorem of Ambos-Spies and the strong anti-splitting property ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ tt-degrees of recursively enumerable Turing degrees. II ⋮ Some results about the R.E. degrees ⋮ The computable Lipschitz degrees of computably enumerable sets are not dense ⋮ There Are No Maximal d.c.e. wtt-degrees ⋮ On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets ⋮ The undecidability of the Π₄-theory for the r.e. wtt and Turing degrees ⋮ Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices ⋮ Irreducible, singular, and contiguous degrees ⋮ Contiguity and distributivity in the enumerable Turing degrees ⋮ Trivial Reals ⋮ The ibT degrees of computably enumerable sets are not dense ⋮ Working below a \(low_ 2\) recursively enumerable degree ⋮ Embeddings of \(N_5\) and the contiguous degrees ⋮ Recursively enumerable sets and degrees ⋮ T-Degrees, Jump Classes, and Strong Reducibilities ⋮ Extensions of embeddings below computably enumerable degrees ⋮ The contiguity in R/M. ⋮ Wtt-degrees and T-degrees of r.e. sets ⋮ Strong reducibilities ⋮ Splitting theorems in recursion theory

This page was built for publication: The weak truth table degrees of recursively enumerable sets