Search arXivSearch

arXiv · 1605.04735

Towers in filters, cardinal invariants, and Luzin type families

Abstract

We investigate which filters on $\omega$ can contain towers, that is, a modulo finite descending sequence without any pseudointersection (in $[\omega]^\omega$). We prove the following results: - Many classical examples of nice tall filters contain no towers (in ZFC). - It is consistent that tall analytic P-filters contain towers of arbitrary regular height (simultaneously for many regular cardinals as well). - It is consistent that all towers generate non-meager filters, in particular (consistently) Borel filters do not contain towers. - The statement "Every ultrafilter contains towers." is independent of ZFC. Furthermore, we study many possible logical (non)implications between the existence of towers in filters, inequalities between cardinal invariants of filters ($\mbox{add}^*(\mathcal F)$, $\mbox{cof}^*(\mathcal F)$, $\mbox{non}^*(\mathcal F)$, and $\mbox{cov}^*(\mathcal F)$), and the existence of Luzin type families (of size $\geq \omega_2$), that is, if $\mathcal F$ is a filter then $X\subseteq [\omega]^\omega$ is an $\mathcal F$-Luzin family if $\{A\in X:|A\setminus F|=\omega\}$ is countable for every $F\in \mathcal F$.

Explore related subjects

Keep this discovery

BibTeXRIS

Jörg Brendle, Barnabás Farkas, Jonathan Verner. 2016-05-16. Towers in filters, cardinal invariants, and Luzin type families. https://arxiv.org/abs/1605.04735

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO