Related papers: Well-founded Boolean ultrapowers as large cardinal…
Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…
We develop the notion of coherent ultrafilters (extenders without normality or well-foundedness). We then use definable coherent ultraproducts to characterize any extension of a model $M$ in any fragment of $\mathbb{L}_{\infty, \omega}$…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
We prove a result concerning elementary embeddings of the set-theoretic universe into itself (Reinhardt embeddings) and functions on ordinals that "eventually dominate" such embeddings. We apply that result to show the existence of…
We show in ZFC, that the depth of ultraproducts of Boolean Algebras may be bigger than the ultraproduct of the depth of those Boolean Algebras.
We summarize the known methods of producing a non-supercompact strongly compact cardinal and describe some new variants. Our Main Theorem shows how to apply these methods to many cardinals simultaneously and exactly control which cardinals…
Let C denote any of the following cardinal characteristics of Boolean algebras: incomparability, spread, character, pi-character, hereditary Lindelof number, hereditary density. It is shown to be consistent that there exists a sequence…
We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…
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 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.…
Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…
Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…
We investigate large set axioms defined in terms of elementary embeddings over constructive set theories, focusing on $\mathsf{IKP}$ and $\mathsf{CZF}$. Most previously studied large set axioms, notably the constructive analogues of large…
We study various orders on countably complete ultrafilters on ordinals that coincide and are wellorders under a hypothesis called the Ultrapower Axiom. Our main focus is on the relationship between the Ultrapower Axiom and the linearity of…
This paper explores several topics related to Woodin's HOD conjecture. We improve the large cardinal hypothesis of Woodin's HOD dichotomy theorem from an extendible cardinal to a strongly compact cardinal. We show that assuming there is a…
We study closure properties of measurable ultrapowers with respect to Hamkin's notion of "freshness" and show that the extent of these properties highly depends on the combinatorial properties of the underlying model of set theory. In one…
The concepts of a conditional set, a conditional inclusion relation and a conditional Cartesian product are introduced. The resulting conditional set theory is sufficiently rich in order to construct a conditional topology, a conditional…
For a free ultrafilter U on omega we study several cardinal characteristics which describe part of the combinatorial structure of U. We provide various consistency results; e.g. we show how to force simultaneously many characters and many…
For a cardinal lambda<lambda_{omega_1} we give a ccc forcing notion P which forces that for some Borel subset B of the Cantor space (1) there a sequence (eta_alpha:alpha<lambda) of distinct elements such that |(eta_alpha+B) cap…
We introduce a large cardinal property which is consistent with L and show that for every superatomic Boolean algebra B and every cardinal lambda with the large cardinal property, if tightness^+(B) >= lambda^+, then depth (B) >= lambda.…