Abstract
We have now shown that every non-zero degree below deg wtt (G) coincides with deg(G ρ) for some ρ ε Πn. Since all of the positive requirements have been satisfied, we see that the lattice Πn has been embedded as an initial segment of the Δ 02 wtt-degrees above a minimal degree. In fact the embedding is in the wtt-degrees ≤wtt 0′. To see that this is true, we need only check that there is a recursive function b(x) such that |{s:G s+1(x)≠G s (x)}|≤b(x). But this is the case because of the nesting of the trees. Only action taken for the sake of satisfying P 0 can change G s (0). This can happen at most twice. The only possible actions which can change G(x) are taken for the sake of satisfying some P e where e ≤ x, or improving the e-state of some T e,s (σ), where e+|σ|≤x. A simple induction shows that this is bounded by (2+n+|E n |+2)2 x+1 −1.
The authors' research was supported by NSF grants DMS-8705818 and DMS-8601048, respectively and MSRI. In addition, Shore was supported by a grant from the U.S.-Israel Bi-national Science Foundation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Burris, S. and Sankappanavar, A.P., Lattice theoretic decision problems in universal algebra, Algebra Univ. 5 (1975), 163–177.
Degtev, A., On truth-table-like reducibilities in the theory of algorithms, Usp. Mat. Nauk 34 (1979), 137–168, 248 (Russian); Russ. Math. Surv. 34, 155–192 (English translation).
Fejer, P. and Shore, R., Minimal tt-and wtt-degrees, in this volume.
Haught, C. A. and Shore, R., Undecidability and initial segments of the r.e. tt-degrees, to appear in Journal of Symbolic Logic.
Odifreddi, P., Strong reducibilities, Bull. Amer. Math. Soc. (N.S.) 4 (1981), 37–86.
Odifreddi, P., “Classical Recursion Theory,” North-Holland, Amsterdam, New York, Oxford, 1989.
Rogers, H., “Theory of Recursive Functions and Effective Computability,” McGraw-Hill, New York, 1967.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag
About this paper
Cite this paper
Haught, C.A., Shore, R.A. (1990). Undecidability and initial segments of the wtt-degrees ≤0′. In: Ambos-Spies, K., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0086120
Download citation
DOI: https://doi.org/10.1007/BFb0086120
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52772-5
Online ISBN: 978-3-540-47142-4
eBook Packages: Springer Book Archive