On Pseudo‐Creative Sets, Splinters, and Bounded‐Truth‐Table Reducibility

DOI10.1002/malq.19670130106zbMath0207.30602OpenAlexW2035594000MaRDI QIDQ5607998

P. R. Young

Publication date: 1967

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19670130106

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (2)

On sets polynomially enumerable by iteration ⋮ Remarks on retracable, regressive, and pointwise-decomposable sets

This page was built for publication: On Pseudo‐Creative Sets, Splinters, and Bounded‐Truth‐Table Reducibility