On the structure of measurable filters on a countable set

In this article, we shall explore the constructions of Bernstein sets, and prove that every Bernstein set is nonmeasurable and doesn't have the property of Baire. We shall also prove that Bernstein sets don't have the perfect set property.

We study several intertwined hierarchies between $\kappa$-Ramsey cardinals and measurable cardinals to illuminate the structure of the large cardinal hierarchy in this region. In particular, we study baby versions of measurability introduced by Bovykin and McKenzie and some variants by locating these notions in the large cardinal hierarchy and providing characterisations via filter games. As an application, we determine the theory of the universe up to a measurable cardinal.

We prove that for every infinite set $E\subset \mathbb Z$, there is a set $S\subset E-E$ which is a set of topological recurrence and not a set of measurable recurrence. This extends a result of Igor Kriz, proving that there is a set of topological recurrence which is not a set of measurable recurrence. Our construction follows Kriz's closely, and this paper can be considered an exposition of the original argument.

Ultrafilters are a tool, originating in mathematical logic and general topology, that has steadily found more and more uses in multiple areas of mathematics, such as combinatorics, dynamics, and algebra, among others. The purpose of this article is to introduce ultrafilters in a friendly manner and present some applications to the branch of combinatorics known as Ramsey theory, culminating with a new ultrafilter-based proof of van der Waerden's theorem.

Some filter relative notions of size, $\left( \mathcal{F},\mathcal{G}\right) $-syndeticity and piecewise $\mathcal{F} $-syndeticity, were defined and applied with clarity and focus by Shuungula, Zelenyuk and Zelenyuk in their paper ``The closure of the smallest ideal of an ultrafilter semigroup.'' These notions are generalizations of the well studied notions of syndeticity and piecewise syndeticity. Since then, there has been an effort to develop the theory around the algebra...

Using a game-theoretic approach we present a generalization of the classical result of Brzuchowski, Cicho\'n, Grzegorek and Ryll-Nardzewski on non-measurable unions. We also present applications of obtained results to Marczewski--Burstin representable ideals, as well as to establishing some countability and continuity properties of measurable functions and homomorphisms between topological groups.

We study the interplay between properties of measures on a Boolean algebra A and forcing names for ultrafilters on A. We show that several well known measure theoretic properties of Boolean algebras (such as supporting a strictly positive measure or carrying only separable measures) have quite natural characterizations in the forcing language. We show some applications of this approach. In particular, we reprove a theorem of Kunen saying that in the classical random model the...

We show that for a $\sigma $-ideal $\ci$ with a Borel base of subsets of an uncountable Polish space, if $\ca$ is (in several senses) a "regular" family of subsets from $\ci $ then there is a subfamily of $\ca$ whose union is completely nonmeasurable i.e. its intersection with every Borel set not in $\ci $ does not belong to the smallest $\sigma $-algebra containing all Borel sets and $\ci.$ Our results generalize results from \cite{fourpoles} and \cite{fivepoles}.

We survey some connections between topological dynamics, semigroups of ultrafilters, and combinatorics. As an application, we give a proof, based on ideas of Bergelson and Hindman, of the Hales-Jewett partition theorem.

A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of perfect subsets of sets with positive measure with reverse mathematics.