Abstract: The decidability of the two quantifier theory of the hyperarithmetic degrees below Kleene’s O 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.
Keywords: Recursion theory, hyperarithmetic theory
DOI: 10.3233/COM-210308
Journal: Computability, vol. 10, no. 4, pp. 305-325, 2021