SearcharxivSearch

arXiv · 2308.12594

Characterizing existence of certain ultrafilters

Abstract

Following Baumgartner [J. Symb. Log. 60 (1995), no. 2], for an ideal $\mathcal{I}$ on $\omega$, we say that an ultrafilter $\mathcal{U}$ on $\omega$ is an $\mathcal{I}$-ultrafilter if for every function $f:\omega\to\omega$ there is $A\in \mathcal{U}$ with $f[A]\in \mathcal{I}$. If there is an $\mathcal{I}$-ultrafilter which is not a $\mathcal{J}$-ultrafilter, then $\mathcal{I}$ is not below $\mathcal{J}$ in the Kat\v{e}tov order $\leq_{K}$ (i.e. for every function $f:\omega\to\omega$ there is $A\in \mathcal{I}$ with $f^{-1}[A]\notin \mathcal{J}$). On the other hand, in general $\mathcal{I}\not\leq_{K}\mathcal{J}$ does not imply that existence of an $\mathcal{I}$-ultrafilter which is not a $\mathcal{J}$-ultrafilter is consistent. We provide some sufficient conditions on ideals to obtain the equivalence: $\mathcal{I}\not\leq_{K}\mathcal{J}$ if and only if it is consistent that there exists an $\mathcal{I}$-ultrafilter which is not a $\mathcal{J}$-ultrafilter. In some cases when the Kat\v{e}tov order is not enough for the above equivalence, we provide other conditions for which a similar equivalence holds. We are mainly interested in the cases when the family of all $\mathcal{I}$-ultrafilters or $\mathcal{J}$-ultrafilters coincides with some known family of ultrafilters: P-points, Q-points or selective ultrafilters (a.k.a. Ramsey ultrafilters). In particular, our results provide a characterization of Borel ideals $\mathcal{I}$ which can be used to characterize P-points as $\mathcal{I}$-ultrafilters. Moreover, we introduce a cardinal invariant which is used to obtain a sufficient condition for the existence of an $\mathcal{I}$-ultrafilter which is not a $\mathcal{I}$-ultrafilter. Finally, we prove some new results concerning existence of certain ultrafilters under various set-theoretic assumptions.

Explore related subjects

Keep this discovery

BibTeXRIS

Rafał Filipów, Krzysztof Kowitz, Adam Kwela. 2023-08-24. Characterizing existence of certain ultrafilters. https://doi.org/10.1016/j.apal.2022.103157

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