Degree theoretic definitions of the low2 recursively enumerable sets

DOI10.2307/2275754zbMath0841.03024OpenAlexW2082255271MaRDI QIDQ4858813

Richard A. Shore, Rodney G. Downey

Publication date: 16 July 1996

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275754

zbMATH Keywords

recursively enumerable setstruth-table degrees\(\text{low}_ 2\) degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ Nonbounding and Slaman triples ⋮ TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ Embeddings of \(N_5\) and the contiguous degrees ⋮ Hierarchy of Computably Enumerable Degrees II ⋮ ON SUPERSETS OF NON-LOW SETS ⋮ Splitting theorems in recursion theory ⋮ Classes bounded by incomplete sets

Cites Work

• Unnamed Item
• Working below a \(low_ 2\) recursively enumerable degree
• Lattice nonembeddings and initial segments of the recursively enumerable degrees
• Completely mitotic r. e. degrees
• Three theorems on tt-degrees
• tt- and m-degrees
• ON $tt$-DEGREES OF RECURSIVELY ENUMERABLE TURING DEGREES
• Strong reducibilities
• Reducibility orderings: Theories, definability and automorphisms
• Minimal degrees and the jump operator
• On the Structure of Polynomial Time Reducibility
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Degrees of recursively enumerable sets which have no maximal supersets
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Class groups of integral group rings