Minimal weak truth table degrees and computably enumerable Turing degrees
From MaRDI portal
Publication:5113922
Recommendations
- Structural interactions of the recursively enumerable T- and W-degrees
- Infimum properties differ in the weak truth-table degrees and the Turing degrees
- On the connections between \(wtt\)- and \(Q\)-reducibilities
- Infima in the recursively enumerable weak truth table degrees
- Infima of recursively enumerable truth table degrees
Cites work
- scientific article; zbMATH DE number 4170891 (Why is no real title available?)
- scientific article; zbMATH DE number 3670379 (Why is no real title available?)
- scientific article; zbMATH DE number 15488 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 3995657 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3319527 (Why is no real title available?)
- scientific article; zbMATH DE number 3404227 (Why is no real title available?)
- A Hierarchy of Turing Degrees
- A minimal degree less than 0’
- Classical recursion theory. The theory of functions and sets of natural numbers
- Classification of degree classes associated with r.e. subspaces
- Computability Theory and Differential Geometry
- Computability and Randomness
- Computable fields and the bounded Turing reduction
- Computably Enumerable Reals and Uniformly Presentable Ideals
- Degrees bounding minimal degrees
- Distributive Initial Segments of the Degrees of Unsolvability
- Effective procedures in field theory
- Initial segments of one-one degrees
- Initial segments of the degrees of unsolvability Part II: minimal degrees
- Is it harder to factor a polynomial or to find a root?
- Maximal contiguous degrees
- Measures and their random reals
- Minimal degrees and the jump operator
- On degrees of recursive unsolvability
- Presentations of computably enumerable reals.
- Recursively enumerable many-one degrees
- Recursively enumerable sets of positive integers and their decision problems
- Simple Proofs of Some Theorems on High Degrees of Unsolvability
- Strong reducibilities
- TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
- The existence of recursively enumerable minimal truth-tabular degrees
- The fractal nature of Riem/Diff. I.
- The recursively enumerable degrees are dense
- The weak truth table degrees of recursively enumerable sets
- Undecidability and initial segments of the (r.e.) tt-degrees
Cited in
(11)- New Computational Paradigms
- On the connections between \(wtt\)- and \(Q\)-reducibilities
- Computably enumerable Turing degrees and the meet property
- Infimum properties differ in the weak truth-table degrees and the Turing degrees
- Weak truth table degrees of structures
- Hypersimplicity and semicomputability in the weak truth table degrees
- scientific article; zbMATH DE number 4135928 (Why is no real title available?)
- Every incomplete computably enumerable truth-table degree is branching
- Cupping and noncapping in the r.e. weak truth table and turing degrees
- scientific article; zbMATH DE number 3861135 (Why is no real title available?)
- Continuity of capping in \(\mathcal C_{\text{bT}}\)
This page was built for publication: Minimal weak truth table degrees and computably enumerable Turing degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113922)
