English
Related papers

Related papers: Proper forcing and rectangular Ramsey theorems

200 papers

We present a new, category theoretic point of view on finite Ramsey theory. Our aims are as follows: -- to define the category theoretic notions needed for the development of finite Ramsey Theory, -- to state, in terms of these notions, the…

Combinatorics · Mathematics 2022-05-24 Sławomir Solecki

We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…

Logic · Mathematics 2014-06-13 John Krueger , Miguel Angel Mota

We show a general scheme of Ramsey-type results for partitions of countable sets of finite functions, where "one piece is big" is interpreted in the language originating in creature forcing. The heart of our proofs follows Glazer's proof of…

Logic · Mathematics 2015-03-17 Andrzej Roslanowski , Saharon Shelah

The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…

Logic in Computer Science · Computer Science 2007-05-23 Thomas Colcombet

We introduce Gowers--Matet forcing with a finite sequence of pairwise non-isomorphic Ramsey ultrafilters over $\omega$, and with this forcing we settle the long-standing problem of the spectrum of numbers near-coherence classes. We prove…

Logic · Mathematics 2019-07-31 Heike Mildenberger

In this note we consider a Ramsey type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao.

Combinatorics · Mathematics 2016-08-19 Andrii Arman , Vojtěch Rödl

This work extends the Ibragimov's conservation theorem for partial differential equations [{\it J. Math. Anal. Appl. 333 (2007 311-328}] to under determined systems of differential equations. The concepts of adjoint equation and formal…

Analysis of PDEs · Mathematics 2015-05-20 Mahouton Norbert Hounkonnou , Pascal Dkengne Sielenou

We study the relations under Weihrauch reducibility of the well-ordering preservation principle for the operator $X \mapsto X^\omega$ and the Ordered Ramsey Theorem. Both principles are known to be equivalent to $\Sigma^0_2$-induction in…

Logic · Mathematics 2025-11-27 Lorenzo Carlucci , Giordano Celli

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…

Logic · Mathematics 2019-03-27 David Fernández-Bretón , Elizabeth Lauri

It is well known that pretameness implies the forcing theorem, and that pretameness is characterized by the preservation of the axioms of $\mathsf{ZF}^-$, that is $\mathsf{ZF}$ without the power set axiom, or equivalently, by the…

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

The principle of open class determinacy is preserved by pre-tame class forcing, and after such forcing, every new class well-order is isomorphic to a ground-model class well-order. Similarly, the principle of elementary transfinite…

Logic · Mathematics 2018-07-02 Joel David Hamkins , W. Hugh Woodin

We define typical forcings encompassing many informal forcing arguments in bounded arithmetic and give general conditions for such forcings to produce models of the universal variant of relativized $T^1_2$. We apply this result to study the…

Logic · Mathematics 2020-12-17 Moritz Müller

In the parlance of relational structures, the Finite Ramsey Theorem states that the class of all finite chains has the Ramsey property. A classical result of J. Ne\v{s}et\v{r}il and V. R\"{o}dl claims that the class of all finite posets…

Combinatorics · Mathematics 2019-04-09 Nemanja Draganić , Dragan Mašulović

We introduce the notion of a {\it semi-retraction}. Given two structures $\A$ and $\B$, $\A$ is a semi-retraction of $\B$ if there exist quantifier-free type respecting maps $f: \B \raw \A$ and $g: \A \raw \B$ such that $f \circ g$ is an…

Logic · Mathematics 2020-11-03 Lynn Scow

We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and…

Logic in Computer Science · Computer Science 2015-07-01 Patrick Bahr

We show that there exist two proper creature forcings having a simple (Borel) definition, whose product is not proper. We also give a new condition ensuring properness of some forcings with norms.

Logic · Mathematics 2014-02-26 Andrzej Roslanowski , Saharon Shelah , Otmar Spinas

We prove that finite partial orders with a linear extension form a Ramsey class. Our proof is based on the fact that class of acyclic graphs has the Ramsey property and uses the partite construction.

Combinatorics · Mathematics 2017-03-03 Jaroslav Nešetřil , Vojtěch Rödl

We investigate the effects of various forcings on several forms of the Halpern-L\"auchli Theorem. For inaccessible $\kappa$, we show they are preserved by forcings of size less than $\kappa$. Combining this with work of Zhang in…

Logic · Mathematics 2019-05-21 Natasha Dobrinen , Dan Hathaway

In this paper we provide purely categorical proofs of two important results of structural Ramsey theory: the result of M.\ Soki\'c that the free product of Ramsey classes is a Ramsey class and the result of M.\ Bodirsky, M.\Pinsker and T.\…

Category Theory · Mathematics 2023-01-18 Dragan Mašulović

We prove a general Ramsey theorem for trees with a successor operation. This theorem is a common generalization of the Carlson-Simpson Theorem and the Milliken Tree Theorem for regularly branching trees. Our theorem has a number of…