Structural interactions of the recursively enumerable T- and W-degrees

DOI10.1016/0168-0072(86)90071-0zbMath0604.03015OpenAlexW2083664478MaRDI QIDQ1083447

B. George

Publication date: 1986

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(86)90071-0

zbMATH Keywords

minimal pairTuring degreesweak truth table degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (16)

Maximal contiguous 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 ⋮ Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ Where join preservation fails in the bounded Turing degrees of c.e. sets ⋮ Localization of a theorem of Ambos-Spies and the strong anti-splitting property ⋮ On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets ⋮ TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES ⋮ Tabular degrees in \(\alpha\)-recursion theory ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ Contiguity and distributivity in the enumerable Turing degrees ⋮ T-Degrees, Jump Classes, and Strong Reducibilities ⋮ Computably enumerable sets and quasi-reducibility ⋮ Cappable recursively enumerable degrees and Post's program ⋮ Splitting theorems in recursion theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The density of the nonbranching degrees
• Splitting properties and jump classes
• The recursively enumerable degrees have infinitely many one-types
• 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
• On Pairs of Recursively Enumerable Degrees
• Wtt-degrees and T-degrees of r.e. sets
• The Degrees of R.E. Sets Without the Universal Splitting Property
• The universal splitting property. II
• Anti‐Mitotic Recursively Enumerable Sets
• Pairs without infimum in the recursively enumerable weak truth table degrees
• The universal complementation property
• Splitting properties of r.e. sets and degrees
• Degrees of Splittings and Bases of Recursively Enumerable Subspace
• Degree theoretical splitting properties of recursively enumerable sets
• Bounding minimal pairs
• Decomposition of Recursively Enumerable Degrees
• Strong reducibilities
• A Completely Mitotic Nonrecursive R.E. Degree
• The weak truth table degrees of recursively enumerable sets
• The infinite injury priority method
• Recursively enumerable sets and degrees
• Mitotic recursively enumerable sets
• A minimal pair of recursively enumerable degrees
• The Priority Method I
• Lower Bounds for Pairs of Recursively Enumerable Degrees

This page was built for publication: Structural interactions of the recursively enumerable T- and W-degrees