Degree theoretic definitions of the low2 recursively enumerable sets

DOI10.2307/2275754zbMATH Open0841.03024OpenAlexW2082255271MaRDI QIDQ4858813FDOQ4858813

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

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

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)

Cites Work

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

Cited In (13)

• A Refinement of Lown and Highn for the R.E. Degrees
• Title not available (Why is that?)
• Classes bounded by incomplete sets
• Splitting theorems in recursion theory
• Low sets without subsets of higher many-one degree
• A hierarchy of computably enumerable degrees
• Working below a \(low_ 2\) recursively enumerable degree
• 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
• Hierarchy of Computably Enumerable Degrees II

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)