English
Related papers

Related papers: Approximating diamond principles on products at an…

200 papers

The landmark Levy-Solovay Theorem limits the kind of large cardinal embeddings that can exist in a small forcing extension. Here I announce a generalization of this theorem to a broad new class of forcing notions. One consequence is that…

Logic · Mathematics 2007-05-23 Joel David Hamkins

We consider the following dichotomy for $\Sigma^0_2$ finitary relations $R$ on analytic subsets of the generalized Baire space for $\kappa$: either all $R$-independent sets are of size at most $\kappa$, or there is a $\kappa$-perfect…

Logic · Mathematics 2016-09-16 Dorottya Sziráki , Jouko Väänänen

We determine the large cardinal consistency strength of the existence of a $\lambda$-supercompact cardinal $\kappa$ such that GCH fails at $\lambda$. Indeed, we show that the existence of a $\lambda$-supercompact cardinal $\kappa$ such that…

Logic · Mathematics 2012-07-27 Brent Cody

Relative to class many supercompact cardinals, we construct a model of $\ZFC+\GCH$ where for every singular cardinal $\delta$ of countable cofinality and every regular uncountable $\mu<\delta$ there are stationarily many non-approachable…

Logic · Mathematics 2026-04-27 Hannes Jakob

Starting with two supercompact cardinals we produce a generic extension of the universe in which a principle that we call ${\rm GM}^+(\omega_3,\omega_1)$ holds. This principle implies ${\rm ISP}(\omega_2)$ and ${\rm ISP}(\omega_3)$, and…

Logic · Mathematics 2019-05-21 Rahman Mohammadpour , Boban Velickovic

We strengthen the revised GCH theorem by showing, e.g., that for lambda=cf(lambda)>beth_omega, for all but finitely many regular kappa<beth_omega, lambda is accessible on cofinality kappa in a weak version of it holds. In particular,…

Logic · Mathematics 2007-05-23 Saharon Shelah

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

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

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

We show the existence of Lipschitz-free spaces verifying the Point of Continuity Property with arbitrarily high weak-fragmentability index. For this purpose, we use a generalized construction of the countably branching diamond graphs. As a…

Functional Analysis · Mathematics 2025-04-25 Estelle Basset

Mittag-Leffler modules occur naturally in algebra, algebraic geometry, and model theory, [18], [12], [17]. If $R$ is a non-right perfect ring, then it is known that in contrast with the classes of all projective and flat modules, the class…

Rings and Algebras · Mathematics 2016-12-06 Jan Šaroch

For an inaccessible cardinal $\kappa$, the super tree property (ITP) at $\kappa$ holds if and only if $\kappa$ is supercomact. However, just like the tree property, it can hold at successor cardinals. We show that ITP holds at the successor…

Logic · Mathematics 2018-06-05 Sherwood Hachtman , Dima Sinapova

It is proved that if there exists a Luzin set, or if either the stick principle or diamond(b) hold, then a strong instance of the guessing principle $\clubsuit_{AD}$ holds at the first uncountable cardinal. In particular, any of the above…

Logic · Mathematics 2022-09-22 Assaf Rinot , Roy Shalev , Stevo Todorcevic

Smallish large cardinals $\kappa$ are often characterized by the existence of a collection of filters on $\kappa$, each of which is an ultrafilter on the subsets of $\kappa$ of some transitive $\mathrm{ZFC}^-$-model of size $ \kappa$. We…

Logic · Mathematics 2021-05-14 Erin Carmody , Victoria Gitman , Miha E. Habič

Inspired by a problem proposed by Mahler, we will address the following related question, 'How well can irrationals in a missing digit set be approximated by rationals with polynomial denominators?' and prove some related results. To…

Number Theory · Mathematics 2025-12-11 James Wyatt

We use a reverse Easton forcing iteration to obtain a universe with a definable well-ordering, while preserving the GCH and proper classes of a variety of very large cardinals. This is achieved by coding using the principle diamond star at…

Logic · Mathematics 2012-02-28 Andrew D. Brooke-Taylor

We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, if $\lambda^{++}$…

Logic · Mathematics 2019-08-15 Chris Lambie-Hanson , Assaf Rinot

We study the formation and decay of electron-hole droplets in diamonds at both low and high temperatures under different excitations by master equations. The calculation reveals that at low temperature the kinetics of the system behaves as…

Materials Science · Physics 2007-05-23 J. H. Jiang , M. W. Wu , M. Nagai , M. Kuwata-Gonokami

The purpose of this article is to give new constructions of linear orders which are minimal with respect to being non-$\sigma$-scattered. Specifically, we will show that Jensen's principle $\diamondsuit$ implies that there is a minimal…

Logic · Mathematics 2023-11-07 Todd Eisworth , James Cummings , Justin Tatch Moore

We study the complexity of computing (and approximating) VC Dimension and Littlestone's Dimension when we are given the concept class explicitly. We give a simple reduction from Maximum (Unbalanced) Biclique problem to approximating VC…

Computational Complexity · Computer Science 2022-11-04 Pasin Manurangsi
‹ Prev 1 3 4 5 6 7 10 Next ›