Busy beaver sets and the degrees of unsolvability1

Publisher： Cambridge University Press

E-ISSN： 1943-5886|46|3|460-474

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.46, Iss.3, 1981-09, pp. : 460-474

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

Related content

Index sets and degrees of unsolvability

By  

The Journal of Symbolic Logic, Vol. 47, Iss. 2, 1982-06 ,pp. : 241-248

Cambridge University Press

Access to resources Recommend Favorite

Degrees of unsolvability of constructible sets of integers

By  

The Journal of Symbolic Logic, Vol. 33, Iss. 4, 1969-01 ,pp. : 497-513

Cambridge University Press

Access to resources Recommend Favorite

On the notational independence of various hierarchies of degrees of unsolvability1

By  

The Journal of Symbolic Logic, Vol. 30, Iss. 1, 1965-03 ,pp. : 69-86

Cambridge University Press

Access to resources Recommend Favorite

The degrees of hyperhyperimmune sets1

By  

The Journal of Symbolic Logic, Vol. 34, Iss. 3, 1969-11 ,pp. : 489-493

Cambridge University Press

Access to resources Recommend Favorite

Some nondistributive lattices as initial segments of the degrees of unsolvability 1

By  

The Journal of Symbolic Logic, Vol. 34, Iss. 1, 1969-05 ,pp. : 85-98

Cambridge University Press

Access to resources Recommend Favorite