English
Related papers

Related papers: Fodor's lemma can fail everywhere

200 papers

The consistency of the theory $\mathsf{ZF} + \mathsf{AD}_{\mathbb{R}} + {}$``every set of reals is universally Baire'' is proved relative to $\mathsf{ZFC} + {}$``there is a cardinal that is a limit of Woodin cardinals and of strong…

Logic · Mathematics 2025-06-18 Paul B. Larson , Grigor Sargsyan , Trevor Wilson

We show that in Zermelo-Fraenkel Set Theory without the Axiom of Choice a surjectively modified continuum function $\theta(\kappa)$ can take almost arbitrary values for all infinite cardinals. This choiceless version of Easton's Theorem is…

Logic · Mathematics 2016-07-04 Anne Fernengel , Peter Koepke

We introduce a generalization of stationary set reflection which we call "filter reflection", and show it is compatible with the axiom of constructibility as well as with strong forcing axioms. We prove the independence of filter reflection…

Logic · Mathematics 2020-03-19 Gabriel Fernandes , Miguel Moreno , Assaf Rinot

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

The authors and Fischer recently proved that any hereditary property of two-dimensional matrices (where the row and column order is not ignored) over a finite alphabet is testable with a constant number of queries, by establishing the…

Combinatorics · Mathematics 2017-06-14 Noga Alon , Omri Ben-Eliezer

It is known that the assumption that ``GCH first fails at \aleph_{\omega}'' leads to large cardinals in ZFC. Gitik and Koepke have demonstrated that this is not so in ZF: namely there is a generic cardinal-preserving extension of L (or any…

Logic · Mathematics 2010-08-23 Vladimir Kanovei

We prove a compactness theorem for pseudopower operations of the form $pp_{\Gamma(\mu,\sigma)}(\mu)$ where $\aleph_0<\sigma=cf(\sigma)\leq cf(\mu)$. Our main tool is a result that has Shelah's cov vs. pp Theorem as a consequence. We also…

Logic · Mathematics 2019-06-25 Todd Eisworth

We investigate the possibilities of global versions of Chang's Conjecture that involve singular cardinals. We show some $\mathrm{ZFC}$ limitations on such principles, and prove relative to large cardinals that Chang's Conjecture can…

Logic · Mathematics 2021-03-08 Monroe Eskew , Yair Hayut

We study principles of the form: if a name $\sigma$ is forced to have a certain property $\varphi$, then there is a ground model filter $g$ such that $\sigma^g$ satisfies $\varphi$. We prove a general correspondence connecting these name…

Logic · Mathematics 2021-10-25 Philipp Schlicht , Christopher Turner

The manuscript is concerned with the Rudin-Keisler order of ultrafilters on measurable cardinals. The main theorem proved read as follows: Given regular cardinals $\lambda\leq \kappa$, the following theories are equiconsistent modulo ZFC:…

Logic · Mathematics 2026-01-16 Yair Hayut , Alejandro Poveda

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…

Logic · Mathematics 2016-02-10 Juliette Kennedy , Saharon Shelah , Jouko Vaananen

We define the Igusa-Todorov function in the context of finite dimensional comodules and prove that a coalgebra is left qcF if and only if it is left semiperfect and its Igusa-Todorov function on each right finite dimensional comodule is…

Representation Theory · Mathematics 2011-09-07 Haim Mariana , Lanzilotta Marcelo , Mata Gustavo

A set $F$ of formulas is complete relative to a given class of logics, if every logic from this class can be axiomatized by formulas from $F$. A set of formulas $F$ is {\L}-complete relative to a given class of logics, if every logic of…

Logic · Mathematics 2014-07-23 Alex Citkin

Filter convergence of vector lattice-valued measures is considered, in order to deduce theorems of convergence for their decompositions. First the $\sigma$-additive case is studied, without particular assumptions on the filter; later the…

Functional Analysis · Mathematics 2015-08-12 Domenico Candeloro , Anna Rita Sambucini

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

In this note we are concerned with the validity of an uncountable analogue of a combinatorial lemma due to Vlastimil Pt\'ak. We show that the validity of the result for $\omega_1$ can not be decided in ZFC alone. We also provide a…

Functional Analysis · Mathematics 2020-06-09 Petr Hájek , Tommaso Russo

We prove that the consistency of the existence of a Dowker filter at $\kappa^+$ along with $2^\kappa=\kappa^+$ where $\kappa$ is regular and uncountable. Using Magidor forcing we also prove the consistency of the existence of a Dowker…

Logic · Mathematics 2020-06-25 Shimon Garti , Yair Hayut

We study the classes of filters F on N such that the weak and strong F-convergence of sequences in l1 coincide. We study also an analogue of l1 weak sequential completeness theorem for filter convergence.

Functional Analysis · Mathematics 2009-03-05 Antonio Avilés , Bernardo Cascales , Vladimir Kadets , Alexander Leonov

The \emph{Filter Dichotomy} says that every uniform nonmeager filter on the integers is mapped by a finite-to-one function to an ultrafilter. The consistency of this principle was proved by Blass and Laflamme. A function between topological…

Logic · Mathematics 2010-09-02 Paul B. Larson

It is shown that there exists a complete, atomless, sigma-centered Boolean algebra, which does not contain any regular countable subalgebra if and only if there exist a nowhere dense ultrafilter. Therefore the existence of such algebras is…

Logic · Mathematics 2016-09-07 Aleksander Błaszczyk , Saharon Shelah