English
Related papers

Related papers: The choiceless cardinals are inconsistent

200 papers

We prove the following consistency result for cardinal sequences of length $< \om_3$: if GCH holds and $\la \geq \om_2$ is a regular cardinal, then in some cardinal-preserving generic extension $2^{\om} = \la$ and for every ordinal $\eta <…

Logic · Mathematics 2018-10-29 Juan Carlos Martínez , Lajos Soukup

Usuba has asked whether the $\kappa$-mantle, the intersection of all grounds that extend to $V$ via a forcing of size ${<}\kappa$, is always a model of ZFC. We give a negative answers by constructing counterexamples where $\kappa$ is a…

Logic · Mathematics 2024-03-15 Andreas Lietz

In this paper, without the axiom of choice, we show that if a certain downward L\"owenheim-Skolem property holds then all grounds are uniformly definable. We also prove that the axiom of choice is forceable if and only if the universe is a…

Logic · Mathematics 2020-01-07 Toshimichi Usuba

We investigate the asymptotic densities of theorems provable in Zermelo-Fraenkel set theory ZF and its extension ZFC including the axiom of choice. Assuming a canonical De Bruijn representation of formulae, we construct asymptotically large…

Logic · Mathematics 2021-01-26 Maciej Bendkowski

We deal with relatives of GCH which are provable. In particular we deal with rank version of the revised GCH. Our motivation was to find such results when only weak versions of the axiom of choice are assumed but some of the results gives…

Logic · Mathematics 2010-03-03 Saharon Shelah

We introduce a natural generalization of Borel's Conjecture. For each infinite cardinal number $\kappa$, let {\sf BC}$_{\kappa}$ denote this generalization. Then ${\sf BC}_{\aleph_0}$ is equivalent to the classical Borel conjecture.…

Logic · Mathematics 2012-07-06 Fred Galvin , Marion Scheepers

In this paper it is introduced a generic large cardinal akin to I0, and its consequences are analyzed in the case that $\aleph_\omega$ is such a generic large cardinal. In this case $\aleph_\omega$ is J\'{o}nsson, and in a choiceless inner…

Logic · Mathematics 2017-12-19 Vincenzo Dimonte

Let P be a distinguished unary predicate and K= {M: M a model of cardinality aleph_n with P^M of cardinality aleph_0}. We prove that consistently for n=4, for some countable first order theory T we have: T has no model in K whereas every…

Logic · Mathematics 2007-05-23 Saharon Shelah

Based upon the axiom of choice it is proved that the cardinality of the rational numbers is not less than the cardinality of the irrational numbers. This contradicts a main result of transfinite set theory and shows that the axiom of choice…

General Mathematics · Mathematics 2009-09-29 W. Mueckenheim

We isolate a new preservation class of Suslin forcings and prove several associated consistency results in the choiceless theory ZF+DC regarding countable chromatic numbers of various Borel hypergraphs.

Logic · Mathematics 2021-03-19 Jindrich Zapletal

The sequential form of a statement $\forall\xi(B(\xi) \rightarrow \exists\zeta A(\xi,\zeta))$ is the statement $\forall\xi(\forall n B(\xi_n) \rightarrow \exists\zeta \forall n A(\xi_n,\zeta_n))$. There are many classically true statements…

Logic · Mathematics 2016-02-10 François G. Dorais

We develop a version of Cichon's diagram for cardinal invariants on the generalized Cantor space 2^kappa or the generalized Baire space kappa^kappa where kappa is an uncountable regular cardinal. For strongly inaccessible kappa, many of the…

Logic · Mathematics 2016-11-28 Joerg Brendle , Andrew Brooke-Taylor , Sy-David Friedman , Diana Montoya

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 prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e. the cofinality of lambda^lambda is strictly bigger than cov(meagre_lambda), i.e. the minimal number of nowhere dense subsets of…

Logic · Mathematics 2022-09-07 Saharon Shelah

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

We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e., the cofinality of ^{lambda}lambda, is strictly bigger than cov_lambda(meagre), i.e. the minimal number of nowhere dense subsets of…

Logic · Mathematics 2020-02-25 Saharon Shelah

It is well-known that the consistency strength of the GCH failing at a measurable cardinal is the existence of a cardinal $\kappa$ with $o(\kappa)=\kappa^{++}$. As the literature does not contain more than a proof sketch of the lower bound…

Logic · Mathematics 2025-01-03 Connor Watson

We prove that consistently there is a singular cardinal $\kappa$ of uncountable cofinality such that $2^\kappa$ is weakly inaccessible, and every regular cardinal strictly between $\kappa$ and $2^\kappa$ is the character of some uniform…

Logic · Mathematics 2019-07-30 James Cummings , Charles Morgan

In this note, we present a puzzle. We prove that Zermelo-Fraenkel set theory is inconsistent by proving, using Zermelo-Fraenkel set theory, the false statement that any algorithm that determines whether any $n \times n$ matrix over $\mathbb…

Computational Complexity · Computer Science 2014-10-08 Craig Alan Feinstein

Using the proof-program (Curry-Howard) correspondence, we give a new method to obtain models of ZF and relative consistency results in set theory. We show the relative consistency of ZF + DC + there exists a sequence of subsets of R the…

Logic · Mathematics 2015-07-01 Jean-Louis Krivine
‹ Prev 1 3 4 5 6 7 10 Next ›