On the Hausdorff dimension of maximal chains and antichains of Turing and Hyperarithmetic degrees
Abstract
This paper investigates the Hausdorff dimension properties of chains and antichains in Turing degrees and hyperarithmetic degrees. Our main contributions are threefold: First, for antichains in hyperarithmetic degrees, we prove that every maximal antichain necessarily attains Hausdorff dimension 1. Second, regarding chains in Turing degrees, we establish the existence of a maximal chain with Hausdorff dimension 0. Furthermore, under the assumption that ω1=(ω1)L, we demonstrate the existence of such maximal chains with 11 complexity. Third, we extend our investigation to maximal antichains of Turing degrees by analyzing both the packing dimension and effective Hausdorff dimension.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.