Ramseyan ultrafilters

We investigate families of partitions of omega which are related to special coideals, so-called happy families, and give a dual form of Ramsey ultrafilters in terms of partitions. The combinatorial properties of these partition-ultrafilters, which we call Ramseyan ultrafilters, are similar to those of Ramsey ultrafilters. For example it will be shown that dual Mathias forcing restricted to a Ramseyan ultrafilter has the same features as Mathias forcing restricted to a Ramsey ultrafilter. Further we introduce an ordering on the set of partition-filters and consider the dual form of some cardinal characteristics of the continuum

Rothberger bounded groups and Ramsey theory

We show that: 1. Rothberger bounded subgroups of sigma-compact groups are characterized by Ramseyan partition relations. 2. For each uncountable cardinal $\kappa$ there is a ${\sf T}_0$ topological group of cardinality $\kappa$ such that ONE has a winning strategy in the point-open game on the group and the group is not a subspace of any sigma-compact space. 3. For each uncountable cardinal $\kappa$ there is a ${\sf T}_0$ topological group of cardinality $\kappa$ such that ONE has a winning strategy in the point-open game on the group and the group is \sigma-compact.Comment: 11 page

Partition relations for Hurewicz-type selection hypotheses

We give a general method to reduce Hurewicz-type selection hypotheses into standard ones. The method covers the known results of this kind and gives some new ones. Building on that, we show how to derive Ramsey theoretic characterizations for these selection hypotheses.Comment: To appear in Topology and its Application

A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Streams

International audienceWe discuss the completeness of an axiomatization of Monadic Second- Order Logic (MSO) on infinite words (or streams). By using model-theoretic tools, we give an alternative proof of D. Siefkes' result that a fragment with full comprehension and induction of second-order Peano's arithmetic is com- plete w.r.t. the validity of MSO-formulas on streams. We rely on Feferman- Vaught Theorems and the Ehrenfeucht-Fra ̈ıss ́e method for Henkin models of second-order arithmetic. Our main technical contribution is an infinitary Feferman-Vaught Fusion of such models. We show it using Ramseyan fac- torizations similar to those for standard infinite words. We also discuss a Ramsey's theorem for MSO-definable colorings, and show that in linearly ordered Henkin models, Ramsey's theorem for additive MSO-definable col- orings implies Ramsey's theorem for all MSO-definable colorings

The combinatorics of splittability

Marion Scheepers, in his studies of the combinatorics of open covers, introduced the property Split(U,V) asserting that a cover of type U can be split into two covers of type V. In the first part of this paper we give an almost complete classification of all properties of this form where U and V are significant families of covers which appear in the literature (namely, large covers, omega-covers, tau-covers, and gamma-covers), using combinatorial characterizations of these properties in terms related to ultrafilters on N. In the second part of the paper we consider the questions whether, given U and V, the property Split(U,V) is preserved under taking finite unions, arbitrary subsets, powers or products. Several interesting problems remain open.Comment: Small update

The weakness of being cohesive, thin or free in reverse mathematics

Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this paper, we investigate the lack of robustness of Ramsey's theorem and its consequence under the frameworks of reverse mathematics and computable reducibility. To this end, we study the degrees of unsolvability of cohesive sets for different uniformly computable sequence of sets and identify different layers of unsolvability. This analysis enables us to answer some questions of Wang about how typical sets help computing cohesive sets. We also study the impact of the number of colors in the computable reducibility between coloring statements. In particular, we strengthen the proof by Dzhafarov that cohesiveness does not strongly reduce to stable Ramsey's theorem for pairs, revealing the combinatorial nature of this non-reducibility and prove that whenever $k$ is greater than $\ell$, stable Ramsey's theorem for $n$-tuples and $k$ colors is not computably reducible to Ramsey's theorem for $n$-tuples and $\ell$ colors. In this sense, Ramsey's theorem is not robust with respect to his number of colors over computable reducibility. Finally, we separate the thin set and free set theorem from Ramsey's theorem for pairs and identify an infinite decreasing hierarchy of thin set theorems in reverse mathematics. This shows that in reverse mathematics, the strength of Ramsey's theorem is very sensitive to the number of colors in the output set. In particular, it enables us to answer several related questions asked by Cholak, Giusto, Hirst and Jockusch.Comment: 31 page

Strong measure zero and meager-additive sets through the prism of fractal measures

We develop a theory of \emph{sharp measure zero} sets that parallels Borel's \emph{strong measure zero}, and prove a theorem analogous to Galvin-Myscielski-Solovay Theorem, namely that a set of reals has sharp measure zero if and only if it is meager-additive. Some consequences: A subset of $2^\omega$ is meager-additive if and only if it is $\mathcal E$-additive; if $f:2^\omega\to2^\omega$ is continuous and $X$ is meager-additive, then so is $f(X)$.Comment: arXiv admin note: text overlap with arXiv:1208.552