ダウンロード数: 61
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
2042-02.pdf | 1.99 MB | Adobe PDF | 見る/開く |
タイトル: | FORCING IN RAMSEY THEORY (Infinite Combinatorics and Forcing Theory) |
著者: | Dobrinen, Natasha |
キーワード: | 05C15 03C15 03E02 03E05 03E75 05C05 03E45 |
発行日: | Jul-2017 |
出版者: | 京都大学数理解析研究所 |
誌名: | 数理解析研究所講究録 |
巻: | 2042 |
開始ページ: | 17 |
終了ページ: | 33 |
抄録: | 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 Rarnsey 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 a previous paper [5]. 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. |
URI: | http://hdl.handle.net/2433/236939 |
出現コレクション: | 2042 無限組合せ論と強制法理論 |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。