English
Related papers

Related papers: Proper forcing and rectangular Ramsey theorems

200 papers

In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms…

Logic · Mathematics 2024-11-20 Bokai Yao

By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…

Logic in Computer Science · Computer Science 2013-05-28 Murdoch J. Gabbay

In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.

Logic · Mathematics 2022-02-18 Rahman Mohammadpour

We study resonances of nonlinear systems of differential equations, including but not limited to the equations of motion of a particle moving in a potential. We use the calculus of variations to determine the minimal additive forcing…

Chaotic Dynamics · Physics 2009-08-27 Vadas Gintautas , Alfred W. Hubler

In this paper we provide proofs of two new theorems that provide a broad class of partition inequalities and that illustrate a na\"ive version of Andrews' anti-telescoping technique quite well. These new theorems also put to rest any notion…

Number Theory · Mathematics 2013-03-12 Alexander Berkovich , Keith Grizzell

We give some general criteria, when kappa-complete forcing preserves largeness properties -- like kappa-presaturation of normal ideals on lambda (even when they concentrate on small cofinalities). Then we quite accurately obtain the…

Logic · Mathematics 2016-09-06 Moti Gitik , 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

For models of concurrent and distributed systems, it is important and also challenging to establish correctness in terms of safety and/or liveness properties. Theories of distributed systems consider equivalences fundamental, since they (1)…

Logic in Computer Science · Computer Science 2017-12-01 Tobias Prehn , Stephan Mennicke

Given a topological Ramsey space $(\mathcal R,\leq, r)$, we extend the notion of semiselective coideal to sets $\mathcal H\subseteq\mathcal R$ and study conditions for $\mathcal H$ that will enable us to make the structure $(\mathcal…

Logic · Mathematics 2015-07-07 Carlos Di Prisco , Jose G. Mijares , Jesus Nieto

We introduce the forcing property "almost strong properness" which sits between properness and strong properness. As an application, we introduce a simple forcing with finite conditions to force $\rm MRP$.

Logic · Mathematics 2021-04-23 Rahman Mohammadpour

Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…

Logic · Mathematics 2026-05-08 Cesare Straffelini

We investigate two variants of splitting tree forcing, their ideals and regularity properties. We prove connections with other well-known notions, such as Lebesgue measurablility, Baire- and Doughnut-property and the Marczewski field.…

Logic · Mathematics 2020-04-24 Giorgio Laguzzi , Heike Mildenberger , Brendan Stuber-Rousselle

We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself),…

Logic · Mathematics 2017-10-31 Peter Holy , Regula Krapf , Philipp Schlicht

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

In this paper we investigate algebraic properties of big Ramsey degrees in categories satisfying some mild conditions. As the first nontrivial consequence of the generalization we advocate in this paper we prove that small Ramsey degrees…

Combinatorics · Mathematics 2025-11-27 Dragan Mašulović

We continue the study on sheaves of rings on finite posets. We present examples where the ring of global sections coincide with toric faces rings, quotients of a polynomial ring by a monomial ideal and algebras with straightening laws. We…

Commutative Algebra · Mathematics 2021-05-18 Morten Brun , Tim Roemer

In this paper, we study the classes of rings in which every proper (regular) ideal can be factored as an invertible ideal times a nonempty product of proper radical ideals. More precisely, we investigate the stability of these properties…

Commutative Algebra · Mathematics 2020-09-15 Malik Tusif Ahmed , Najib Mahdou , Youssef Zahir

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

Logic in Computer Science · Computer Science 2020-04-14 Patrick Cegielski , Serge Grigorieff , Irene Guessarian

This article discusses some recent trends in Ramsey theory on infinite structures. Trees and their Ramsey theory have been vital to these investigations. The main ideas behind the author's recent method of trees with coding nodes are…

Logic · Mathematics 2020-09-10 Natasha Dobrinen

Distributive laws are important for algebraic reasoning in arithmetic and logic. They are equally important for algebraic reasoning about concurrent programs. In existing theories such as Concurrent Kleene Algebra, only partial correctness…

Logic in Computer Science · Computer Science 2024-03-21 Larissa A. Meinicke , Ian J. Hayes