English
Related papers

Related papers: (Weak) diamond can fail at the least inaccessible …

200 papers

We show that Weak Vop\v{e}nka's Principle, which is the statement that the opposite category of ordinals cannot be fully embedded into the category of graphs, is equivalent to the large cardinal principle Ord is Woodin, which says that for…

Logic · Mathematics 2020-01-27 Trevor M. Wilson

We introduce combinatorial principles that characterize strong compactness and supercompactness for inaccessible cardinals but also make sense for successor cardinals. Their consistency is established from what is supposedly optimal.…

Logic · Mathematics 2010-12-10 Christoph Weiß

The work presents the second part of the second edition of its previous one published in 2000 under the same title, containing the proof (in ZF) of the inaccessible cardinals nonexistence, which is enriched and improved now. This part…

Logic · Mathematics 2011-10-13 A. Kiselev

We produce a model where every supercompact cardinal is $C^{(1)}$-supercompact with inaccessible targets. This is a significant improvement of the main identity-crises configuration obtained in \cite{HMP} and provides a definitive answer to…

Logic · Mathematics 2024-06-19 Alejandro Poveda

We deal with the combinatorial principle Weak Diamond, showing that we always either a local version is not saturated or we can increase the number of colours. Then we point out a model theoretic consequence of Weak Diamond.

Logic · Mathematics 2021-08-10 Saharon Shelah

Recent results of Hindman, Leader and Strauss and of Fern\'andez-Bret\'on and Rinot showed that natural versions of Hindman's Theorem fail {\em for all} uncontable cardinals. On the other hand, Komj\'ath proved a result in the positive…

Combinatorics · Mathematics 2025-06-12 Lorenzo Carlucci

The second author has recently shown ([20]) that any selectively (a) almost disjoint family must have cardinality strictly less than $2^{\alpeh_0}$, so under the Continuum Hypothesis such a family is necessarily countable. However, it is…

General Topology · Mathematics 2016-09-20 Charles J. G. Morgan , Samuel G. Da Silva

The work presents the first part of second edition of the previous edition of 2000 under the same title containing the proof (in ZF) of the nonexistence of inaccessible cardinals, now enriched and improved. This part contains the apparatus…

Logic · Mathematics 2011-10-13 A. Kiselev

We pursue the idea of generalizing Hindman's Theorem to uncountable cardinalities, by analogy with the way in which Ramsey's Theorem can be generalized to weakly compact cardinals. But unlike Ramsey's Theorem, the outcome of this paper is…

Combinatorics · Mathematics 2018-03-16 David J. Fernández-Bretón

We introduce the notion of weakly extendible cardinals and show that these cardinals are characterized in terms of weak compactness of second order logic. The consistency strength and largeness of weakly extendible cardinals are located…

Logic · Mathematics 2023-01-06 Sakaé Fuchino , Hiroshi Sakai

This paper establishes a number of constraints on the structure of large cardinals under strong compactness assumptions. These constraints coincide with those imposed by the Ultrapower Axiom, a principle that is expected to hold in Woodin's…

Logic · Mathematics 2020-07-10 Gabriel Goldberg

From a suitable large cardinal hypothesis, we provide a model with a supercompact cardinal in which universal indestructibility holds: every supercompact and partially supercompact cardinal kappa is fully indestructible by kappa-directed…

Logic · Mathematics 2007-05-23 Arthur W. Apter , Joel David Hamkins

In the first part of the manuscript, we establish several consistency results concerning Woodin's $\HOD$ hypothesis and large cardinals around the level of extendibility. First, we prove that the first extendible cardinal can be the first…

Logic · Mathematics 2024-11-07 Gabriel Goldberg , Jonathan Osinski , Alejandro Poveda

A version of Woodin's HOD dichotomy is proved assuming the existence of just one strongly compact cardinal.

Logic · Mathematics 2021-02-19 Gabriel Goldberg

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 show that if the existence of a supercompact cardinal $\kappa$ with a weakly compact cardinal $\lambda$ above $\kappa$ is consistent, then the following are consistent as well (where $\mathfrak{t}(\kappa)$ and $\mathfrak{u}(\kappa)$ are…

Logic · Mathematics 2025-04-28 Radek Honzik , Sarka Stejskalova

Introducing unfoldable cardinals last year, Andres Villaveces ingeniously extended the notion of weak compactness to a larger context, thereby producing a large cardinal notion, unfoldability, with some of the feel and flavor of weak…

Logic · Mathematics 2007-05-23 Joel David Hamkins

Motivated by recent work of Boney, Dimopoulos, Gitman and Magidor, we characterize the existence of weak compactness cardinals for all abstract logics through combinatorial properties of the class of ordinals. This analysis is then used to…

Logic · Mathematics 2025-05-22 Philipp Lücke

Our aim is to improve the negative results i.e. non-existence of limit models, and the failure of the generic pair property from math.LO/0609636 to inaccessible lambda as promised there. The motivation is that in [Sh:F756] the positive…

Logic · Mathematics 2011-01-06 Saharon Shelah

A club consisting of former regulars is added to an inaccessible cardinal, without changing cofinalities outside it. The initial assumption is optimal. A variation of the Radin forcing without a top measurable cardinal is introduced for…

Logic · Mathematics 2022-06-14 Moti Gitik , Sittinon Jirattikansakul