English
Related papers

Related papers: Classes of barren extensions

200 papers

J{\'o}nsson and Tarski's notion of the perfect extension of a Boolean algebra with operators has evolved into an extensive theory of canonical extensions of lattice-based algebras. After reviewing this evolution we make two contributions.…

Logic · Mathematics 2023-11-08 Robert Goldblatt

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…

Logic · Mathematics 2010-12-10 Matteo Viale , Christoph Weiß

We prove two general results about the preservation of extendible and $C^{(n)}$-extendible cardinals under a wide class of forcing iterations (Theorems 5.4 and 7.5). As applications we give new proofs of the preservation of Vop\v{e}nka's…

Logic · Mathematics 2021-07-16 Bagaria Joan , Poveda Alejandro

Associated to each ultrafilter $\mathcal{U}$ on $\omega$ and each map $p:\omega\rightarrow \omega$ is a Dedekind cut in the ultrapower $\omega^{\omega}/p( \mathcal{U})$. Blass has characterized, under CH, the cuts obtainable when…

Logic · Mathematics 2014-01-14 Timothy Trujillo

We find a strong separation between two natural families of simple rank one theories in Keisler's order: the theories $T_\mathfrak{m}$ reflecting graph sequences, which witness that Keisler's order has the maximum number of classes, and the…

Logic · Mathematics 2023-07-06 M. Malliaris , S. Shelah

The ultrafilters on the partial order $([\omega]^{\omega},\subseteq^*)$ are the free ultrafilters on $\omega$, which constitute the space $\omega^*$, the Stone-Cech remainder of $\omega$. If $U$ is an upperset of this partial order (i.e., a…

Logic · Mathematics 2018-01-11 Will Brian , Jonathan Verner

The main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…

Combinatorics · Mathematics 2021-07-08 Piotr Szewczak

Given a function $f : A \to \mathbb{R}^n$ of a certain regularity defined on some open subset $A \subseteq \mathbb{R}^m$, it is a classical problem of analysis to investigate whether the function can be extended to all of $\mathbb{R}^m$ in…

General Relativity and Quantum Cosmology · Physics 2024-08-22 Jan Sbierski

We give topological characterizations of filters $F$ on $w$ such that the Mathias forcing $M_F$ adds no dominating reals or preserves ground model unbounded families. This allows us to answer some questions of Brendle, Guzm\'an,…

Logic · Mathematics 2015-12-29 David Chodounský , Dušan Repovš , Lyubomyr Zdomskyy

We will consider a number of new large-cardinal properties, the $\alpha$-tremendous cardinals for each limit ordinal $\alpha>0$, the hyper-tremendous cardinals, the $\alpha$-enormous cardinals for each limit ordinal $\alpha>0$, and the…

Logic · Mathematics 2021-03-10 Rupert McCallum

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…

Logic · Mathematics 2025-12-10 Tom Benhamou , Sittinon Jirattikansakul

In the first part of this paper, we explore the possibility for a very large cardinal $\kappa$ to carry a $\kappa$-complete ultrafilter without Galvin's property. In this context, we prove the consistency of every ground model…

Logic · Mathematics 2025-11-07 Tom Benhamou , Shimon Garti , Alejandro Poveda

We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open problems, but on our way to get the…

Logic · Mathematics 2013-01-03 Andrzej Roslanowski , Saharon Shelah

Motivated by a question of Isbell, we show that Jensen's Diamond Principle implies there is a non-P-point ultrafilter U on omega such that U, whether ordered by reverse inclusion or reverse inclusion mod finite, is not Tukey equivalent to…

Logic · Mathematics 2010-01-05 David Milovich

We prove that if $\mathcal{A}$ is a $\sigma$-complete Boolean algebra in a model $V$ of set theory and $\mathbb{P}\in V$ is a proper forcing with the Laver property preserving the ground model reals non-meager, then every pointwise…

Functional Analysis · Mathematics 2019-09-23 Damian Sobota , Lyubomyr Zdomskyy

We address a number of problems on Boolean Algebras. For example, we construct, in ZFC, for any BA B, and cardinal kappa BAs B_1,B_2 extending B such that the depth of the free product of B_1,B_2 over B is strictly larger than the depths of…

Logic · Mathematics 2016-09-06 Saharon Shelah

In this note, we developed several results concerning abelian von Neumann algebras, their spectrums, and their tensor products with other von Neumann algebras. In particular, we developed a theory connecting elements of the spectrum of…

Operator Algebras · Mathematics 2023-06-06 David Gao

In this article we adapt the existing account of class-forcing over a ZFC model to a model $(M,\mathcal{C})$ of Morse-Kelley class theory. We give a rigorous definition of class-forcing in such a model and show that the Definability Lemma…

Logic · Mathematics 2015-03-03 Carolin Antos

A simple \(P_\lambda\)-point on a regular cardinal \(\kappa\) is a uniform ultrafilter on \(\kappa\) with a mod-bounded decreasing generating sequence of length \(\lambda\). We prove that if there is a simple $P_\lambda$-point ultrafilter…

Logic · Mathematics 2025-12-10 Tom Benhamou , Gabriel Goldberg

We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…

Logic in Computer Science · Computer Science 2018-11-28 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf