Splitting families of sets in ZFC

DOI10.1016/J.AIM.2014.10.015MaRDI QIDQ475276zbMATH OpenOpenAlexFDO

Authors Menachem Kojman

Publication date 26 November 2014

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1209.1307

zbMATH Keywords

family of setsfiltrationsproperty Bgeneralized continuum hypothesisconflict-free numberdisjoint refinementessentially disjoint familyMiller's theoremShelah's revised GCHZVCLöwenheim-Skolem theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63) Other combinatorial set theory (03E05) Ordered sets and their cofinalities; pcf theory (03E04) Applications of set theory (03E75)

Abstract: Miller's 1937 splitting theorem was proved for pairs of cardinals $(,ho)$ in which $n$ is finite and $ho$ is infinite. An extension of Miller's theorem is proved here in ZFC for pairs of cardinals $(u,ho)$ in which $u$ is arbitrary and $$. The proof uses a new general method that is based on Shelah's revises Generalized Continuum Hypothesis theorem. Upper bounds on conflict-free coloring numbers of families of sets and a general comparison theorem follow as corollaries of the main theorem. Other corollaries eliminate the use of additional axioms from splitting theorems due to Erdos, Hajnal, Komjath, Juhasz and Shelah.

Recommendations

• Splitting Strongly Almost Disjoint Families
• Splittings
• About splitting numbers
• Splitting families and complete separability
• scientific article; zbMATH DE number 3475449

Cites work

• scientific article; zbMATH DE number 5354045 (Why is no real title available?)
• Comparing almost-disjoint families
• Conflict free colorings of (strongly) almost disjoint set-systems
• Conflict free colorings of nonuniform systems of infinite sets
• Essentially disjoint families, conflict free colorings and Shelah's revised GCH
• Extender based forcings
• Families close to disjoint ones
• More on cardinal arithmetic
• On a property of families of sets
• Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings
• Splitting Strongly Almost Disjoint Families
• The generalized continuum hypothesis revisited

Cited in

(12)

• Infinite combinatorics plain and simple
• Erdős and set theory
• Towers and clubs
• The secret life of \(\mu\)-clubs
• scientific article; zbMATH DE number 1802825 (Why is no real title available?)
• Two-cardinal diamond and games of uncountable length
• Splitting Strongly Almost Disjoint Families
• When \(P_\kappa(\lambda)\) (vaguely) resembles \(\kappa\)
• Higher Souslin trees and the GCH, revisited
• scientific article; zbMATH DE number 3475449 (Why is no real title available?)
• Some consistency results on density numbers
• On the arithmetic of density

This page was built for publication: Splitting families of sets in ZFC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475276)