Related papers: The combinatorics of reasonable ultrafilters
We study some limitations and possible occurrences of uniform ultrafilters on ordinals without the axiom of choice. We prove an Easton-like theorem about the possible spectrum of successors of regular cardinals which carry uniform…
The use of nonstandard methods to characterize properties of weak, strong and mixed extensions of congruences to ultrafilters has been the main topic of several recent papers. We show that similar methods can be used to characterize the…
Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings…
We characterize ultrafilter convergence and ultrafilter compactness in linearly ordered and generalized ordered topological spaces. In such spaces, and for every ultrafilter $D$, the notions of $D$-compactness and of $D$-pseudocompactness…
We study the strength of well-founded ultrafilters on ordinals above choiceless large cardinals and their associated Prikry forcings. Gabriel Goldberg showed that all but boundedly many regular cardinals above a rank Berkeley cardinal carry…
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.
We discuss the connection between various orders on the class of all the ultrafilters and certain compactness properties of abstract logics and of topological spaces. We present a model theoretical characterization of Comfort order. We…
We prove, in ZFC alone, some new results on regularity and decomposability of ultrafilters. We also list some problems, and furnish applications to topological spaces and to extended logics.
We propose a uniform method of constructing ultrafilter extensions from canonical models, which is based on the similarity between ultrafilters and maximal consistent sets. This method can help us understand why the known ultrafilter…
All ultrafilters under consideration here are non-principal ultrafilters on the set omega of natural numbers. We are concerned with the possible cofinalities of ultrapowers of omega with respect to such ultrafilters. We show that no…
In this paper we analyse and compare two different notions of regularity for filters on complete Boolean algebras. We also announce two results from a forthcoming paper in preparation, which provide a characterization of Keisler's order in…
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…
An earlier paper, entitled "P-hierarchy on $\beta\omega$", investigated the relations between ordinal ultrafilters and the so-called P-hierarchy. This study is continued in the present paper and focuses on the aspects of characterization of…
We characterize sums of normal ultrafilters after the Magidor iteration (product) of Prikry forcings over a discrete set of measurable cardinals. We apply this to show that the weak Ultrapower Axiom is not equivalent to the Ultrapower…
We adjust the notion of finitary filter pair, which was coined for creating and analyzing finitary logics, in such a way that we can treat logics of cardinality $\kappa$, where $\kappa$ is a regular cardinal. The corresponding new notion is…
We show from a weak comparison principle (the Ultrapower Axiom) that the Mitchell order is linear on certain kinds of ultrafilters: normal ultrafilters, Dodd solid ultrafilters, and assuming GCH, generalized normal ultrafilters. In the…
We show that many large cardinal notions up to measurability can be characterized through the existence of certain filters for small models of set theory. This correspondence will allow us to obtain a canonical way in which to assign ideals…
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 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…
We present some new results on union ultrafilters. We characterize stability for union ultrafilters and, as the main result, we construct a new kind of unordered union ultrafilter.