A partition theorem for a large dense linear order-Reference-Cited by-同舟云学术

A partition theorem for a large dense linear order

Published:2009-06 Issue:1 Volume:171 Page:237-284
ISSN:0021-2172
Container-title:Israel Journal of Mathematics
language:en
Short-container-title:Isr. J. Math.

Author:

Džamonja M.,Larson J. A.,Mitchell W. J.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/s11856-009-0049-2.pdf

Reference25 articles.

1. M. D. André, Sur les permutations alternée, Journal de Mathematiques Pure et Appliquées 7 (1881), 167–184.

2. D. C. Devlin, Some partition theorems and ultrafilters on ω, Ph.D. thesis, Dartmouth College, 1979.

3. M. Džamonja, J. A. Larson, and W. J. Mitchell, A partition theorem for a large random graph, Archive for Mathematical Logic, accepted; see also the last two sections of arXiv:math.LO/0506123, circulated in 2005.

4. M. Džamonja and K. Thompson, A poset hierarchy, Central European Journal of Mathematics 4 (2006), no. 2, 1–18.

5. M. Gitik, Measurability preserved by κ-complete forcing notions, manuscript 6.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. POLISH SPACE PARTITION PRINCIPLES AND THE HALPERN–LÄUCHLI THEOREM;The Journal of Symbolic Logic;2024-01-19

2. The Ramsey theory of Henson graphs;Journal of Mathematical Logic;2022-12-17

3. Higher-dimensional Delta-systems;Order;2022-04-30

4. Monochromatic sumset without large cardinals;Fundamenta Mathematicae;2020

5. FORCING AND THE HALPERN–LÄUCHLI THEOREM;The Journal of Symbolic Logic;2019-09-09