Strong reducibility and degrees. #
This file defines the notions of computable many-one reduction and one-one reduction between sets, and shows that the corresponding degrees form a semilattice.
This file uses the local notation
Sum.elim to denote the disjoint union of two degrees.
- [Robert Soare, Recursively enumerable sets and degrees][soare1987]
computability, reducibility, reduction
Lifts a binary function on sets of natural numbers to many-one degrees.