Differences of Computably Enumerable Sets
From MaRDI portal
Publication:4521130
DOI<555::AID-MALQ555>3.0.CO;2-2 10.1002/1521-3870(200010)46:4<555::AID-MALQ555>3.0.CO;2-2zbMath0964.03043MaRDI QIDQ4521130
Publication date: 19 December 2000
Full work available at URL: https://doi.org/10.1002/1521-3870(200010)46:4<555::aid-malq555>3.0.co;2-2
03D25: Recursively (computably) enumerable sets and degrees
Related Items
Definable relations in Turing degree structures, On the problem of definability of the computably enumerable degrees in the difference hierarchy, Turing computability: structural theory