Differences of Computably Enumerable Sets

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200010)46:4<555::AID-MALQ555>3.0.CO;2-2" /><555::AID-MALQ555>3.0.CO;2-2 10.1002/1521-3870(200010)46:4<555::AID-MALQ555>3.0.CO;2-2zbMath0964.03043OpenAlexW2119870798MaRDI QIDQ4521130

André Nies, Steffen Lempp

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

zbMATH Keywords

lower semilatticedifferences of computably enumerable sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (3)

Definable relations in Turing degree structures ⋮ On the problem of definability of the computably enumerable degrees in the difference hierarchy ⋮ Turing computability: structural theory

This page was built for publication: Differences of Computably Enumerable Sets