Some independence results related to finite trees

Source abstract

We investigate some concrete independence results for systems of reverse mathematics which emerge from monotonicity properties of number-theoretic functions. Natural properties of the less than or equal to relation with respect to sums of natural numbers lead to independence results for first-order Peano arithmetic. Natural properties of the less than or equal to relation with respect to sums and products of natural numbers lead to independence results for arithmetical transfinite recursion. By considering number-theoretic functions of arbitrary arities, we obtain independence results for systems beyond arithmetical transfinite recursion. We discuss how these embeddability relations are related to tree embeddability relations and we consider variants where the tree embeddability relation is not assumed to preserve infima. The findings of this paper are complementary to results on Kruskal-like theorems proved earlier by the first author. This article is part of the theme issue ‘Modern perspectives in Proof Theory’.