A Partition Theorem for Triples
From MaRDI portal
DOI10.2307/2046243zbMATH Open0617.03024OpenAlexW4243767158MaRDI QIDQ4726239FDOQ4726239
Authors: Karel Prikry, Eric C. Milner
Publication date: 1986
Full work available at URL: https://doi.org/10.2307/2046243
Recommendations
Other combinatorial set theory (03E05) Total orders (06A05) Continuum hypothesis and Martin's axiom (03E50)
Cites Work
Cited In (12)
- ω 3 ω 1 →(ω 3 ω 1 , 3) 2 Requires an Inaccessible
- Partitioning triples and partially ordered sets
- Even more on partitioning triples of countable ordinals
- A New Proof of the Strong Partition Relation on ω 1
- Title not available (Why is that?)
- A bijective proof of a theorem on 3-core partitions
- Partition Relations for ηα -sets
- Choiceless Ramsey theory of linear orders
- A partition relation for triples using a model of Todorčević
- More on partitioning triples of countable ordinals
- A short proof of a partion relation for triples
- Standard Jordan partitions with three parameters
This page was built for publication: A Partition Theorem for Triples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4726239)