Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy

Author： Faizrahmanov M.Kh.  

Publisher： Springer Publishing Company

ISSN： 0037-4466

Source： Siberian Mathematical Journal, Vol.51, Iss.6, 2010-11, pp. : 1135-1138

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

Asymptotic density and the Ershov hierarchy

By  

MLQ- MATHEMATICAL LOGIC QUARTERLY, Vol. 61, Iss. 3, 2015-05 ,pp. : 189-195

John Wiley & Sons Inc

Access to resources Recommend Favorite

Computable Solutions of Equations over Endomorphisms of Negative Numberings

By Combarro E.F.  

Siberian Mathematical Journal, Vol. 44, Iss. 5, 2003-09 ,pp. : 821-828

Springer Publishing Company

Access to resources Recommend Favorite

On a Hierarchy of Groups of Computable Automorphisms

By Morozov A.S.   Buzykaeva A.N.  

Siberian Mathematical Journal, Vol. 43, Iss. 1, 2002-01 ,pp. : 124-127

Springer Publishing Company

Access to resources Recommend Favorite

Minimal Coverings in the Rogers Semilattices of Sigma ^0_n-Computable Numberings

By Badaev S.A.   Podzorov S.Y.  

Siberian Mathematical Journal, Vol. 43, Iss. 4, 2002-07 ,pp. : 616-622

Springer Publishing Company

Access to resources Recommend Favorite

Computable Families of Superatomic Boolean Algebras

By Alaev P.E.  

Siberian Mathematical Journal, Vol. 44, Iss. 4, 2003-07 ,pp. : 561-567

Springer Publishing Company

Access to resources Recommend Favorite