Publisher： Cambridge University Press
E-ISSN： 1943-5886|36|2|271-287
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.36, Iss.2, 1971-06, pp. : 271-287
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
Index sets of finite classes of recursively enumerable sets
The Journal of Symbolic Logic, Vol. 34, Iss. 1, 1969-05 ,pp. :
Access to resources
Recommend
On complexity properties of recursively enumerable sets
The Journal of Symbolic Logic, Vol. 38, Iss. 4, 1973-12 ,pp. :
Degrees of recursively enumerable sets which have no maximal supersets
The Journal of Symbolic Logic, Vol. 33, Iss. 3, 1968-10 ,pp. :
Recursively enumerable generic sets
The Journal of Symbolic Logic, Vol. 47, Iss. 4, 1982-12 ,pp. :