Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy1

Publisher: Cambridge University Press

E-ISSN: 1943-5886|46|4|753-760

ISSN: 0022-4812

Source: The Journal of Symbolic Logic, Vol.46, Iss.4, 1981-12, pp. : 753-760

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract