Some counterexamples in the partition calculus
From MaRDI portal
Other combinatorial set theory (03E05) Consistency and independence results (03E35) Continuum hypothesis and Martin's axiom (03E50) Permutations, words, matrices (05A05) Combinatorial aspects of partitions of integers (05A17) Directed graphs (digraphs), tournaments (05C20) Partial orders, general (06A06)
Cites work
- A partition calculus in set theory
- scientific article; zbMATH DE number 3336797 (Why is no real title available?)
- scientific article; zbMATH DE number 3361883 (Why is no real title available?)
- On a problem of Erdös and Tarski
- Partially Ordered Sets
- Partition Relations and Transitivity Domains of Binary Relations
- Partition relations for cardinal numbers
- The Voting Problem
- Trees
Cited in
(16)- Isomorphism types of Aronszajn trees
- On the consistency of some partition theorems for continuous colorings, and the structure of \(\aleph _ 1\)-dense real order types
- Mathematical problems and games
- Partitioning pairs of countable ordinals
- Martin's axiom does not imply that every two \(chi_ 1-\)dense sets of reals are isomorphic
- Very strongly rigid Boolean algebras, continuum discrete set condition, countable antichain condition. I
- Some partitions of three-dimensional combinatorial cubes
- Was Ulam right? I: basic theory and subnormal ideals
- scientific article; zbMATH DE number 3933984 (Why is no real title available?)
- A Partition Theorem For Perfect Sets
- Canonical Borel equivalence relations on R^n
- Developments from Ernst Specker's work in set theory
- Weak Partition Relations
- Strong failures of higher analogs of Hindman's theorem
- Unavoidable structures in infinite tournaments
- The Erdős-Hajnal problem list
This page was built for publication: Some counterexamples in the partition calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2562856)
