A Reducibility Condition for Recursiveness

DOI10.2307/2041155zbMath0358.02049OpenAlexW4236029930MaRDI QIDQ4133620

Paul H. Morris

Publication date: 1977

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

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

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