English
Related papers

Related papers: Local Ramsey Spaces in Matet Forcing Extensions an…

200 papers

We show that in the model obtained by iteratively pseudo-intersecting a Ramsey ultrafilter via a length-$\omega_2$ countable support iteration of restricted Mathias forcing over a ground model satisfying $\textsf{CH}$, there is a unique…

Logic · Mathematics 2026-03-03 Lorenz Halbeisen , Silvan Horvath , Saharon Shelah

Topological Ramsey spaces are spaces which support infinite dimensional Ramsey theory similarly to the Ellentuck space. Each topological Ramsey space is endowed with a partial ordering which can be modified to a $\sigma$-closed `almost…

Logic · Mathematics 2018-05-23 Natasha Dobrinen

Ramsey theory and forcing have a symbiotic relationship. At the RIMS Symposium on Infinite Combinatorics and Forcing Theory in 2016, the author gave three tutorials on Ramsey theory in forcing. The first two tutorials concentrated on…

Logic · Mathematics 2020-04-27 Natasha Dobrinen

This paper investigates properties of $\sigma$-closed forcings which generate ultrafilters satisfying weak partition relations. The Ramsey degree of an ultrafilter $\mathcal{U}$ for $n$-tuples, denoted $t(\mathcal{U},n)$, is the smallest…

Logic · Mathematics 2019-11-22 Natasha Dobrinen , Sonia Navarro Flores

We show that the infinite-dimensional versions of Gowers' $\mathrm{FIN}_k$ and $\mathrm{FIN}_{\pm k}$ theorems can be parametrized by an infinite sequence of perfect subsets of $2^\omega$. To do so, we use ultra-Ramsey theory to obtain…

Combinatorics · Mathematics 2020-06-19 Jamal K. Kawach

W. T. Gower generalized Hindman's Finite sum theorem over $X_{k}=\left\{ \left(n_{1},n_{2},\ldots,n_{k}\right):n_{1}\neq0\right\} $ by showing that for any finite coloring of $X_{k}$ there exists a sequence such that the Gower subspace…

Combinatorics · Mathematics 2022-10-31 Sayan Goswami

We introduce the relation of "almost-reduction" in an arbitrary topological Ramsey space R, as a generalization of the relation of "almost-inclusion" on the space of infinite sets of natural numbers (the Ellentuck space). This leads us to a…

Logic · Mathematics 2010-08-31 Jose Mijares

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 main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…

Combinatorics · Mathematics 2021-07-08 Piotr Szewczak

We prove an effective version of the inverse theorem for the Gowers $U^3$-norm for functions supported on high-rank quadratic level sets in finite vector spaces. For configurations controlled by the $U^3$-norm (complexity-two…

Combinatorics · Mathematics 2024-09-13 Sean Prendiville

In this paper we continue the study of equivalence of generics filters started by Smythe in [Smy22]. We fully characterize those forcing posets for which the corresponding equivalence of generics is smooth using the purely topological…

Logic · Mathematics 2026-01-19 Filippo Calderoni , Dima Sinapova

Henle, Mathias, and Woodin proved that, provided that $\omega\rightarrow(\omega)^{\omega}$ holds in a model $M$ of ZF, then forcing with $([\omega]^{\omega},\subseteq^*)$ over $M$ adds no new sets of ordinals, thus earning the name a…

Logic · Mathematics 2023-06-22 Natasha Dobrinen , Daniel Hathaway

We prove that \textsf{P}-points (even strong P-points) and Gruff ultrafilters exist in any forcing extension obtained by adding fewer than $\aleph_{\omega}% $-many random reals to a model of \textsf{CH. }These results improve and correct…

Logic · Mathematics 2025-09-18 Alan Dow , Osvaldo Guzmán

We extend the results of arXiv:1808.01509 on nonamalgamable forcing extensions to families of posets with wide projections. We also use a different coding method to obtain nonamalgamable extensions by filter-based Mathias forcing.

Logic · Mathematics 2025-05-29 Miha E. Habič , Charles Weng , Cathy Zhang

Selective ultrafilters are characterized by many equivalent properties, in particular the Ramsey property that every finite colouring of unordered pairs of integers has a homogeneous set in U, and the equivalent property that every function…

Logic · Mathematics 2011-06-09 Marco Forti

We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded…

Logic · Mathematics 2025-02-25 Zalán Molnár

We give a characterizations of Ramsey ultrafilters on $\mathscr P(\omega)$ in terms of functions $f:\omega^n\to\omega$ and their ultrafilter extensions. To do this, we prove that for any partition $\mathcal P$ of $[\omega]^n$ there is a…

Logic · Mathematics 2022-03-25 N. L. Polyakov

We introduce a new class of ultrafilters which generalizes the well-known class of simple $P$-point ultrafilters. We prove that for any well-founded $\sigma$-directed partial order $\mathbb{D}$ there is a mild forcing extension where there…

Logic · Mathematics 2026-04-02 Tom Benhamou , James Cummings , Gabriel Goldberg , Yair Hayut , Alejandro Poveda

We prove an infinite-dimensional version of an approximate Ramsey theorem of Gowers, initially used to show that every Lipschitz function on the unit sphere of $c_0$ is oscillation stable. To do so, we use the theory of ultra-Ramsey spaces…

Combinatorics · Mathematics 2019-05-23 Jamal K. Kawach

By using nonstandard analysis, and in particular iterated hyper-extensions, we give foundations to a peculiar way of manipulating ultrafilters on the natural numbers and their pseudo-sums. The resulting formalism is suitable for…

Logic · Mathematics 2013-09-02 Mauro Di Nasso
‹ Prev 1 2 3 10 Next ›