A partition relation for partially ordered sets
From MaRDI portal
Publication:1325962
DOI10.1007/BF00383172zbMATH Open0792.03030OpenAlexW2034189925MaRDI QIDQ1325962FDOQ1325962
Publication date: 15 May 1994
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00383172
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Set theory. An introduction to independence proofs
- Combinatorial set theory: Partition relations for cardinals
- Forcing Positive Partition Relations
- Partition relations for partially ordered sets
- Some Remarks on Real-Valued Measurable Cardinals
- A large cardinal in the constructible universe
- Weak versions of Ramsey's theorem
- Meager-nowhere dense games. I: \(n\)-tactics
Cited In (14)
- Realizing partitions respecting full and partial order information
- A Partition Theorem for Scattered Order Types
- A characteristic condition for simple partial ordering relations
- Partitioned binary relations
- Partition relations on a plain product order type
- Erdős-Kakutani phenomena for paths
- Infinite monochromatic paths and a theorem of Erdős-Hajnal-Rado
- Meager nowhere-dense games (IV): n-tactics (continued)
- Title not available (Why is that?)
- Cardinals of countable cofinality and eventual domination
- Title not available (Why is that?)
- Relatively coherent sets as a hierarchical partition method
- Partition Relations and Transitivity Domains of Binary Relations
- Meager-nowhere dense games. I: \(n\)-tactics
This page was built for publication: A partition relation for partially ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1325962)