Publisher： Cambridge University Press
E-ISSN： 1943-5886|49|1|51-62
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.49, Iss.1, 1984-03, pp. : 51-62
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Orbits of hyperhypersimple sets and the lattice of
The Journal of Symbolic Logic, Vol. 48, Iss. 3, 1983-09 ,pp. :
Access to resources
Recommend
A theorem on hyperhypersimple sets
The Journal of Symbolic Logic, Vol. 28, Iss. 4, 1963-12 ,pp. :
Codable sets and orbits of computably enumerable sets
The Journal of Symbolic Logic, Vol. 63, Iss. 1, 1998-03 ,pp. :
The Complexity of Orbits of Computably Enumerable Sets
Bulletin of Symbolic Logic, Vol. 14, Iss. 1, 2008-03 ,pp. :
On orbits, of prompt and low computably enumerable sets
The Journal of Symbolic Logic, Vol. 67, Iss. 2, 2002-06 ,pp. :