Skip to main content
Conference Proceedings

The first order theories of the Medvedev and Muchnik lattices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5635 LNCS 324-331
DOI: 10.1007/978-3-642-03073-4_33
3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that the first order theories of the Medevdev lattice and the Muchnik lattice are both computably isomorphic to the third order theory of the natural numbers. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Lewis, A., Nies, A., & Sorbi, A. (2009). The first order theories of the Medvedev and Muchnik lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5635 LNCS, pp. 324–331). https://doi.org/10.1007/978-3-642-03073-4_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free