A theorem on hyperhypersimple sets
- 1 December 1963
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 28 (4) , 273-278
- https://doi.org/10.2307/2271305
Abstract
Let be the class of recursively enumerable (r.e.) sets with infinite complements. A set M ϵ is maximal if every superset of M which is in is only finitely different from M. In [1] Friedberg shows that maximal sets exist, and it is an easy consequence of this fact that every non-simple set in has a maximal superset. The natural question which arises is whether or not this is also true for every simple set (Ullian [2]). In the present paper this question is answered negatively. However, the main concern of this paper is with demonstrating, and developing a few consequences of, what might be called the “density” of hyperhypersimple sets.Keywords
This publication has 4 references indexed in Scilit:
- A theorem on maximal sets.Notre Dame Journal of Formal Logic, 1961
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958
- Recursive and recursively enumerable ordersTransactions of the American Mathematical Society, 1956
- Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 1944