Publisher： Cambridge University Press
E-ISSN： 1943-5886|67|1|409-437
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.67, Iss.1, 2002-03, pp. : 409-437
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
Maximal chains in the Turing degrees
The Journal of Symbolic Logic, Vol. 72, Iss. 4, 2007-12 ,pp. :
Access to resources
Recommend
Turing degrees and many-one degrees of maximal sets
The Journal of Symbolic Logic, Vol. 35, Iss. 1, 1970-03 ,pp. :
Maximal Degrees for Young Diagrams in the (k,l) Hook
By Regev A.
European Journal of Combinatorics, Vol. 19, Iss. 6, 1998-08 ,pp. :
The Journal of Symbolic Logic, Vol. 43, Iss. 3, 1978-09 ,pp. :