English
Related papers

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

200 papers

We consider natural cardinal invariants hm_n and prove several duality theorems, saying roughly: if I is a suitably definable ideal and provably cov(I)>=hm_n, then non(I) is provably small. The proofs integrate the determinacy theory,…

Logic · Mathematics 2007-05-23 Saharon Shelah , Jindrich Zapletal

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

Remarkable cardinals were introduced by Schindler, who showed that the existence of a remarkable cardinal is equiconsistent with the assertion that the theory of $L(\mathbb R)$ is absolute for proper forcing. Here, we study the…

Logic · Mathematics 2015-06-10 Yong Cheng , Victoria Gitman

An inaccessible cardinal $\kappa$ is supercompact when $(\kappa, \lambda)$-ITP holds for all $\lambda\geq \kappa.$ We prove that if there is a model of $\ZFC$ with two supercompact cardinals, then there is a model of \ZFC where…

Logic · Mathematics 2011-12-15 Laura Fontanella

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

We show that it is possible to add $\kappa^+-$Cohen subsets to $\kappa$ with a Prikry forcing over $\kappa$. This answers a question from \cite{HayutBenhanouGitik}. A strengthening of non-Galvin property is introduced. It is shown to be…

Logic · Mathematics 2024-05-22 Tom Benhamou , Moti Gitik

The rigid relation principle, introduced in this article, asserts that every set admits a rigid binary relation. This follows from the axiom of choice, because well-orders are rigid, but we prove that it is neither equivalent to the axiom…

Logic · Mathematics 2011-06-24 Joel David Hamkins , Justin Palumbo

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

We conjecture a general upper bound on the strength of gravity relative to gauge forces in quantum gravity. This implies, in particular, that in a four-dimensional theory with gravity and a U(1) gauge field with gauge coupling g, there is a…

High Energy Physics - Theory · Physics 2010-04-06 Nima Arkani-Hamed , Lubos Motl , Alberto Nicolis , Cumrun Vafa

We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all…

Logic · Mathematics 2014-11-11 Moti Gitik , Ralf Schindler , Saharon Shelah

Many of the most common reverse Easton iterations found in the large cardinal context, such as the Laver preparation, admit a gap at some small delta in the sense that they factor as P*Q, where P has size less than delta and Q is forced to…

Logic · Mathematics 2007-05-23 Joel David Hamkins

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

A new large-cardinal property is introduced which enables one to give a relative consistency proof of restricted versions of the reflection principles discussed by Tait in his essay "Constructing Cardinals from Below".

Logic · Mathematics 2013-01-08 Rupert McCallum

Chaitin's incompleteness theorem states that sufficiently rich formal systems cannot prove lower bounds on Kolmogorov complexity. In this paper we extend this theorem by showing theories that prove the Kolmogorov complexity of a large (but…

Computational Complexity · Computer Science 2023-06-06 Samuel Epstein

We prove that large cardinals need not generally exhibit their large cardinal nature in HOD. For example, a supercompact cardinal $\kappa$ need not be weakly compact in HOD, and there can be a proper class of supercompact cardinals in $V$,…

Logic · Mathematics 2020-12-22 Yong Cheng , Sy-David Friedman , Joel David Hamkins

Answering a question of Usuba, we show that an extendible cardinal can be preserved by a set forcing that is not a small forcing.

Logic · Mathematics 2021-08-17 Gabriel Goldberg

An example is given of a UFD which has infinitely generated Derksen invariant. The ring is \textquotedblleft almost rigid\textquotedblright\ meaning that the Derksen invariant is equal to the Makar-Limanov invariant. Techniques to show that…

Algebraic Geometry · Mathematics 2007-06-29 David Finston , Stefan Maubach

We show that it is equiconsistent with $\mathsf{ZF}$ that Fodor's lemma fails everywhere, and furthermore that the club filter on every regular cardinal is not even $\sigma$-complete. Moreover, these failures can be controlled in a very…

Logic · Mathematics 2018-05-15 Asaf Karagila

Let $B$ be a finite, separable von Neumann algebra. We prove that a $B$-valued distribution $\mu$ that is the weak limit of an infinitesimal array is infinitely divisible. The proof of this theorem utilizes the Steinitz lemma and may be…

Operator Algebras · Mathematics 2011-11-08 John D. Williams

This paper explores various generalizations of the Mitchell order focusing mostly on a generalization called the internal relation. The internal relation lacks the implicit strength requirement in the definition of the Mitchell order, and…

Logic · Mathematics 2018-10-15 Gabriel Goldberg