English
Related papers

Related papers: A note on the Revised GCH

200 papers

We provide a proof, in $ZFC$, of Shelah's eventual categoricity conjecture for abstract elementary classes (AEC's). Moreover, assuming in addition the Singular Cardinal Hypothesis ($SCH$), we prove a direct generalization to the more…

Logic · Mathematics 2022-04-14 Christian Espíndola

We analyze a natural function definable from a scale at a singular cardinal, and using this function we are able to obtain quite strong negative square-brackets partition relations at successors of singular cardinals. The proof of our main…

Logic · Mathematics 2008-06-02 Todd Eisworth

Accessible categories admit a purely category-theoretic replacement for cardinality: the internal size. Generalizing results and methods from arXiv:1708.06782, we examine set-theoretic problems related to internal sizes and prove several…

Logic · Mathematics 2019-06-06 Michael Lieberman , Jiří Rosický , Sebastien Vasey

We show that Shelah's Eventual Categoricity Conjecture follows from the existence of class many strongly compact cardinals. This is the first time the consistency of this conjecture has been proven. We do so by showing that every AEC with…

Logic · Mathematics 2014-05-15 Will Boney

Jech proved that every partially ordered set can be embedded into the cardinals of some model of $ZF$. We extend this result to show that every partially ordered set can be embedded into the cardinals of some model of $ZF+DC_{<\kappa}$ for…

Logic · Mathematics 2014-06-17 Asaf Karagila

In a self-contained way, we deal with revised countable support iterated forcing for the reals. We improve theorems on preservation of the property UP, weaker than semi proper, and we hopefully improve the presentation. We continue [Sh:b,…

Logic · Mathematics 2007-05-23 Saharon Shelah

We show that some cardinal arithmetic configurations related to the negation of the Shelah Weak Hypothesis and natural from the forcing point of view are impossible.

Logic · Mathematics 2007-05-23 Moti Gitik , Saharon Shelah

This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…

Logic · Mathematics 2020-08-12 Corey Bacal Switzer

We prove that for any dimension function $h$ with $h \prec x^d$ and for any countable set of linear patterns, there exists a compact set $E$ with $\mathcal{H}^h(E)>0$ avoiding all the given patterns. We also give several applications and…

Classical Analysis and ODEs · Mathematics 2017-12-13 Alexia Yavicoli

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

Our theme is that not every interesting question in set theory is independent of $ZFC$. We give an example of a first order theory $T$ with countable $D(T)$ which cannot have a universal model at $\aleph_1$ without CH; we prove in $ZFC$ a…

Logic · Mathematics 2009-09-25 Menachem Kojman , Saharon Shelah

We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…

Logic · Mathematics 2008-07-08 Saharon Shelah

We study the vanishing of (co)homology along ring homomorphisms for modules that admit certain filtrations, and generalize a theorem of O. Celikbas-Takahashi. Our work produces new classes of rigid and test modules, in particular over local…

Commutative Algebra · Mathematics 2024-08-07 Olgur Celikbas , Yongwei Yao

In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…

Logic · Mathematics 2024-12-11 Thierry Coquand , Henri Lombardi , Stefan Neuwirth

Let K be an Abstract Elemenetary Class satisfying the amalgamation and the joint embedding property, let \mu be the Hanf number of K. Suppose K is tame. MAIN COROLLARY: (ZFC) If K is categorical in a successor cardinal bigger than…

Logic · Mathematics 2007-05-23 Rami Grossberg , Monica VanDieren

This paper contributes to the theory of large cardinals beyond the Kunen inconsistency, or choiceless large cardinal axioms, in the context where the Axiom of Choice is not assumed. The first part of the paper investigates a periodicity…

Logic · Mathematics 2021-02-19 Gabriel Goldberg

An approach to universal (meta-)logical reasoning in classical higher-order logic is employed to explore and study simplifications of Kurt G\"odel's modal ontological argument. Some argument premises are modified, others are dropped, modal…

Logic in Computer Science · Computer Science 2020-06-16 Christoph Benzmüller

The theory ZFC implies the scheme that for every cardinal $\delta$ we can make $\delta$ many dependent choices over any definable relation without terminal nodes. Friedman, the first author, and Kanovei constructed a model of ZFC$^-$ (ZFC…

Logic · Mathematics 2023-09-27 Victoria Gitman , Richard Matthews

We discuss how singular can cardinals be in absence of the axiom of choice. We show that, contrasting with known negative consistency results (of Gitik and others), certain positive results are provable. Then we pose some problems.

Logic · Mathematics 2007-09-18 Denis I. Saveliev

The generic Vop\v{e}nka principle, we prove, is relatively consistent with the ordinals being non-Mahlo. Similarly, the generic Vop\v{e}nka scheme is relatively consistent with the ordinals being definably non-Mahlo. Indeed, the generic…

Logic · Mathematics 2018-04-17 Victoria Gitman , Joel David Hamkins