A characterization of the 0-basis homogeneous bounding degrees

Publisher： Cambridge University Press

E-ISSN： 1943-5886|75|3|971-995

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.75, Iss.3, 2010-09, pp. : 971-995

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

Bounding nonsplitting enumeration degrees

By  

The Journal of Symbolic Logic, Vol. 72, Iss. 4, 2007-12 ,pp. : 1405-1417

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

Bounding the Derived Length for a Given Set of Character Degrees

By Aziziheris Kamal  

Algebras and Representation Theory, Vol. 14, Iss. 5, 2011-10 ,pp. : 949-958

Springer Publishing Company

Access to resources Recommend Favorite

Bounding and nonbounding minimal pairs in the enumeration degrees

By  

The Journal of Symbolic Logic, Vol. 70, Iss. 3, 2005-09 ,pp. : 741-766

Cambridge University Press

Access to resources Recommend Favorite

DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES

By  

The Journal of Symbolic Logic, Vol. 82, Iss. 3, 2017-05 ,pp. : 931-957

Cambridge University Press

Access to resources Recommend Favorite