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.
Publisher
Cambridge University Press (CUP)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS;Journal of Mathematical Logic;2013-10-31
2. Computably enumerable sets and related issues;Algebra and Logic;2012-01
3. Some New Lattice Constructions in High R. E. Degrees;Mathematical Logic Quarterly;1995
4. Twenty questions to a p-selector;Information Processing Letters;1993-11
5. Bibliography;Studies in Logic and the Foundations of Mathematics;1992