RECORD
Halin's Infinite Ray Theorems: Complexity and Reverse Mathematics: Version E
Logic · Submitted 28 Aug 2023
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We show that several Halin type theorems are much more complicated.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
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\"{o}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\'{a}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.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Halin [1965] proved that if a graph has $n$ many pairwise disjoint rays for each $n$ then it has infinitely many pairwise disjoint rays. | background 1.00 | 0.02 | 0.05 | asserted 1.00 |
| s1 | We analyze the complexity of this and other similar results in terms of computable and proof theoretic complexity. | contribution 0.96 | 0.92 | 0.06 | asserted 0.96 |
| s2 | The statement of Halin's theorem and the construction proving it seem very much like standard versions of compactness arguments such as K\"{o}nig's Lemma. | background 0.56 | 0.25 | 0.04 | hedged possibility 0.74 |
| s3 | Those results, while not computable, are relatively simple. | background 0.44 | 0.25 | 0.04 | asserted 1.00 |
| s4 | They only use arithmetic procedures or, equivalently, finitely many iterations of the Turing jump. | background 0.51 | 0.20 | 0.04 | asserted 1.00 |
| s5 | We show that several Halin type theorems are much more complicated. | result 0.79 | 0.90 | 0.36 | asserted 1.00 |
| s6 | They are among the theorems of hyperarithmetic analysis. | result 0.95 | 0.67 | 0.24 | asserted 1.00 |
| s7 | Such theorems imply the ability to iterate the Turing jump along any computable well ordering. | interpretation 0.74 | 0.39 | 0.15 | asserted 1.00 |
| s8 | Several important logical principles in this class have been extensively studied beginning with work of Kreisel, H. | background 1.00 | 0.04 | 0.04 | asserted 1.00 |
| s9 | Friedman, Steel and others in the 1960s and 1970s. | background 1.00 | 0.03 | 0.03 | asserted 0.80 |
| s10 | Until now, only one purely mathematical example was known. | gap 0.99 | 0.06 | 0.05 | asserted 1.00 |
| s11 | Our work provides many more and so answers Question 30 of Montalb\'{a}n's Open Questions in Reverse Mathematics [2011]. | contribution 0.71 | 0.94 | 0.35 | asserted 1.00 |
| s12 | Some of these theorems including ones in Halin [1965] are also shown to have unusual proof theoretic strength as well. | result 0.94 | 0.93 | 0.18 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
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\"{o}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\'{a}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.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.