Array nonrecursive degrees and lattice embeddings of the diamond

zbMATH Open0806.03030MaRDI QIDQ1320968FDOQ1320968

Rodney G. Downey

Publication date: 16 February 1995

Published in: Illinois Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

lattice embeddingrecursively enumerable degreesarray nonrecursive degrees\(\Delta_ 2\) degreestops of diamonds

Mathematics Subject Classification ID

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

Cited In (8)

• Splitting theorems in recursion theory
• Lattice embeddings and array noncomputable degrees
• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
• Embeddings of \(N_5\) and the contiguous degrees
• Diamond embeddings into the enumeration degrees
• Nonlowness is independent from fickleness
• Lattice nonembeddings and intervals of the recursively enumerable degrees
• Dynamic notions of genericity and array noncomputability

This page was built for publication: Array nonrecursive degrees and lattice embeddings of the diamond

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