A theorem on hyperhypersimple sets

DOI10.2307/2271305zbMath0207.30505OpenAlexW2047937662MaRDI QIDQ5607996

Donald A. Martin

Publication date: 1964

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Deficiency Sets and Bounded Information Reducibilities, On the Lattice of Recursively Enumerable Sets, Recursive Density Types. II, Completeness, the Recursion Theorem, and Effectively Simple Sets, ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS, Computably enumerable sets and related issues, Pointwise decomposable sets, On the theory of Π₃¹ sets of reals, Supersets of recursively enumerable sets, Recursively enumerable sets and degrees, Remarks on retracable, regressive, and pointwise-decomposable sets

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