Lattice initial segments of the hyperdegrees

DOI10.2178/jsl/1264433911zbMath1194.03036arXiv1408.3147OpenAlexW2098010377MaRDI QIDQ5190191

Richard A. Shore, Bjørn Kjos-Hanssen

Publication date: 15 March 2010

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

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

zbMATH Keywords

initial segmenthyperdegreesfusion lemmahyperarithmetic lattice

Mathematics Subject Classification ID

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

Related Items (2)

The Σ 2 theory of D h ( ⩽ h O ) as an uppersemilattice with least and greatest element is decidable ⋮ ON THE DECIDABILITY OF THE THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• Lattices of c-degrees
• Initial segments of the degrees of constructibility
• Initial segments of the degrees of size \(\aleph _ 1\)
• Initial segments of the degrees of unsolvability
• The upper semi-lattice of degrees of recursive unsolvability
• On Sequences of Degrees of Constructibility (Solution of Friedman'S Problem 75)
• THE FIRST‐ORDER THEORY OF THE c‐DEGREES
• Forcing and reductibilities. II. Forcing in fragments of analysis
• Local Initial Segments of The Turing Degrees
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
• Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond
• Degrees of Unsolvability. (AM-55)
• A Note on Non-Distributive Sublattices of Degrees and Hyperdegrees
• Distributive Initial Segments of the Degrees of Unsolvability
• On the representation of lattices

This page was built for publication: Lattice initial segments of the hyperdegrees