A Theorem on Intermediate Reducibilities

DOI10.2307/2036143zbMath0295.02024OpenAlexW4239702223MaRDI QIDQ4047539

Thomas G. McLaughlin

Publication date: 1968

Full work available at URL: https://doi.org/10.2307/2036143

Mathematics Subject Classification ID

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

Related Items (1)

Strong reducibilities

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

This page was built for publication: A Theorem on Intermediate Reducibilities