The Σ 2 theory of D h ( ⩽ h O ) as an uppersemilattice with least and greatest element is decidable

DOI10.3233/COM-210308MaRDI QIDQ5037208

No author found.

Publication date: 28 February 2022

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.06347

zbMATH Keywords

recursion theoryhyperarithmetic theory

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Cites Work

• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• Decidability and Invariant Classes for Degree Structures
• ON THE DECIDABILITY OF THE THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES
• Lattice initial segments of the hyperdegrees
• On the Σ₂-theory of the upper semilattice of Turing degrees