paper

The theory of as an uppersemilattice with least and greatest element is decidable

arXiv:1704.06347

Abstract

We establish the decidability of the theory of , the hyperarithmetic degrees below Kleene's , in the language of uppersemilattices with least and greatest element. This requires a new kind of initial-segment result and a new extension of embeddings result both in the hyperarithmetic setting.