Working below a \(low_ 2\) recursively enumerable degree

DOI10.1007/BF01621095zbMath0693.03027MaRDI QIDQ584251

Theodore A. Slaman, Richard A. Shore

Publication date: 1990

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

\(low_ 2\) degreesembedding of a partial orderjump classes of r.e. Turing degreeslow degreesRobinson's splitting theorem

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25)

Related Items

Decomposition and infima in the computably enumerable degrees ⋮ Working below a high recursively enumerable degree ⋮ The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable ⋮ Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ Nonbounding and Slaman triples ⋮ Degree theoretic definitions of the low₂ recursively enumerable sets ⋮ On strongly jump traceable reals ⋮ On the number of infinite sequences with trivial initial segment complexity ⋮ On Lachlan's major sub-degree problem ⋮ Working below a \(low_ 2\) recursively enumerable degree ⋮ Turing computability: structural theory ⋮ Elementary differences among jump classes ⋮ Splitting and nonsplitting, II: A low₂ c.e. degree above which 0′ is not splittable ⋮ Definability in the Recursively Enumerable Degrees ⋮ The existence of high nonbounding degrees in the difference hierarchy ⋮ Splitting theorems in recursion theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Working below a \(low_ 2\) recursively enumerable degree
• Jump restricted interpolation in the recursively enumerable degrees
• Defining Jump Classes in the Degrees Below 0'
• Decomposition of Recursively Enumerable Degrees
• The weak truth table degrees of recursively enumerable sets