Recursively inseparable sets

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 . Recursively inseparable sets also arise in the study of Gödel's incompleteness theorem.