Some counterexamples in the partition calculus

DOI10.1016/S0097-3165(73)80004-4zbMath0267.04006WikidataQ124935436 ScholiaQ124935436MaRDI QIDQ2562856

Fred Galvin, Saharon Shelah

Publication date: 1973

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Consistency and independence results (03E35) Continuum hypothesis and Martin's axiom (03E50) Directed graphs (digraphs), tournaments (05C20) Other combinatorial set theory (03E05)

Related Items (14)

Some partitions of three-dimensional combinatorial cubes ⋮ Mathematical problems and games ⋮ Partitioning pairs of countable ordinals ⋮ Canonical Borel equivalence relations on \(\mathbb R^n\) ⋮ A Partition Theorem For Perfect Sets ⋮ Martin's axiom does not imply that every two \(chi_ 1-\)dense sets of reals are isomorphic ⋮ Strong failures of higher analogs of Hindman’s theorem ⋮ Very strongly rigid Boolean algebras, continuum discrete set condition, countable antichain condition. I ⋮ Developments from Ernst Specker's work in set theory ⋮ Unnamed Item ⋮ Weak Partition Relations ⋮ Isomorphism types of Aronszajn trees ⋮ Was Ulam right? I: basic theory and subnormal ideals ⋮ On the consistency of some partition theorems for continuous colorings, and the structure of \(\aleph _ 1\)-dense real order types

Cites Work

• Unnamed Item
• Unnamed Item
• A partition calculus in set theory
• The Voting Problem
• On a problem of Erdös and Tarski
• Partition relations for cardinal numbers
• Partition Relations and Transitivity Domains of Binary Relations
• Trees
• Partially Ordered Sets

This page was built for publication: Some counterexamples in the partition calculus