Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Recursively_inseparable_sets> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Recursively_inseparable_sets abstract "In computability theory, recursively inseparable sets are pairs of sets of natural numbers that cannot be "separated" with a recursive set (Monk 1976, p. 100). These sets arise in the study of computability theory itself, particularly in relation to Π01 classes. Recursively inseparable sets also arise in the study of Gödel's incompleteness theorem.".
- Recursively_inseparable_sets wikiPageID "26004614".
- Recursively_inseparable_sets wikiPageRevisionID "554279865".
- Recursively_inseparable_sets hasPhotoCollection Recursively_inseparable_sets.
- Recursively_inseparable_sets subject Category:Computability_theory.
- Recursively_inseparable_sets comment "In computability theory, recursively inseparable sets are pairs of sets of natural numbers that cannot be "separated" with a recursive set (Monk 1976, p. 100). These sets arise in the study of computability theory itself, particularly in relation to Π01 classes. Recursively inseparable sets also arise in the study of Gödel's incompleteness theorem.".
- Recursively_inseparable_sets label "Recursively inseparable sets".
- Recursively_inseparable_sets sameAs m.0b6m25p.
- Recursively_inseparable_sets sameAs Q7303355.
- Recursively_inseparable_sets sameAs Q7303355.
- Recursively_inseparable_sets wasDerivedFrom Recursively_inseparable_sets?oldid=554279865.
- Recursively_inseparable_sets isPrimaryTopicOf Recursively_inseparable_sets.