Lattice embeddings and array noncomputable degrees

DOI10.1002/MALQ.200310092MaRDI QIDQ4736749zbMATH OpenOpenAlexFDO

Authors Stephen M. Walk

Publication date 6 August 2004

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200310092

zbMATH Keywords

array noncomputable degreecomputably enumerable degreelattice embedding

Mathematics Subject Classification ID

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

Recommendations

• Lattice embeddings into the recursively enumerable degrees
• Array nonrecursive degrees and lattice embeddings of the diamond
• Embedding finite lattices into the computably enumerable degrees -- a status survey
• Lattice embeddings into the recursively enumerable degrees. II
• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
• Lattice Embeddings into the R.E. Degrees Preserving 0 and 1
• Lattice embedding into d-r. e. degrees preserving 0 and 1
• Publication:4934976
• Lattice nonembeddings and intervals of the recursively enumerable degrees
• Lattice Embeddings in the Recursively Enumerable Truth Table Degrees

Cited in

(5)

• Array nonrecursive degrees and lattice embeddings of the diamond
• Lattice nonembeddings and intervals of the recursively enumerable degrees
• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
• Lattice embeddings into the recursively enumerable degrees
• Nonlowness is independent from fickleness

This page was built for publication: Lattice embeddings and array noncomputable degrees

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