Structural interactions of the recursively enumerable T- and W-degrees
DOI10.1016/0168-0072(86)90071-0zbMATH Open0604.03015OpenAlexW2083664478MaRDI QIDQ1083447FDOQ1083447
Authors: 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
Recommendations
Computable structure theory, computable model theory (03C57) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Title not available (Why is that?)
- Recursively enumerable sets and degrees
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- A NOTE ON DECOMPOSITIONS OF RECURSIVELY ENUMERABLE SUBSPACES
- The universal complementation property
- Decomposition of Recursively Enumerable Degrees
- The weak truth table degrees of recursively enumerable sets
- The infinite injury priority method
- Title not available (Why is that?)
- A minimal pair of recursively enumerable degrees
- The density of the nonbranching degrees
- Splitting properties and jump classes
- The recursively enumerable degrees have infinitely many one-types
- On Pairs of Recursively Enumerable Degrees
- Degree theoretical splitting properties of recursively enumerable sets
- A Completely Mitotic Nonrecursive R.E. Degree
- Mitotic recursively enumerable sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounding minimal pairs
- Title not available (Why is that?)
- Strong reducibilities
- Title not available (Why is that?)
- The Priority Method I
- Wtt-degrees and T-degrees of r.e. sets
- The universal splitting property. II
- The Degrees of R.E. Sets Without the Universal Splitting Property
- Anti‐Mitotic Recursively Enumerable Sets
- Pairs without infimum in the recursively enumerable weak truth table degrees
- Splitting properties of r.e. sets and degrees
- Degrees of Splittings and Bases of Recursively Enumerable Subspace
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (21)
- Classification of degree classes associated with r.e. subspaces
- On some reducibility and existential interpretability of structures
- On the connections between \(wtt\)- and \(Q\)-reducibilities
- Generating sets for the recursively enumerable Turing degrees
- Splitting theorems in recursion theory
- Minimal weak truth table degrees and computably enumerable Turing degrees
- Infima of recursively enumerable truth table degrees
- Infimum properties differ in the weak truth-table degrees and the Turing degrees
- A hierarchy of computably enumerable degrees
- TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
- Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
- Cappable recursively enumerable degrees and Post's program
- Localization of a theorem of Ambos-Spies and the strong anti-splitting property
- T-Degrees, Jump Classes, and Strong Reducibilities
- Computably enumerable sets and quasi-reducibility
- Intervals and sublattices of the r.e. weak truth table degrees. I: Density
- Contiguity and distributivity in the enumerable Turing degrees
- Maximal contiguous degrees
- Where join preservation fails in the bounded Turing degrees of c.e. sets
- Tabular degrees in \(\alpha\)-recursion theory
- On the strongly bounded Turing degrees of the computably enumerable sets
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)
