Forcing in Ramsey theory
From MaRDI portal
Publication:6285449
arXiv1704.03898MaRDI QIDQ6285449FDOQ6285449
Publication date: 12 April 2017
Abstract: 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 forcings which contain dense subsets forming topological Ramsey spaces. These forcings motivated the development of new Ramsey theory, which then was applied to the generic ultrafilters to obtain the precise structure Rudin-Keisler and Tukey orders below such ultrafilters. The content of the first two tutorials has appeared in an expository article submitted to the SEALS 2016 Proceedings. The third tutorial concentrated on uses of forcing to prove Ramsey theorems for trees which are applied to determine big Ramsey degrees of homogeneous relational structures. This is the focus of this paper.
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Partition relations (03E02) Other combinatorial set theory (03E05) Model theory of denumerable and separable structures (03C15) Applications of set theory (03E75) Inner models, including constructibility, ordinal definability, and core models (03E45)
This page was built for publication: Forcing in Ramsey theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6285449)
