Related papers: The reverse mathematics of Carlson's theorem for l…
The Carlson-Simpson lemma is a combinatorial statement occurring in the proof of the Dual Ramsey theorem. Formulated in terms of variable words, it informally asserts that given any finite coloring of the strings, there is an infinite…
We study the reverse mathematics of infinitary extensions of the Hales-Jewett theorem, due to Carlson and Simpson. These theorems have multiple applications in Ramsey's theory, such as the existence of finite big Ramsey numbers for the…
We consider the restriction of Ramsey's theorem that arises from considering only translation-invariant colourings of pairs, and show that this has the same strength (both from the viewpoint of Reverse Mathematics and from the viewpoint of…
This paper uses the framework of reverse mathematics to investigate the strength of two recurrence theorems of topological dynamics. It establishes that one of these theorems, the existence of an almost periodic point, lies strictly between…
Ramsey theory for words over a finite alphabet was unified in the work of Carlson and Furstenberg-Katznelson. Carlson, in the same work, outlined a method to extend the theory for words over an infinite alphabet, but subject to a fixed…
A complete partition theory is presented for omega-located words (and omega-words), namely for located words over an infinite alphabet dominated by a fixed increasing sequence. This theory strengthens in an essential way the classical…
We study the reverse mathematics of the theory of countable second-countable topological spaces, with a focus on compactness. We show that the general theory of such spaces works as expected in the subsystem $\mathsf{ACA}_0$ of second-order…
We prove upper and lower bounds on the effective content and logical strength for a variety of natural restrictions of Hindman's Finite Sums Theorem. For example, we show that Hindman's Theorem for sums of length at most 2 and 4 colors…
We prove a density version of the Carlson--Simpson Theorem. Specifically we show the following. For every integer $k\geq 2$ and every set $A$ of words over $k$ satisfying \[\limsup_{n\to\infty} \frac{|A\cap [k]^n|}{k^n}>0\] there exist a…
In this paper we examine the reverse mathematical strength of a variation of Hindman's Theorem HT constructed by essentially combining HT with the Thin Set Theorem TS to obtain a principle which we call thin-HT. thin-HT says that every…
We prove weak and strong convergence theorems for a double Krasnoselskij type iterative method to approximate coupled solutions of a bivariate nonexpansive operator F : C x C --> C, where C is a nonempty closed and convex subset of a…
We show a short proof of Higman's lemma using Friedman's adjacent Ramsey theorem for pairs. This provides an alternative proof of the known upper bound for the reverse mathematical status of Higman's lemma and that of its miniaturised…
Hindman's Theorem is a prototypical example of a combinatorial theorem with a proof that uses the topology of the ultrafilters. We show how the methods of this proof, including topological arguments about ultrafilters, can be translated…
We study infinite words fixed by a morphism and their derived words. A derived word is a coding of return words to a factor. We exhibit two examples of sets of morphisms which are closed under derivation --- any derived word with respect to…
Starting with a combinatorial partition theorem for words over an infinite alphabet dominated by a fixed sequence, established recently by the authors, we prove recurrence results for topological dynamical systems indexed by such words. In…
We establish coupled fixed point theorems for contraction involving rational expressions in partially ordered metric spaces.
An uniqueness theorem for the inverse problem in the case of a second-order equation defined on the interval [0,1] when the boundary forms contain combinations of the values of functions at the points 0 and 1 is proved. The auxiliary…
A version of Arzel\`a-Ascoli theorem for $X$ being $\sigma$-locally compact Hausdorff space is proved. The result is used in proving compactness of Fredholm, Hammerstein and Urysohn operators. Two fixed point theorems, for Hammerstein and…
When the Canonical Ramsey's Theorem by Erd\H{o}s and Rado is applied to regressive functions one obtains the Regressive Ramsey's Theorem by Kanamori and McAloon. Taylor proved a "canonical" version of Hindman's Theorem, analogous to the…
Fixed point theorems are ubiquitous in economic research. Many studies cite Smithson (1971) ``Fixed points of order preserving multifunctions,'' yet the original proof contains errors. This note presents a new, concise proof and explains…