Publisher： Cambridge University Press
E-ISSN： 1943-5886|50|4|983-1001
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.50, Iss.4, 1985-12, pp. : 983-1001
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
Bounding and nonbounding minimal pairs in the enumeration degrees
The Journal of Symbolic Logic, Vol. 70, Iss. 3, 2005-09 ,pp. :
Access to resources
Recommend
Jumps of quasi-minimal enumeration degrees
The Journal of Symbolic Logic, Vol. 50, Iss. 3, 1985-09 ,pp. :
Minimal pairs and high recursively enumerable degrees
The Journal of Symbolic Logic, Vol. 39, Iss. 4, 1974-12 ,pp. :
Least upper bounds for minimal pairs of α-R.E. α-degrees
The Journal of Symbolic Logic, Vol. 39, Iss. 1, 1974-03 ,pp. :
1-genericity in the enumeration degrees
The Journal of Symbolic Logic, Vol. 53, Iss. 3, 1988-09 ,pp. :