A Theorem on Recursively Enumerable Classes and Splinters

DOI10.2307/2036088zbMath0207.30601OpenAlexW4249965478MaRDI QIDQ5607997

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)

Related Items (3)

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

Cites Work

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

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