A Theorem on Intermediate Reducibilities
From MaRDI portal
Publication:4047539
DOI10.2307/2036143zbMath0295.02024MaRDI QIDQ4047539
Publication date: 1968
Full work available at URL: https://doi.org/10.2307/2036143
03D25: Recursively (computably) enumerable sets and degrees
Related Items
Cites Work
- On relative coimmunity
- The upper semi-lattice of degrees of recursive unsolvability
- Reducibility and Completeness for Sets of Integers
- Some Notions of Reducibility and Productiveness
- On Semi-Cylinders, Splinters, and Bounded-Truth-Table Reducibility
- Recursively enumerable sets of positive integers and their decision problems