English
Related papers

Related papers: Forcing axioms, approachability, and stationary se…

200 papers

In the reversible Schrodinger-Newton equation a complex Newton coupling G*exp(-i*alpha) is proposed in place of G. The equation becomes irreversible and all initial one-body states are expected to converge to solitonic stationary states.…

Quantum Physics · Physics 2009-08-17 Lajos Diósi , Tibor Norbert Papp

In this note, we investigate iterations of consistency, local and uniform reflection over $\mathbf{HA}$ (Heyting Arithmetic). In the case of uniform reflection, we give a new proof of Dragalin's extension of Feferman's completeness theorem…

Logic · Mathematics 2026-03-11 Emanuele Frittaion

In this paper we prove an approximate continuity result for stochastic differential equations with normal reflections in domains satisfying Saisho's conditions, which together with the Wong-Zakai approximation result completes the support…

Probability · Mathematics 2016-06-07 Jiagang Ren , Jing Wu

We prove the undecidability of MSO on $\omega$-words extended with the second-order predicate $U_1(X)$ which says that the distance between consecutive positions in a set $X \subseteq \mathbb{N}$ is unbounded. This is achieved by showing…

Logic in Computer Science · Computer Science 2023-06-22 Mikołaj Bojańczyk , Laure Daviaud , Bruno Guillon , Vincent Penelle , A. V. Sreejith

In this article we proved so-called strong reflection principles corresponding to formal theories Th which has omega-models. An posible generalization of the Lob's theorem is considered.Main results is: (1) let $k$ be an inaccessible…

General Mathematics · Mathematics 2019-10-08 Jaykov Foukzon

We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).

Logic · Mathematics 2007-05-23 Saharon Shelah

We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…

Logic in Computer Science · Computer Science 2018-11-28 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

We study the notion of tightly stationary sets which was introduced by Foreman and Magidor in \cite{ForMag-MS}. We obtain two consistency results which show that it is possible for a sequence of regular cardinals $( \kappa_n )_{n < \omega}$…

Logic · Mathematics 2017-10-10 Omer Ben-Neria

We prove exponential convergence to the stationary measure for a class of 1d Lagrangian systems with random forcing in the space-periodic setting: $$ \phi_t+\phi_x^2/2=F^{\omega}, x \in S^1 = \mathbb{R}/\mathbb{Z}. $$ This confirms a part…

Dynamical Systems · Mathematics 2016-08-05 Alexandre Boritchev

A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set-forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class-forcing extension which…

Logic · Mathematics 2007-05-23 Jonas Reitz

Elastic quantum bound-state reflection from a hard-wall boundary provides direct information regarding the structure and compressibility of quantum bound states. We discuss elastic quantum bound-state reflection and derive a general theory…

Nuclear Theory · Physics 2013-01-18 Michelle Pine , Dean Lee

Based on the work of Shelah, Kellner, and T\u{a}nasie (Fund. Math., 166(1-2):109-136, 2000 and Comment. Math. Univ. Carolin., 60(1):61-95, 2019), and the recent developments in the third author's master's thesis, we develop a general theory…

Logic · Mathematics 2024-10-24 Miguel A. Cardona , Diego A. Mejía , Andrés F. Uribe-Zapata

We introduce bounded category forcing axioms for well-behaved classes $\Gamma$. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe $H_{\lambda_\Gamma^+}$ modulo…

Logic · Mathematics 2021-01-11 David Aspero , Matteo Viale

We present a direct construction of stationary set preserving forcings that make $\omega$-cofinal all the members of some arbitrary set $\mathcal{K}$ of regular cardinals $\kappa > \omega_1$. In addition, it is made possible to ensure that…

Logic · Mathematics 2025-10-29 Ben De Bondt , Boban Velickovic

We introduce an iteration of forcing notions satisfying the countable chain condition with minimal damage to a strong coloring. Applying this method, we prove that Martin's axiom is strictly stronger than its restriction to forcing notions…

Logic · Mathematics 2024-06-21 Yinhe Peng

The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…

Combinatorics · Mathematics 2021-04-13 Brian Rabern , Landon Rabern

We give a new proof of the decidability of reachability in alternating pushdown systems, showing that it is a simple consequence of a cut-elimination theorem for some natural-deduction style inference systems. Then, we show how this result…

Logic in Computer Science · Computer Science 2014-10-31 Gilles Dowek , Ying Jiang

Linear response theory has developed into a formidable set of tools for studying the forced behaviour of a large variety of systems - including out of equilibrium ones. In this paper we provide a new angle on the problem, by studying under…

Statistical Mechanics · Physics 2018-10-17 Valerio Lucarini

Force-based multiphysics coupling methods have become popular since they provide a simple and efficient coupling mechanism, avoiding the difficulties in formulating and implementing a consistent coupling energy. They are also the only known…

Numerical Analysis · Mathematics 2011-04-12 Mitchell Luskin , Christoph Ortner

Just as Lascar's notion of abstract rank axiomatizes the U-rank, we propose axioms for the ranks $SU^d$ and $SU^f$, the foundation ranks of dividing and forking. We study the relationships between these axioms. As with superstable, we…

Logic · Mathematics 2022-02-15 Santiago Cárdenas-Martín , Rafel Farré