scientific article; zbMATH DE number 1523417

DOI<409::AID-MALQ409>3.0.CO;2-P 10.1002/1521-3870(200008)46:3<409::AID-MALQ409>3.0.CO;2-PzbMath0967.03037MaRDI QIDQ4511553

S. Barry Cooper, Marat M. Arslanov, Ang Sheng Li

Publication date: 15 March 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

splittinglow setcomputably enumerable set\(n\)-c.e. degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items

Elementary theories and structural properties of d-c.e. and n-c.e. degrees ⋮ A Survey of Results on the d-c.e. and n-c.e. Degrees ⋮ Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy ⋮ Isolated maximal d.r.e. degrees ⋮ There are no maximal low d.c.e. degrees ⋮ Turing computability: structural theory ⋮ 2004 Annual Meeting of the Association for Symbolic Logic ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy ⋮ Splitting and nonsplitting, II: A low₂ c.e. degree above which 0′ is not splittable