Differences of Computably Enumerable Sets

DOI10.1002/1521-3870(200010)46:4%3C555::AID-MALQ555%3E3.0.CO;2-2zbMATH Open0964.03043OpenAlexW2119870798MaRDI QIDQ4521130FDOQ4521130

Authors: Steffen Lempp, André Nies 

Publication date: 19 December 2000

Full work available at URL: https://doi.org/10.1002/1521-3870(200010)46:4%3C555::aid-malq555%3E3.0.co;2-2

Recommendations

• Difference sets and computability theory
• Difference Sets and Recursion Theory
• scientific article; zbMATH DE number 3995652
• On the problem of definability of the computably enumerable degrees in the difference hierarchy
• Definable relations in Turing degree structures

zbMATH Keywords

lower semilatticedifferences of computably enumerable sets

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• An algorithm for enumerating difference sets
• A Note on the Differences of Computably Enumerable Reals
• Turing computability: structural theory
• On the problem of definability of the computably enumerable degrees in the difference hierarchy
• Definable relations in Turing degree structures
• Title not available (Why is that?)
• Relative enumerability in the difference hierarchy

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521130)