Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Lattice embeddings and array noncomputable degrees

From MaRDI portal
Publication:4736749
Jump to:navigation, search

DOI10.1002/MALQ.200310092zbMath1054.03030OpenAlexW2074244968MaRDI QIDQ4736749

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

lattice embeddingcomputably enumerable degreearray noncomputable degree


Mathematics Subject Classification ID

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








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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4736749&oldid=18995960"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 21:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki