English
Related papers

Related papers: More forcing notions imply diamond

200 papers

We show explicit formulas for the evaluation of (possibly higher-order) fractional Laplacians of some functions supported on ellipsoids. In particular, we derive the explicit expression of the torsion function and give examples of…

Analysis of PDEs · Mathematics 2020-09-22 Nicola Abatangelo , Sven Jarohs , Alberto Saldaña

We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma$-Prikry. We show that given…

Logic · Mathematics 2020-05-27 Alejandro Poveda , Assaf Rinot , Dima Sinapova

We prove that any countable support iteration formed with posets with $\omega_2$-p.i.c.\ has $\omega_2$-c.c., assuming CH in the ground model and assuming also that $\omega_1$ is not collapsed. This improves earlier results of Shelah by…

Logic · Mathematics 2016-09-07 Chaz Schlindwein

Dynamo action in planetary cores has been extensively studied in the context of convectively-driven flows. We show in this letter that mechanical forcings, namely tides, libration and precession, are also able to kinematically sustain a…

Fluid Dynamics · Physics 2018-11-07 K. Sandeep Reddy , Benjamin Favier , Michael Le Bars

In this paper, following an idea of Christophe Chalons, I propose a new kind of forcing axiom, the Maximality Principle, which asserts that any sentence phi holding in some forcing extension V^P and all subsequent extensions V^P*Q holds…

Logic · Mathematics 2007-05-23 Joel David Hamkins

We prove forcing axiom equivalents of two families of weakenings of the axiom of choice: a trichotomy principle for cardinals isolated by L\'evy, ${\rm H\hskip0.05pt}_\kappa$, and ${\rm DC}_\kappa$, the principle of dependent choices…

Logic · Mathematics 2025-02-19 Diego Lima Bomfim , Charles Morgan , Samuel Gomes da Silva

A recent experiment [K. C. Lee et al., Science 334, 1253 (2011)] succeeded in detecting entanglement between two macroscopic specks of diamonds, separated by a macroscopic distance, at room temperature. This impressive results is a further…

Quantum Physics · Physics 2016-07-20 S. Belli , R. Bonsignori , G. D'Auria , L. Fant , M. Martini , S. Peirone , S. Donadi , A. Bassi

We generalize the diamond principle and its variants using the notion of stationarity in trees introduced by Brodsky in [Brodsky, A. M., A theory of stationary trees and the balanced Baumgartner--Hajnal--Todorcevic theorem for trees. The…

Logic · Mathematics 2026-02-17 Osvaldo Guzmán , Carlos López-Callejas

Under some cardinal arithmetic assumptions, we prove that every stationary subset of lambda of a right cofinality has the weak diamond. This is a strong negation of uniformization. We then deal with a weaker version of the weak diamond-…

Logic · Mathematics 2007-05-23 Saharon Shelah

We study the generalized dominating number $\mathfrak{d}_{\mu}$ at a singular cardinal $\mu$ of cofinality $\kappa$. We show two lower bounds: in ZFC, $\mathrm{cf}([\mu]^\kappa,\subseteq) \leq \mathfrak{d}_{\mu}$, and under mild…

Logic · Mathematics 2025-08-19 Yusuke Hayashi

Addressing a question of Paul Larson we prove the following statement. If Chang's conjecture fails, Martin's axiom holds and the continuum is greater than $\aleph_2$, there are no weakly Laver ideals over $\aleph_1$. We also prove that…

Logic · Mathematics 2025-03-21 Shimon Garti

We investigate various strong notions of rigidity for Souslin trees, separating them under Diamond into a hierarchy. Applying our methods to the automorphism tower problem in group theory, we show under Diamond that there is a group whose…

Logic · Mathematics 2016-08-16 Joel David Hamkins , Gunter Fuchs

We study the question of when a given countable ordinal $\alpha$ is $\Sigma^1_n$- or $\Pi^1_n$-reflecting in models which are neither $\mathsf{PD}$ models nor the constructible universe, focusing on generic extensions of $L$. We prove,…

Logic · Mathematics 2023-11-22 Juan P. Aguilera , Corey Bacal Switzer

For a relational structure ${\mathbb X}$ we investigate the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X}):=\{ f[X]: f\in \mathop{\rm Emb}\nolimits ({\mathbb X})\}$. Here we consider…

Logic · Mathematics 2024-04-24 Miloš S. Kurilić

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

Logic in Computer Science · Computer Science 2024-04-26 Hashimoto Go , Daniel Găină , Ionuţ Ţuţu

We continue the development of the theory of construction schemes over $\omega_1$ as introduced by the third author by studying their relation with forcing axioms. Formally, we introduce the cardinals $\mathfrak{m}^n_{\mathcal{F}}$ and use…

Logic · Mathematics 2025-09-03 Jorge Antonio Cruz Chapital , Osvaldo Guzman , Stevo Todorcevic

We study the spectrum of forcing notions between the iterations of $\sigma$-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of $\alpha$-proper forcings for indecomposable countable ordinals as well as…

Logic · Mathematics 2011-02-14 David Aspero , Sy-David Friedman , Miguel Angel Mota , Marcin Sabok

Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction of the formula. Such solvers conclude that a formula is…

Logic in Computer Science · Computer Science 2015-06-05 Liana Hadarean , Alex Horn , Tim King

Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…

Logic · Mathematics 2026-03-19 Saharon Shelah

Hamkins and L\"{o}we asked whether there can be a model $N$ of set theory with the property that $N\equiv N[g]$ whenever $g$ is a generic collapse of a cardinal of $N$ onto $\omega$. We give equiconsistency results for two weaker versions…

Logic · Mathematics 2024-07-10 Mohammad Golshani , William Mitchell