On Semi-Cylinders, Splinters, and Bounded-Truth-Table Reducibility

DOI10.2307/1994272zbMath0163.25203OpenAlexW4232307365MaRDI QIDQ5547581

P. R. Young

Publication date: 1965

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

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (3)

Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees ⋮ On sets polynomially enumerable by iteration ⋮ A Theorem on Intermediate Reducibilities

Cites Work

• Recursive digraphs, splinters and cylinders
• A note on pseudo-creative sets and cylinders
• Quasicreative Sets
• A Note on Bounded-Truth-Table Reducibility
• Recursively enumerable sets of positive integers and their decision problems
• Creative sets

This page was built for publication: On Semi-Cylinders, Splinters, and Bounded-Truth-Table Reducibility