On Reducibility by Recursive Functions

DOI10.2307/2034902MaRDI QIDQ5344161zbMATH OpenOpenAlexFDO

Authors P. R. Young

Publication date 1964

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

zbMATH Keywords

mathematical logic

Cites work

• scientific article; zbMATH DE number 3394122 (Why is no real title available?)
• Recursive digraphs, splinters and cylinders
• Recursively enumerable sets of positive integers and their decision problems
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• The upper semi-lattice of degrees of recursive unsolvability
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Two Notes on Recursively Enumerable Sets

Cited in

(1)

• Where join preservation fails in the bounded Turing degrees of c.e. sets

This page was built for publication: On Reducibility by Recursive Functions

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