Publisher： Cambridge University Press
E-ISSN： 1943-5886|34|1|8-12
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.34, Iss.1, 1969-05, pp. : 8-12
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
On the indexing of classes of recursively enumerable sets
The Journal of Symbolic Logic, Vol. 31, Iss. 1, 1966-03 ,pp. :
Access to resources
Recommend
Π1 0 classes and Boolean combinations of recursively enumerable sets
The Journal of Symbolic Logic, Vol. 39, Iss. 1, 1974-03 ,pp. :
Index sets of finite classes of recursively enumerable sets
The Journal of Symbolic Logic, Vol. 34, Iss. 1, 1969-05 ,pp. :
On completely recursively enumerable classes and their key arrays
The Journal of Symbolic Logic, Vol. 21, Iss. 3, 1956-09 ,pp. :
On complexity properties of recursively enumerable sets
The Journal of Symbolic Logic, Vol. 38, Iss. 4, 1973-12 ,pp. :