Abstract
The uniform Kruskal theorem extends the original result for trees to general recursive data types. As shown by Freund, Rathjen and Weiermann(Freund, Rathjen, Weiermann 2022 Adv. Math. 400, 108265 (doi:10.1016/j.aim.2022.108265)), it is equivalent to [Formula: see text]-comprehension, over [Formula: see text] with the ascending descending sequence principle ([Formula: see text]). This result provides a connection between finite combinatorics and abstract set existence. The present article sheds further light on this connection. Firstly, we show that the original Kruskal theorem is equivalent to the uniform version for data types that are finitely generated. Secondly, we prove a dichotomy result for a natural variant of the uniform Kruskal theorem. On the one hand, this variant still implies [Formula: see text]-comprehension over [Formula: see text] extended by the chain antichainprinciple ([Formula: see text]). On the other hand, it becomes weak when [Formula: see text] is removed from the base theory. This article is part of the theme issue 'Modern perspectives in Proof Theory'.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.