A random set which only computes strongly jump-traceable c.e. sets

E-ISSN： 1943-5886|76|2|700-718

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.76, Iss.2, 2011-06, pp. : 700-718

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

On the convergence of query-bounded computations and logical closure properties of c.e. sets

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

Cambridge University Press

Access to resources Recommend Favorite

A high c.e. degree which is not the join of two minimal degrees

The Journal of Symbolic Logic, Vol. 75, Iss. 4, 2010-12 ,pp. : 1339-1358

Cambridge University Press

Access to resources Recommend Favorite

Splitting and nonsplitting, II: A low₂ c.e. degree above which 0′ is not splittable

The Journal of Symbolic Logic, Vol. 67, Iss. 4, 2002-12 ,pp. : 1391-1430

Cambridge University Press

Access to resources Recommend Favorite

DMP in strongly minimal sets

The Journal of Symbolic Logic, Vol. 72, Iss. 3, 2007-09 ,pp. : 1019-1030

Cambridge University Press

Access to resources Recommend Favorite

On strongly minimal sets

The Journal of Symbolic Logic, Vol. 36, Iss. 1, 1971-03 ,pp. : 79-96

Cambridge University Press

Access to resources Recommend Favorite