Publisher： Cambridge University Press
E-ISSN： 1943-5886|21|3|304-308
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.21, Iss.3, 1956-09, pp. : 304-308
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
Π1 0 classes and Boolean combinations of recursively enumerable sets
The Journal of Symbolic Logic, Vol. 39, Iss. 1, 1974-03 ,pp. :
Access to resources
Recommend
Partially ordered sets representable by recursively enumerable classes
The Journal of Symbolic Logic, Vol. 34, Iss. 1, 1969-05 ,pp. :
On the indexing of classes of recursively enumerable sets
The Journal of Symbolic Logic, Vol. 31, Iss. 1, 1966-03 ,pp. :
Index sets of finite classes of recursively enumerable sets
The Journal of Symbolic Logic, Vol. 34, Iss. 1, 1969-05 ,pp. :
The strong anticupping property for recursively enumerable degrees
The Journal of Symbolic Logic, Vol. 54, Iss. 2, 1989-06 ,pp. :