Part of the Lecture Notes in Computer Science book series (LNCS, volume 713)
Interpreting true arithmetic in degree structures
A survey of the techniques which lead to an interpretation of true arithmetic in the theories of the recursively enumerable many-one, truth-table and Turing degrees is given.
Unable to display preview. Download preview PDF.
- [Ambos-Spies, Nies, Shore92]K. Ambos-Spies, A. Nies, R. Shore. The theory of the r.e. weak truth-table degrees is undecidable. J. Symb. Logic, vol. 57, no. 3, Sept 1992, 864–874.Google Scholar
- [Nies 92]A. Nies. Definability and Undecidability in Recursion Theoretic Semilattices. Ph.D. thesis, Universität Heidelberg, 1992.Google Scholar
- [Nies ta]A. Nies. The last question on recursively enumerable many-one degrees. Submitted.Google Scholar
- [Nies,Shore ta1]A. Nies, R. Shore. Interpreting arithmetic in the theory of the r.e. truth table degrees. Submitted.Google Scholar
- [Nies.Shore ta2]A. Nies, R. Shore. Interpreting true arithmetic in the theory of the tt-and wtt-degrees below Ø'. In preparation.Google Scholar
- [Shore 81]The theory of the degrees below Ø'. J. London Math. Soc (2), 24 (1981), 1–14.Google Scholar
- [Slaman, Shinoda 89]T. Slaman, J. Shinoda. On the theory of the PTIME degrees of the recursive sets (abstract). Structure in Compl. Theory 4th conference, IEEE Comput. SocPress, 1989.Google Scholar
- [Slaman.Woodin, ta]T. Slaman, W. Woodin. Definability in degree structures.Google Scholar
© Springer-Verlag Berlin Heidelberg 1993