Structural interactions of the recursively enumerable T- and W-degrees
This paper studies relationships between weak truth table and Turing reducibilities (and their applications to recursive model theory, r.e. sets etc.). Various interactions are discussed. A flavour is provided by the following typical theorems: there exist r.e. sets \(A\equiv_ TB\) with the infinum of the W-degrees of A and B not existing; there exist r.e. nonrecursive sets A and B with \(A\equiv_ TB\) and the W-degrees of A and B forming a minimal pair; and there exists a non-zero r.e. degree \(\underset \tilde{} a\) such that if A is an r.e. set of degree \(\underset \tilde{} a\) then there is an r.e. set B with \(\emptyset <_ TB<_ TA\) and the W- degrees of B and A forming a minimal pair.
- A Completely Mitotic Nonrecursive R.E. Degree
- A minimal pair of recursively enumerable degrees
- A NOTE ON DECOMPOSITIONS OF RECURSIVELY ENUMERABLE SUBSPACES
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- Anti‐Mitotic Recursively Enumerable Sets
- Bounding minimal pairs
- Decomposition of Recursively Enumerable Degrees
- Degree theoretical splitting properties of recursively enumerable sets
- Degrees of Splittings and Bases of Recursively Enumerable Subspace
- scientific article; zbMATH DE number 3914304 (Why is no real title available?)
- scientific article; zbMATH DE number 3914305 (Why is no real title available?)
- scientific article; zbMATH DE number 3916252 (Why is no real title available?)
- scientific article; zbMATH DE number 3739515 (Why is no real title available?)
- scientific article; zbMATH DE number 3782988 (Why is no real title available?)
- scientific article; zbMATH DE number 3458600 (Why is no real title available?)
- scientific article; zbMATH DE number 3895050 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3404227 (Why is no real title available?)
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- Mitotic recursively enumerable sets
- On Pairs of Recursively Enumerable Degrees
- Pairs without infimum in the recursively enumerable weak truth table degrees
- Recursively enumerable sets and degrees
- Splitting properties and jump classes
- Splitting properties of r.e. sets and degrees
- Strong reducibilities
- The Degrees of R.E. Sets Without the Universal Splitting Property
- The density of the nonbranching degrees
- The infinite injury priority method
- The Priority Method I
- The recursively enumerable degrees have infinitely many one-types
- The universal complementation property
- The universal splitting property. II
- The weak truth table degrees of recursively enumerable sets
- Wtt-degrees and T-degrees of r.e. sets
- Intervals and sublattices of the r.e. weak truth table degrees. I: Density
- Classification of degree classes associated with r.e. subspaces
- Infima of recursively enumerable truth table degrees
- Infima in the recursively enumerable weak truth table degrees
- Tabular degrees in \(\alpha\)-recursion theory
- Computably enumerable sets and quasi-reducibility
- Cappable recursively enumerable degrees and Post's program
- Splitting theorems in recursion theory
- Infimum properties differ in the weak truth-table degrees and the Turing degrees
- Correlations between e-degrees and T-degrees
- Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
- On some reducibility and existential interpretability of structures
- Where join preservation fails in the bounded Turing degrees of c.e. sets
- On the strongly bounded Turing degrees of the computably enumerable sets
- On the connections between wtt- and Q-reducibilities
- TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
- Generating sets for the recursively enumerable Turing degrees
- Localization of a theorem of Ambos-Spies and the strong anti-splitting property
- T-Degrees, Jump Classes, and Strong Reducibilities
- Contiguity and distributivity in the enumerable Turing degrees
- Maximal contiguous degrees
- A hierarchy of computably enumerable degrees
- Minimal weak truth table degrees and computably enumerable Turing degrees
This page was built for publication: Structural interactions of the recursively enumerable T- and W-degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083447)