A particularly well suited induction hypothesis is employed to give a short and relatively direct formulation of van der Waerden's argument which establishes that for any partition of the natural numbers into two classes, one of the classes contains arbitrarily long arithmetic progressions.
A constructive topological proof of van der Waerden's theorem
โ Scribed by Thierry Coquand
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 670 KB
- Volume
- 105
- Category
- Article
- ISSN
- 0022-4049
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Gleason's theorem states that any totally additive measure on the closed subspaces, or projections, of a Hilbert space of dimension greater than two is given by a positive operator of trace class. In this paper we give a constructive proof of that theorem.
We present a new and constructive proof of the Peter-Weyl theorem on the representations of compact groups. We use the Gelfand representation theorem for commutative C\*-algebras to give a proof which may be seen as a direct generalization of Burnside's algorithm [3]. This algorithm computes the cha
In this paper we investigate a propositional systeni L related t o T,-W of relevance logic. It has been conjectured that for any formulas A and B