The weak truth table degrees of recursively enumerable sets

DOI10.1016/0003-4843(75)90007-8zbMATH Open0324.02028OpenAlexW2038443311MaRDI QIDQ4087157FDOQ4087157

Authors: 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)

Cited In (39)

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

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

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