The \Sigma₂ theory of \mathscr{D}_h(\leq_h \mathcal{O}) as an uppersemilattice with least and greatest element is decidable

DOI10.3233/COM-210308MaRDI QIDQ6285765arXivFDO

Publication date 20 April 2017

Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30)

Abstract: We establish the decidability of the

S i g m a_{2}

theory of

m a t h s c r D_{h} (l e q_{h} m a t h c a l O)

, the hyperarithmetic degrees below Kleene's

m a t h c a l O

, 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.

This page was built for publication: The $\Sigma_2$ theory of $\mathscr{D}_h(\leq_h \mathcal{O})$ as an uppersemilattice with least and greatest element is decidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6285765)