A Theorem on Recursively Enumerable Classes and Splinters
From MaRDI portal
Publication:5607997
DOI10.2307/2036088zbMath0207.30601MaRDI QIDQ5607997
Publication date: 1966
Full work available at URL: https://doi.org/10.2307/2036088
03D25: Recursively (computably) enumerable sets and degrees
Related Items
Infinite Subclasses of Recursively Enumerable Classes, On sets polynomially enumerable by iteration, Positive equivalences
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