A Theorem on Recursively Enumerable Classes and Splinters

DOI10.2307/2036088MaRDI QIDQ5607997zbMATH OpenOpenAlexFDO

Authors P. R. Young

Publication date 1966

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

Mathematics Subject Classification ID

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

Cites work

• A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
• Recursively enumerable classes and their application to recursive sequences of formal theories
• Some Theorems on Classes of Recursively Enumerable Sets
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

Cited in

(3)

• On sets polynomially enumerable by iteration
• Positive equivalences
• Infinite Subclasses of Recursively Enumerable Classes

This page was built for publication: A Theorem on Recursively Enumerable Classes and Splinters

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