On Reducibility by Recursive Functions

DOI10.2307/2034902zbMATH Open0134.00804OpenAlexW4235872304MaRDI QIDQ5344161FDOQ5344161

Authors: P. R. Young 

Publication date: 1964

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

zbMATH Keywords

mathematical logic

Cites Work

• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• 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
• Title not available (Why is that?)
• Two Notes on Recursively Enumerable Sets
• Recursive digraphs, splinters and cylinders

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)