ON THE DECIDABILITY OF THE THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES

DOI10.1017/jsl.2017.51zbMath1391.03031arXiv1606.07392OpenAlexW2963134242MaRDI QIDQ4600467

James S. Barnes

Publication date: 11 January 2018

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

degree theoryrecursion theoryarithmetic degreeshyperarithmetic degreesKumabe-Slaman forcing

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Computable structures and the hyperarithmetical hierarchy
• Defining the Turing jump
• Forcing and reducibilities
• Lattice initial segments of the hyperdegrees
• On the Σ₂-theory of the upper semilattice of Turing degrees

This page was built for publication: ON THE DECIDABILITY OF THE THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES