Deficiency Sets and Bounded Information Reducibilities

DOI10.2307/1997258MaRDI QIDQ3895447zbMATH OpenOpenAlexFDO

Authors Leonard P. Jun. Sasso

Publication date 1974

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites work

• A Completely Mitotic Nonrecursive R.E. Degree
• A Dichotomy of the Recursively Enumerable Sets
• A theorem on hyperhypersimple sets
• A Theorem on Hypersimple Sets
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Creative sets
• Degrees of Unsolvability. (AM-55)
• Mitotic recursively enumerable sets
• Recursive and Recursively Enumerable Orders
• Recursively Enumerable Sets and Retracing Functions
• Recursively enumerable sets of positive integers and their decision problems
• Reducibility and Completeness for Sets of Integers
• Retraceable Sets
• Semirecursive Sets and Positive Reducibility
• The Friedberg-Muchnik Theorem Re-Examined
• Three theorems on the degrees of recursively enumerable sets
• Two Notes on Recursively Enumerable Sets

Cited in

(2)

• A Completely Mitotic Nonrecursive R.E. Degree
• Recursively enumerable sets and degrees

This page was built for publication: Deficiency Sets and Bounded Information Reducibilities

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