相关论文: Generating ultrafilters in a reasonable way
We continue algebraization of the set of ultrafilters on a metric spaces initiated in [6]. In particular, we define and study metric counterparts of prime, strongly prime and right cancellable ultrafilters from the Stone-$\check{C}$ech…
A variety of classes of naturally arising ultrafilters on omega is discussed, and the question is raised whether it is consistent that the classes are empty. Since all the classes contain the P-point ultrafilters, a negative answer would…
Large cardinals arising from the existence of arbitrarily long end elementary extension chains over models of set theory are studied here. In particular, we show that the large cardinals obtained that way (`Unfoldable cardinals') behave 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.
We characterize the compactness properties of the product of \lambda\ copies of the space \omega\ with the discrete topology, dealing in particular with the case \lambda\ singular, using regular and uniform ultrafilters, infinitary…
In this paper, we introduce the concept of filter on IL-algebra. It is proved that this concept generalizes the notion of filter on Residuated Lattices. Prime filters on IL-algebra are defined and few interesting properties are obtained. It…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
In a paper from 1997, Shelah asked whether $Pr_1(\lambda^+,\lambda^+,\lambda^+,\lambda)$ holds for every inaccessible cardinal $\lambda$. Here, we prove that an affirmative answer follows from $\square(\lambda^+)$. Furthermore, we establish…
This paper presents a novel approach to constructing finite generating sets for infinitely generated ideals. By integrating algebraic and computational techniques, we provide a method to identify finite generators, demonstrated through…
Working in the context of restricted forms of the Axiom of Choice, we consider the problem of splitting the ordinals below $\lambda$ of cofinality $\theta$ into $\lambda$ many stationary sets, where $\theta < \lambda$ are regular cardinals.…
We isolate a new class of ultrafilters on N, called "quasi-selective" because they are intermediate between selective ultrafilters and P-points. (Under the Continuum Hypothesis these three classes are distinct.) The existence of…
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…
Let $X$ be the prime spectrum of a ring. In [arXiv:0707.1525] the authors define a topology on $X$ by using ultrafilters and they show that this topology is precisely the constructible topology. In this paper we generalize the construction…
In recent years, several problems regarding the partition regularity of exponential configurations have been studied in the literature, in some cases using the properties of specific ultrafilters. In this paper, we start to lay down the…
We study two generalizations of the Rudin-Keisler ordering to ultrafilters on complete Boolean algebras. To highlight the difference between them, we develop new techniques to construct incomparable ultrafilters in this setting.…
We give the first (ZFC) dividing line in Keisler's order among the unstable theories, specifically among the simple unstable theories. That is, for any infinite cardinal $\lambda$ for which there is $\mu < \lambda \leq 2^\mu$, we construct…
We investigate the question of whether $\mathbb Q$ carries an ultrafilter generated by perfect sets (such ultrafilters were called gruff ultrafilters by van Douwen). We prove that one can (consistently) obtain an affirmative answer to this…
Given an ordered structure, we study a natural way to extend the order to preorders on type spaces. For definably complete, linearly ordered structures, we give a characterisation of the preorder on the space of 1-types. We apply these…
Tensor products of ultrafilters have special combinatorial features closely related to Ramsey's Theorem, making them useful tools in applications. Here we first review their fundamental properties and isolate some new ones, including a…
We call a subset of an ordinal $\lambda$ recognizable if it is the unique subset $x$ of $\lambda$ for which some Turing machine with ordinal time and tape, which halts for all subsets of $\lambda$ as input, halts with the final state $0$.…