A theorem on hyperhypersimple sets

Publisher： Cambridge University Press

E-ISSN： 1943-5886|28|4|273-278

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.28, Iss.4, 1963-12, pp. : 273-278

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

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.

Related content

On the orbits of hyperhypersimple sets

By  

The Journal of Symbolic Logic, Vol. 49, Iss. 1, 1984-03 ,pp. : 51-62 (12)

Cambridge University Press

Access to resources Recommend Favorite

Orbits of hyperhypersimple sets and the lattice of Σ 0 3 sets

By  

The Journal of Symbolic Logic, Vol. 48, Iss. 3, 1983-09 ,pp. : 693-699 (7)

Cambridge University Press

Access to resources Recommend Favorite

A Basis Theorem for Perfect Sets

By  

Bulletin of Symbolic Logic, Vol. 4, Iss. 2, 1998-06 ,pp. : 204-209 (6)

Cambridge University Press

Access to resources Recommend Favorite

Borel sets and Ramsey's theorem1

By  

The Journal of Symbolic Logic, Vol. 38, Iss. 2, 1973-06 ,pp. : 193-198 (6)

Cambridge University Press

Access to resources Recommend Favorite

A structure theorem for semibounded sets in the reals

By  

The Journal of Symbolic Logic, Vol. 57, Iss. 3, 1992-09 ,pp. : 779-794 (16)

Cambridge University Press

Access to resources Recommend Favorite