Embedding lattices in the Kleene degrees
Fundamenta Mathematicae (1999)
- Volume: 162, Issue: 1, page 47-64
- ISSN: 0016-2736
Access Full Article
topAbstract
topHow to cite
topReferences
top- [1] K. J. Devlin, Constructibility, Springer, 1984.
- [2] K. Hrbáček, On the complexity of analytic sets, Z. Math. Logik Grundlag. Math. 24 (1978), 419-425. Zbl0411.03040
- [3] M. Lerman, Degrees of Unsolvability, Springer, 1983.
- [4] H. Muraki, Local density of Kleene degrees, Math. Logic Quart. 43 (1995), 183-189. Zbl0820.03030
- [5] H. Muraki, Non-distributive upper semilattice of Kleene degrees, J. Symbolic Logic 64 (1999), 147-158. Zbl0926.03048
- [6] R. A. Shore and T. A. Slaman, The p-T degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory, Theoret. Comput. Sci. 97 (1992), 263-284. Zbl0774.03028
- [7] R. Solovay, Determinacy and type 2 recursion (abstract), J. Symbolic Logic 36 (1971), 374.
- [8] G. Weitkamp, Kleene recursion over the continuum, Ph.D. Thesis, Pennsylvania State Univ., 1980.