Hilbert versus Hindman
It is well known that Hindman's theorem can (equivalently) be formulated in the following finite union form: Let \(f: \mathbb{N^{<N}} \to k\) be a finite coloring of the finite subsets of \(\mathbb{N}\). Then there exists an infinite sequence of finite subsets \((X_i)_{i\in\mathbb{N}}\) such that the sets \(X_i\) are unmeshed, i.e., for all \(i,j\) either \(\max(X_i) < \min(X_{j})\) or \(\max(X_j) < \min(X_i)\), and that there is a \(c\) such that for all finite sets \(F\) we have \(f(\bigcup_{i\in F} X_i) = c\). In this paper the author considers the variant of this theorem where `unmeshed' is relaxed to `distinct'. He shows that this variant is equivalent to the infinite pigeonhole principle and thus to the \(\Pi^0_1\)-bounded collection principle (\(\mathrm{B}\Pi^0_1\)). This shows that this variant of Hindman's theorem is finitistic in the sense of Hilbert, while Hindman's theorem is not.
- Hilbert
- HILBERT'S PROBLEMS
- scientific article; zbMATH DE number 2211754
- scientific article; zbMATH DE number 5575850
- scientific article; zbMATH DE number 6321725
- Hilbert and Einstein
- Hilbert and the internal logic of mathematics
- scientific article; zbMATH DE number 2074307
- scientific article; zbMATH DE number 2216773
- A weak variant of Hindman's theorem stronger than Hilbert's theorem
- New bounds on the strength of some restrictions of Hindman's theorem
- Restrictions of Hindman's theorem: an overview
- Hindman's theorem for sums along the full binary tree, ^0_2-induction and the pigeonhole principle for trees
- Is there a symmetric version of Hindman's theorem?
- Belated Decision in the Hilbert-Einstein Priority Dispute
- Linear extensions of partial orders and reverse mathematics
- ``Weak yet strong restrictions of Hindman's finite sums theorem
- scientific article; zbMATH DE number 6321725 (Why is no real title available?)
- A recursive coloring function without _3⁰ solutions for Hindman's theorem
This page was built for publication: Hilbert versus Hindman
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q661295)
