English
Related papers

Related papers: Destroying Saturation while Preserving Presaturati…

200 papers

We develop the theory of layered posets, and use the notion of layering to prove a new iteration theorem (Theorem 6): if $\kappa$ is weakly compact then any universal Kunen iteration of $\kappa$-cc posets (each possibly of size $\kappa$) is…

Logic · Mathematics 2019-09-18 Sean D. Cox

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

Logic · Mathematics 2023-01-02 Daisuke Ikegami , Philipp Schlicht

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…

Logic · Mathematics 2019-03-27 David Fernández-Bretón , Elizabeth Lauri

By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…

Logic in Computer Science · Computer Science 2025-07-16 Philippe Balbiani , Olivier Gasquet

The work presents the brief exposition of the proof (in ZF) of inaccessible cardinals nonexistence. To this end in view there is used the apparatus of subinaccessible cardinals and its basic tools -- reduced formula spectra and matrices and…

Logic · Mathematics 2011-10-18 A. Kiselev

We introduce bounded category forcing axioms for well-behaved classes $\Gamma$. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe $H_{\lambda_\Gamma^+}$ modulo…

Logic · Mathematics 2021-01-11 David Aspero , Matteo Viale

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…

Logic · Mathematics 2025-11-12 William Adkisson , Omer Ben Neria

The main goal of this note is to prove the following theorem. If $A_n$ is a sequence of measurable sets in a $\sigma$-finite measure space $(X, \mathcal{A}, \mu)$ that covers $\mu$-a.e. $x \in X$ infinitely many times, then there exists a…

Logic · Mathematics 2011-09-23 Márton Elekes

Answering a question of Ketonen from the late 1970's, it is proved that a weakly compact cardinal carrying an indecomposable ultrafilter need not be measurable. The result is obtained by analyzing the limit of a decreasing sequence of…

Logic · Mathematics 2025-12-01 Assaf Rinot , Zhixing You , Jiachen Yuan

Generalizing Keisler's notion of regularity for ultrafilters, Taylor introduced degrees of regularity for ideals and showed that a countably complete nonregular ideal on $\omega_1$ must be somewhere $\omega_1$-dense. We prove a dichotomy…

Logic · Mathematics 2020-09-04 Monroe Eskew

We obtain an improvement of some coloring theorems from \cite{nsbpr}, \cite{819}, and \cite{APAL} for the case where the singular cardinal in question has countable cofinality. As a corollary, we obtain an "idealized" version of the…

Logic · Mathematics 2012-10-23 Todd Eisworth

In this paper we prove that the tree property can hold on regular cardinals in an interval which overlaps a strong limit cardinal. This is a crucial milestone in the long term project, tracing back to a question raised by Foreman and…

We consider natural cardinal invariants hm_n and prove several duality theorems, saying roughly: if I is a suitably definable ideal and provably cov(I)>=hm_n, then non(I) is provably small. The proofs integrate the determinacy theory,…

Logic · Mathematics 2007-05-23 Saharon Shelah , Jindrich Zapletal

Starting from suitable large cardinals, we force the failure of (weak) diamond at the least inaccessible cardinal. The result improves an unpublished theorem of Woodin and a recent result of Ben-Neria, Garti and Hayut.

Logic · Mathematics 2021-01-27 Mohammad Golshani

We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give an explicit sufficient…

Combinatorics · Mathematics 2017-09-26 Takuro Abe

We build a supercompact version of the forcing defined in \cite{gitik2019}. For each singular cardinal in the ground model with any fixed cofinality, which is a limit of supercompact cardinals, it is possible to force so that the size of…

Logic · Mathematics 2021-12-21 Sittinon Jirattikansakul

We show that, under the assumption of the existence of $M_1^{\#}$, there exists a model on which the restricted nonstationary ideal $\hbox{NS} \upharpoonright A$ is $\aleph_2$-saturated, for $A$ a stationary co-stationary subset of…

Logic · Mathematics 2016-10-14 Stefan Hoffelner

We describe the semigroup of the Lipschitz saturation of a complex analytic toric singularity in arbitrary dimension. We give a necessary and sufficient condition for a monomial in the normalization to belong to the Lipschitz saturation, in…

Algebraic Geometry · Mathematics 2026-04-06 François Bernard , Enrique Chávez-Martínez , Arturo E. Giles Flores

We consider an homogeneous ideal $I$ in the polynomial ring $S=K[x_1,\dots,$ $x_m]$ over a finite field $K=\mathbb{F}_q$ and the finite set of projective rational points $\mathbb{X}$ that it defines in the projective space…

Commutative Algebra · Mathematics 2023-10-24 Philippe Gimenez , Diego Ruano , Rodrigo San-José

We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…

Theoretical Economics · Economics 2021-11-17 Leandro Gorno , Alessandro Rivello
‹ Prev 1 3 4 5 6 7 10 Next ›