Part of the Lecture Notes in Computer Science book series (LNCS, volume 5635)
The First Order Theories of the Medvedev and Muchnik Lattices
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.
KeywordsOrder Variable Logical System Atomic Formula Order Theory Mass Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 10.Sorbi, A.: The Medvedev lattice of degrees of difficulty. In: Cooper, S.B., Slaman, T.A., Wainer, S.S. (eds.) Computability, Enumerability, Unsolvability - Directions in Recursion theory. London Mathematical Society Lecture Notes Series, pp. 289–312. Cambridge University Press, New York (1996)CrossRefGoogle Scholar
© Springer-Verlag Berlin Heidelberg 2009