2019/01/29 by Peter Cholak, Damir D. Dzhafarov, Cholak, Peter A. +5
Computer Science · Mathematics · #Benford’s Law and Fraud Detection #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1901.10326
openalex publication_date 2019/01/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The SRT22 vs. COH problem is a central problem in computable combinatorics and reverse mathematics, asking whether every Turing ideal that satisfies the principle SRT22 also satisfies the principle COH. This paper is a contribution towards further developing some of the main techniques involved in attacking this problem. We study several principles related to each of SRT22 and COH, and prove results that highlight the limits of our current understanding, but also point to new directions ripe for further exploration.