DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES

Publisher： Cambridge University Press

E-ISSN： 1943-5886|82|3|931-957

ISSN： 0022-4812

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

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

THE GENERIC DEGREES OF DENSITY-1 SETS, AND A CHARACTERIZATION OF THE HYPERARITHMETIC REALS

By  

The Journal of Symbolic Logic, Vol. 80, Iss. 4, 2015-12 ,pp. : 1290-1314

Cambridge University Press

Access to resources Recommend Favorite

Bounding the L1 Distance in Nonparametric Density Estimation

By Kundu S.   Martinsek A.T.  

Annals of the Institute of Statistical Mathematics, Vol. 49, Iss. 1, 1997-03 ,pp. : 57-78

Springer Publishing Company

Access to resources Recommend Favorite

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

The degrees below a 1-generic degree < 0′

By  

The Journal of Symbolic Logic, Vol. 51, Iss. 3, 1986-09 ,pp. : 770-777

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