Publisher： Cambridge University Press
E-ISSN： 1943-5886|47|2|241-248
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.47, Iss.2, 1982-06, pp. : 241-248
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
Degrees of unsolvability of constructible sets of integers
The Journal of Symbolic Logic, Vol. 33, Iss. 4, 1969-01 ,pp. :
Access to resources
Recommend
Busy beaver sets and the degrees of unsolvability
The Journal of Symbolic Logic, Vol. 46, Iss. 3, 1981-09 ,pp. :
A discrete chain of degrees of index sets
The Journal of Symbolic Logic, Vol. 37, Iss. 1, 1972-03 ,pp. :
A criterion for completeness of degrees of unsolvability
The Journal of Symbolic Logic, Vol. 22, Iss. 2, 1957-06 ,pp. :
On degrees of unsolvability and complexity properties
The Journal of Symbolic Logic, Vol. 40, Iss. 4, 1975-12 ,pp. :