{
  "id": "1704.03898",
  "version": "v1",
  "published": "2017-04-12T18:51:04.000Z",
  "updated": "2017-04-12T18:51:04.000Z",
  "title": "Forcing in Ramsey theory",
  "authors": [
    "Natasha Dobrinen"
  ],
  "comment": "17 pages, Expository article",
  "categories": [
    "math.LO",
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-04-12T18:51:04.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "03C15",
      "03E02",
      "03E05",
      "03E75",
      "05C05",
      "03E45"
    ],
    "keywords": [
      "ramsey theory",
      "determine big ramsey degrees",
      "dense subsets forming topological ramsey",
      "subsets forming topological ramsey spaces",
      "contain dense subsets"
    ],
    "tags": [
      "expository article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 17,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}