2023/08/28 by James Barnes, Barnes, James S., Jun Le Goh +3
Computer Science · #03B30 (Primary) 03D80 #03D55 #03F35 #05C38 #05C63 #05C69 #05C70 (Secondary) #Cellular Automata and Applications #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2308.14287
openalex publication_date 2023/08/28 · openalex created_date 2023/08/31 · openalex updated_date 2026/07/28
Halin [1965] proved that if a graph has n many pairwise disjoint rays for each n then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other similar results in terms of computable and proof theoretic complexity. The statement of Halin's theorem and the construction proving it seem very much like standard versions of compactness arguments such as König's Lemma. Those results, while not computable, are relatively simple. They only use arithmetic procedures or, equivalently, finitely many iterations of the Turing jump. We show that several Halin type theorems are much more complicated. They are among the theorems of hyperarithmetic analysis. Such theorems imply the ability to iterate the Turing jump along any computable well ordering. Several important logical principles in this class have been extensively studied beginning with work of Kreisel, H. Friedman, Steel and others in the 1960s and 1970s. Until now, only one purely mathematical example was known. Our work provides many more and so answers Question 30 of Montalbán's Open Questions in Reverse Mathematics [2011]. Some of these theorems including ones in Halin [1965] are also shown to have unusual proof theoretic strength as well.