ID: math/9905124

On the structure of measurable filters on a countable set

May 19, 1999

View on ArXiv
Tomek Bartoszynski
Mathematics
Logic

A combinatorial characterization of measurable filters on a countable set is found. We apply it to the problem of measurability of the intersection of nonmeasurable filters.

Similar papers 1

Remarks on the intersection of filters

May 19, 1999

89% Match
Tomek Bartoszynski
Logic

The existence of an uncountable family of nonmeager filter whose intersection is meager is consistent with MA(Suslin)

Find SimilarView on arXiv

Intersection of less than continuum ultrafilters may have measure zero

April 14, 1999

87% Match
Tomek Bartoszynski, Saharon Shelah
Logic

The goal of this paper is to prove the theorem in the title.

Find SimilarView on arXiv

Filter games and combinatorial properties of winning strategies

January 26, 1995

86% Match
Claude Laflamme
Logic

We characterize winning strategies in various infinite games involving filters on the natural numbers in terms of combinatorics or structural properties of the given filter. These generalize several ultrafilter games of Galvin.

Find SimilarView on arXiv

Strong meager properties for filters

December 14, 1993

86% Match
Claude Laflamme
Logic

We analyze several ``strong meager'' properties for filters on the natural numbers between the classical Baire property and a filter being $F_\sigma$. Two such properties have been studied by Talagrand and a few more combinatorial ones are investigated. In particular, we define the notion of a P$^+$-filter, a generalization of the traditional concept of P-filter, and prove the existence of a non-meager P$^+$-filter. Our motivation lies in understanding the structure of filter...

Find SimilarView on arXiv

Filters on a countable vector space

January 16, 2021

86% Match
Iian B. Smythe
Logic

We study various combinatorial properties, and the implications between them, for filters generated by infinite-dimensional subspaces of a countable vector space. These properties are analogous to selectivity for ultrafilters on the natural numbers and stability for ordered-union ultrafilters on $\mathrm{FIN}$.

Find SimilarView on arXiv

Filters and games

May 19, 1999

86% Match
Tomek Bartoszynski, Marion Scheepers
Logic

We obtain game-theoretic characterizations for meagerness and rareness of filters on a countable set.

Find SimilarView on arXiv

Conglomerated filters, statistical measures, and representations by ultrafilters

December 4, 2020

86% Match
Vladimir Kadets, Dmytro Seliutin
Functional Analysis
General Topology

Using a new concept of conglomerated filter we demonstrate in a purely combinatorial way that none of Erd\"{o}s-Ulam filters or summable filters can be generated by a single statistical measure and consequently they cannot be represented as intersections of countable families of ulrafilters. Minimal families of ultrafilters and their intersections are studied and several open questions are discussed.

Find SimilarView on arXiv

Complete Multi-Representations of Sets in a Computable Measure Space

June 2, 2010

85% Match
Yongcheng Nanjing University of Information Science and Technology Wu
Computational Complexity

In a recent paper, two multi-representations for the measurable sets in a computable measure space have been introduced, which prove to be topologically complete w.r.t. certain topological properties. In this contribution, we show them recursively complete w.r.t. computability of measure and set-theoretical operations.

Find SimilarView on arXiv

Open filters and measurable cardinals

January 20, 2023

84% Match
Serhii Bardyla, Jaroslav Supina, Lyubomyr Zdomskyy
General Topology

In this paper we showed that the existence of a space $X$ possessing a free $\omega_1$-complete open filter which is contained in $<2^{\mathfrak c}$ open ultrafilters implies the existence of a measurable cardinal. This result implies a negative answer to an old question of Liu. Also, we investigate the poset $\mathbf{OF}(X)$ of free open filters on a space $X$. In particular, we characterize spaces for which $\mathbf{OF}(X)$ is a lattice. For each $n\in\mathbb{N}$ we constru...

Find SimilarView on arXiv

Seven characterizations of non-meager P-filters

November 7, 2013

84% Match
Kenneth Kunen, Andrea Medini, Lyubomyr Zdomskyy
General Topology
Logic

We give several topological/combinatorial conditions that, for a filter on $\omega$, are equivalent to being a non-meager $\mathsf{P}$-filter. In particular, we show that a filter is countable dense homogeneous if and only if it is a non-meager $\mathsf{P}$-filter. Here, we identify a filter with a subspace of $2^\omega$ through characteristic functions. Along the way, we generalize to non-meager $\mathsf{P}$-filters a result of Miller about $\mathsf{P}$-points, and we employ...

Find SimilarView on arXiv