English
Related papers

Related papers: Fodor's lemma can fail everywhere

200 papers

We force the Axiom of Choice over the least initial segment of a Nairian model satisfying ZF. In the forcing extension, square_kappa fails at all uncountable cardinals kappa, and every regular cardinal is omega-strongly measurable in HOD,…

Logic · Mathematics 2026-02-16 Douglas Blue , Paul Larson , Grigor Sargsyan

We show that Kelley-Morse set theory does not prove the class Fodor principle, the assertion that every regressive class function $F:S\to\text{Ord}$ defined on a stationary class $S$ is constant on a stationary subclass. Indeed, it is…

Logic · Mathematics 2021-07-12 Victoria Gitman , Joel David Hamkins , Asaf Karagila

Starting from large cardinals we construct a model of $ZFC$ in which the $GCH$ fails everywhere, but such that $GCH$ holds in its $HOD$. The result answers a question of Sy Friedman. Also, relative to the existence of large cardinals, we…

Logic · Mathematics 2015-12-22 Mohammad Golshani

Justin Moore's weak club-guessing principle $\mho$ admits various possible generalizations to the second uncountable cardinal. One of them was shown to hold in ZFC by Shelah. A stronger one was shown to follow from several consequences of…

Logic · Mathematics 2024-07-29 Ido Feldman

Given a cardinal $\kappa$ that is $\lambda$-supercompact for some regular cardinal $\lambda\geq\kappa$ and assuming $\GCH$, we show that one can force the continuum function to agree with any function $F:[\kappa,\lambda]\cap\REG\to\CARD$…

Logic · Mathematics 2013-09-12 Brent Cody , Menachem Magidor

A partition is finitary if all its members are finite. For a set $A$, $\mathscr{B}(A)$ denotes the set of all finitary partitions of $A$. It is shown consistent with $\mathsf{ZF}$ (without the axiom of choice) that there exist an infinite…

Logic · Mathematics 2023-09-04 Guozhen Shen

In this paper, we consider certain cardinals in ZF (set theory without AC, the Axiom of Choice). In ZFC (set theory with AC), given any cardinals C and D, either C <= D or D <= C. However, in ZF this is no longer so. For a given infinite…

Logic · Mathematics 2016-09-06 Lorenz Halbeisen , Saharon Shelah

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…

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

We introduce a model-theoretic characterization of Magidor cardinals, from which we infer that Magidor filters are beyond ZFC-inconsistency

Logic · Mathematics 2017-06-30 Shimon Garti , Yair Hayut , Saharon Shelah

We construct a model of the form $L[A,U]$ that exhibits the simplest structural behavior of $\sigma$-complete ultrafilters in a model of set theory with a single measurable cardinal $\kappa$ , yet satisfies $2^\kappa = \kappa^{++}$. This…

Logic · Mathematics 2024-12-10 Omer Ben-Neria , Eyal Kaplan

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…

Logic · Mathematics 2007-05-23 Arthur W. Apter

We show that the theory ZFC-, consisting of the usual axioms of ZFC but with the power set axiom removed-specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every…

Logic · Mathematics 2015-08-05 Victoria Gitman , Joel David Hamkins , Thomas A. Johnstone

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

Logic in Computer Science · Computer Science 2017-01-03 Minseong Kim

We prove that the class of all ordinals Ord is not weakly compact with respect to definable classes. Specifically, in any model of ZFC, the definable tree property fails for Ord, in that there is a definable Ord tree with no definable…

Logic · Mathematics 2017-10-27 Ali Enayat , Joel David Hamkins

We answer a question of Usuba by showing that the combinatorial principle $UB_\lambda$ can fail at a singular cardinal. Furthermore, $\lambda$ can be taken to be $\aleph_\omega.$

Logic · Mathematics 2023-10-27 Mohammad Golshani , Saharon Shelah

We give two results on guessing unbounded subsets of lambda^+. The first is a positive result and applies to the situation of lambda regular and at least equal to aleph_3, while the second is a negative consistency result which applies to…

Logic · Mathematics 2007-05-23 Mirna Džamonja , Saharon Shelah

Chang's Conjecture (CC) asserts that for every $F:[\omega_2]^{<\omega} \to \omega_2$, there exists an $X$ that is closed under $F$ such that $|X|=\omega_1$ and $|X \cap \omega_1| =\omega$. By classic results of Silver and Donder, CC is…

Logic · Mathematics 2019-08-30 Sean Cox , Saharon Shelah

We investigate whether the ultrafilter number function $\kappa \mapsto \mathfrak{u}(\kappa)$ on the cardinals is monotone, that is, whether $\mathfrak{u}(\lambda) \le \mathfrak{u}(\kappa)$ holds for all cardinals $\lambda < \kappa$ or not.…

Logic · Mathematics 2025-11-24 Toshimichi Usuba

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

A set theory is developed based on the approximations of sets and denoted by AS. In AS the set of all sets exists but the argument for Russell's and Cantor's paradox fail. The Axioms of Separation, Replacement and Foundation are not valid.…

General Mathematics · Mathematics 2009-04-15 Slavko Rede
‹ Prev 1 2 3 10 Next ›