相关论文: Generating ultrafilters in a reasonable way

We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of…

We use Shelah's theory of possible cofinalities in order to solve a problem about ultrafilters. THEOREM. Suppose that $ \lambda $ is a singular cardinal, $ \lambda ' < \lambda $, and the ultrafilter $D$ is $ \kappa $-decomposable for all…

We are interested in generalizing part of the theory of ultrafilters on omega to larger cardinals. Here we set the scene for further investigations introducing properties of ultrafilters in strong sense dual to being normal.

It is proved to be consistent relative to a measurable cardinal that there is a uniform ultrafilter on the real numbers which is generated by fewer than the maximum possible number of sets. It is also shown to be consistent relative to a…

We develop the theory of cofinal types of ultrafilters over measurable cardinals and establish its connections to Galvin's property. We generalize fundamental results from the countable to the uncountable, but often in surprisingly…

Our results in this paper increase the model-theoretic precision of a widely used method for building ultrafilters, and so advance the general problem of constructing ultrafilters whose ultrapowers have a precise degree of saturation. We…

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…

We introduce the decomposability spectrum $K_D=\{\lambda \geq \omega| D \text{is} \lambda\text{-decomposable}\}$ of an ultrafilter $D$, and show that Shelah's $\pcf$ theory influences the possible values $K_D$ can take. For example, we show…

We prove the consistency of a singular cardinal $\lambda$ with small value of the ultrafilter number $u_\lambda$, and arbitrarily large value of $2^\lambda$.

In this paper, we study a special type of ultrafilter which we call Shelah ultrafilter. We show that it is possible to add a Shelah ultrafilter using a special forcing notion. We also show that Shelah ultrafilters turn out to be…

We investigate the structure of ultrafilters on Boolean algebras in the framework of Tukey reducibility. In particular, this paper provides several techniques to construct ultrafilters which are not Tukey maximal. Furthermore, we connect…

We obtain a small ultrafilter number at $\aleph_{\omega_1}$. Moreover, we develop a version of the overlapping strong extender forcing with collapses which can keep the top cardinal $\kappa$ inaccessible. We apply this forcing to construct…

We generalize the results from "P. Lipparini, Productive $[\lambda,\mu]$-compactness and regular ultrafilters, Topology Proceedings, 21 (1996), 161--171"; in particular the present results apply to singular cardinals, too.

It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…

In a classical paper by Ben-David and Magidor, a model of set theory was exhibited in which $\aleph_{\omega+1}$ carries a uniform ultrafilter that is $\theta$-indecomposable for every uncountable cardinal $\theta<\aleph_\omega$. In this…

We give a model-theoretic perspective on regular ultrafilter construction in the twentieth and twenty-first century (so far), and explain the "canonical Boolean algebra" recently developed by Malliaris and Shelah.

In this paper we present a use of nonstandard methods in the theory of ultrafilters and in related applications to combinatorics of numbers.

Ultrafilters are useful mathematical objects having applications in nonstandard analysis, Ramsey theory, Boolean algebra, topology, and other areas of mathematics. In this note, we provide a categorical construction of ultrafilters in terms…

We use nonstandard methods, based on iterated hyperextensions, to develop applications to Ramsey theory of the theory of monads of ultrafilters. This is performed by studying in detail arbitrary tensor products of ultrafilters, as well as…

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.