A Theorem on Intermediate Reducibilities

DOI10.2307/2036143zbMATH Open0295.02024OpenAlexW4239702223MaRDI QIDQ4047539FDOQ4047539

Authors: 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)

Cites Work

• Recursively enumerable sets of positive integers and their decision problems
• Reducibility and Completeness for Sets of Integers
• The upper semi-lattice of degrees of recursive unsolvability
• Some Notions of Reducibility and Productiveness
• On Semi-Cylinders, Splinters, and Bounded-Truth-Table Reducibility
• On relative coimmunity

Cited In (1)

• Strong reducibilities

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4047539)