Publisher： Cambridge University Press
E-ISSN： 1943-5886|36|2|301-304
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.36, Iss.2, 1971-06, pp. : 301-304
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
Minimal upper bounds for arithmetical degrees
The Journal of Symbolic Logic, Vol. 59, Iss. 2, 1994-06 ,pp. :
Access to resources
Recommend
The natural hierarchy and quasi-hierarchy of constructibility degrees
The Journal of Symbolic Logic, Vol. 51, Iss. 1, 1986-03 ,pp. :
Nonhemimaximal degrees and the high/low hierarchy
The Journal of Symbolic Logic, Vol. 77, Iss. 2, 2012-06 ,pp. :
A hierarchy for the plus cupping Turing degrees
The Journal of Symbolic Logic, Vol. 68, Iss. 3, 2003-09 ,pp. :
Herbrand consistency of some arithmetical theories
The Journal of Symbolic Logic, Vol. 77, Iss. 3, 2012-09 ,pp. :