The computably enumerable degrees are locally non-cappable

Author： Giorgi Matthew B.  

Publisher： Springer Publishing Company

ISSN： 0933-5846

Source： Archive for Mathematical Logic, Vol.43, Iss.1, 2004-01, pp. : 121-139

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

Decomposition and infima in the computably enumerable degrees

By  

The Journal of Symbolic Logic, Vol. 68, Iss. 2, 2003-06 ,pp. : 551-579

Cambridge University Press

Access to resources Recommend Favorite

Bounding minimal degrees by computably enumerable degrees

By  

The Journal of Symbolic Logic, Vol. 63, Iss. 4, 1998-12 ,pp. : 1319-1347

Cambridge University Press

Access to resources Recommend Favorite

Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees

By Ambos-Spies Klaus  

Theory of Computing Systems, Vol. 52, Iss. 1, 2013-01 ,pp. : 2-27

Springer Publishing Company

Access to resources Recommend Favorite

Embedding finite lattices into the ideals of computably enumerable turing degrees

By  

The Journal of Symbolic Logic, Vol. 66, Iss. 4, 2001-12 ,pp. : 1791-1802

Cambridge University Press

Access to resources Recommend Favorite

A jump class of noncappable degrees

By  

The Journal of Symbolic Logic, Vol. 54, Iss. 2, 1989-06 ,pp. : 324-353

Cambridge University Press

Access to resources Recommend Favorite