The decidability of the two quantifier theory of the hyperarithmetic degrees below Kleene’s in the language of uppersemilattices with least and greatest element is established. This requires a new kind of initial segment result and a new extension of embeddings result both in the hyperarithmetic setting.
J.S.Barnes, On the decidability of the -theories of the arithmetic and hyperarithmetic degrees as uppersemilattices, The Journal of Symbolic Logic, Forthcoming.
2.
L.A.Harrington, R.A.Shore and T.A.Slaman, in every real in a class of reals is , Computability and Complexity, A. Day, M. Fellows, N. Greenberg, B. Khoussainov and A. Melnikov, eds, Springer-Verlag, to appear.
3.
C.G.Jockusch and T.A.Slaman, On the Σ2-theory of the upper semilattice of Turing degrees, in: The Journal of Symbolic Logic, Vol. 58, Association for Symbolic Logic, 1993.
4.
B.Kjos-Hanssen and R.A.Shore, Lattice initial segments of the hyperdegrees, in: Journal of Symbolic Logic, Vol. 75, Association for Symbolic Logic, 2010.
5.
M.Lerman, Degrees of unsolvability, in: Perspectives in Mathematical Logic, Omega Series, Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, 1983.
6.
M.Lerman and R.A.Shore, Decidability and invariant classes for degree structures, in: Transactions of the American Mathematical Society, Vol. 310, AMS, 1988.
