Degree theoretic definitions of the low2 recursively enumerable sets

DOI10.2307/2275754MaRDI QIDQ4858813zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The density of the low\(_ 2\) \(n\)-r.e. degrees
• Publication:3491535
• Infima of recursively enumerable truth table degrees
• Working below a \(low_ 2\) recursively enumerable degree
• A Refinement of Lown and Highn for the R.E. Degrees

Cites work

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

Cited in

(13)

• Hierarchy of Computably Enumerable Degrees II
• A Refinement of Lown and Highn for the R.E. Degrees
• scientific article; zbMATH DE number 1507242 (Why is no real title available?)
• Classes bounded by incomplete sets
• Splitting theorems in recursion theory
• Low sets without subsets of higher many-one degree
• Working below a \(low_ 2\) recursively enumerable degree
• A hierarchy of computably enumerable degrees
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
• Nonbounding and Slaman triples
• Embeddings of \(N_5\) and the contiguous degrees
• ON SUPERSETS OF NON-LOW SETS

This page was built for publication: Degree theoretic definitions of the low₂ recursively enumerable sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4858813)