Related papers: Ultrafilters in the random real model
We study the interplay between properties of measures on a Boolean algebra A and forcing names for ultrafilters on A. We show that several well known measure theoretic properties of Boolean algebras (such as supporting a strictly positive…
Motivated by Keisler's order, a far-reaching program of understanding basic model-theoretic structure through the lens of regular ultrapowers, we prove that for a class of regular filters $D$ on $I$, $|I| = \lambda > \aleph_0$, the fact…
We improve Irving's method of the double-sieve by using the DHR sieve. By extending the upper and lower sieve functions into their respective non-elementary ranges, we are able to make improvements on the previous records on the number of…
A union ultrafilter is an ultrafilter over the finite subsets of $\omega$ that has a base of sets of the form $\mathrm{FU}(X)$, where $X$ is an infinite pairwise disjoint family and $\mathrm{FU}(X)=\{\bigcup…
We provide a new proof of ``most" cases of the polynomial Wiener-Wintner theorem for $\sigma$-finite spaces, using hard-analytic methods. Specifically, we prove that whenever $(X,\mu,T)$ is a $\sigma$-finite measure-preserving system, and…
We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.
We characterize strong $p$-point ultrafilters by showing that they are exactly those $p$-points that are not Tukey above $(\omega^\omega,\leq)$; or equivalently, those $p$-points that are not Tukey-idempotent. Moreover, we show that there…
Let $S$ be an infinite discrete semigroup. The operation on $S$ extends uniquely to the Stone-\v{C}ech compactification $\beta S$ making $\beta S$ a compact right topological semigroup with $S$ contained in its topological center. As such,…
An ultrafilter $\mathcal{U}$ on a countable base {\em has continuous Tukey reductions} if whenever an ultrafilter $\mathcal{V}$ is Tukey reducible to $\mathcal{U}$, then every monotone cofinal map $f:\mathcal{U}\ra\mathcal{V}$ is continuous…
We investigate the Tukey type of the generic ultrafilter added by the quotient $\mathcal{P}(\omega \times \omega) / (\mathrm{FIN} \times \mathrm{FIN})$. We prove that this ultrafilter is not basically generated and yet does not have the…
We present PPCEF, a novel method for generating probabilistically plausible counterfactual explanations (CFs). PPCEF advances beyond existing methods by combining a probabilistic formulation that leverages the data distribution with the…
Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…
We present a new method for counterfactual explanations (CFEs) based on Bayesian optimisation that applies to both classification and regression models. Our method is a globally convergent search algorithm with support for arbitrary…
We prove that every MAD family can be destroyed by a proper forcing that preserves $P$-points. With this result, we prove that it is consistent that $\omega_{1}=\mathfrak{u}<\mathfrak{a,}$ solving a nearly 20 year old problem of Shelah and…
We consider random filtered complexes built over marked point processes on Euclidean spaces. Examples of our filtered complexes include a filtration of $\check{\textrm{C}}$ech complexes of a family of sets with various sizes, growths, and…
We contribute to the study of $\aleph_1$-dense sets of reals, a mainstay in set theoretic research since Baumgartner's seminal work in the 70s. In particular, we show that it is consistent with $\textsf{MA}$ that there exists an…
Techniques for the efficient successive under-approximation of the greatest fixpoint in TCTL formulas can be useful in fast refutation of inevitability properties and vacuity checking. We first give an integrated algorithmic framework for…
In earlier work of the second and third author the equivalence of a finite square principle square^fin_{lambda,D} with various model theoretic properties of structures of size lambda and regular ultrafilters was established. In this paper…
We give another proof that for every lambda >= beth_omega for every large enough regular kappa < beth_omega we have lambda^{[kappa]}= lambda, dealing with sufficient conditions for replacing beth_omega by aleph_omega. In section 2 we show…
We present a short ultrafilter proof of the existence of monochromatic exponential triples $\{a, b, b^a\}$ in any finite coloring of the natural numbers. The proof is given from scratch and uses only Ramsey's theorem, the notion of…