![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Publisher: Cambridge University Press
E-ISSN: 1943-5886|54|4|1288-1323
ISSN: 0022-4812
Source: The Journal of Symbolic Logic, Vol.54, Iss.4, 1989-12, pp. : 1288-1323
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Recursively enumerable sets which are uniform for finite extensions
The Journal of Symbolic Logic, Vol. 36, Iss. 2, 1971-06 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Recursively enumerable generic sets
The Journal of Symbolic Logic, Vol. 47, Iss. 4, 1982-12 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Mitotic recursively enumerable sets
The Journal of Symbolic Logic, Vol. 38, Iss. 2, 1973-06 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Simplicity of recursively enumerable sets
The Journal of Symbolic Logic, Vol. 32, Iss. 2, 1967-08 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Characterization of recursively enumerable sets
The Journal of Symbolic Logic, Vol. 37, Iss. 3, 1972-09 ,pp. :