Contrasting the Halves of an Ahmad Pair
Karthik Ravishankar

TL;DR
This paper characterizes the degrees forming halves of Ahmad pairs within the $ olinebreak oldsymbol{ ext{Sigma}}^0_2$ enumeration degrees, revealing a hierarchy of join irreducibility and separating the properties of the pair's halves.
Contribution
It introduces a hierarchy of join irreducibility notions to characterize the halves of Ahmad pairs and extends previous work to distinguish between different levels of Ahmad n-pairs.
Findings
Left halves are $ ext{low}_2$ and join-irreducible.
Right halves are $ ext{high}_2$, establishing a separation.
Existence of sets that are left halves of Ahmad n-pairs but not of Ahmad (n+1)-pairs.
Abstract
We study Ahmad pairs in the enumeration degrees. is an Ahmad pair if and every satisfies . We characterize the degrees that are the left halves of an Ahmad pair as those that are and join irreducible. We then show that the right half has to be giving a natural separation between the two halves which is a significant strengthening of previous work. We define a hierarchy of join irreducibility notions using which we characterize the left halves of Ahmad -pairs as those that are and -join irreducible, while the right halves are . This allows us to extend and clarify previous work to show that for any , there is a set which is the left half of an Ahmad -pair but not of an Ahmad -pair. These results have new implications about the -theory of the …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · semigroups and automata theory
