Structural interactions of the recursively enumerable T- and W-degrees
From MaRDI portal
Publication:1083447
DOI10.1016/0168-0072(86)90071-0zbMath0604.03015MaRDI QIDQ1083447
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
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
03C57: Computable structure theory, computable model theory
03D45: Theory of numerations, effectively presented structures
Related Items
Contiguity and distributivity in the enumerable Turing 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, Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree