Publisher： Cambridge University Press
E-ISSN： 1943-5886|28|1|35-42
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.28, Iss.1, 1963-03, pp. : 35-42
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
The Journal of Symbolic Logic, Vol. 28, Iss. 2, 1963-06 ,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. :
Many-one degrees associated with problems of tag
The Journal of Symbolic Logic, Vol. 38, Iss. 1, 1973-03 ,pp. :
A note on the reducibility of binary affine polynomials
Designs, Codes and Cryptography, Vol. 57, Iss. 1, 2010-10 ,pp. :