A Reducibility Condition for Recursiveness

DOI10.2307/2041155zbMATH Open0358.02049OpenAlexW4236029930MaRDI QIDQ4133620FDOQ4133620

Authors: Paul H. Morris 

Publication date: 1977

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

Recommendations

• Bounds in weak truth-table reducibility
• scientific article; zbMATH DE number 701112
• scientific article; zbMATH DE number 63263
• Some reducibilities and splittings of recursively enumerable sets
• scientific article; zbMATH DE number 4202251

Mathematics Subject Classification ID

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

Cites Work

• On subcreative sets and S-reducibility
• Automorphisms of the lattice of recursively enumerable sets
• A noninitial segment of index sets
• The Halting Problem Relativized to Complements

Cited In (1)

• Convex subsets of \(2^n\) and bounded truth-table reducibility

This page was built for publication: A Reducibility Condition for Recursiveness

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