Splitting families of sets in ZFC

DOI10.1016/j.aim.2014.10.015zbMath1343.03037arXiv1209.1307OpenAlexW2964171406MaRDI QIDQ475276

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

Miller's theoremfiltrationsfamily of setsproperty Bgeneralized continuum hypothesisconflict-free numberdisjoint refinementessentially disjoint familyLöwenheim-Skolem theoremShelah's revised GCHZVC

Mathematics Subject Classification ID

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

Related Items (9)

On the arithmetic of density ⋮ The secret life of \(\mu\)-clubs ⋮ Higher Souslin trees and the GCH, revisited ⋮ When \(P_\kappa(\lambda)\) (vaguely) resembles \(\kappa\) ⋮ Some consistency results on density numbers ⋮ ERDŐS AND SET THEORY ⋮ INFINITE COMBINATORICS PLAIN AND SIMPLE ⋮ Towers and clubs ⋮ Two-cardinal diamond and games of uncountable length

Cites Work

• Unnamed Item
• Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings
• Conflict free colorings of nonuniform systems of infinite sets
• Families close to disjoint ones
• Comparing almost-disjoint families
• More on cardinal arithmetic
• Conflict free colorings of (strongly) almost disjoint set-systems
• The generalized continuum hypothesis revisited
• Essentially disjoint families, conflict free colorings and Shelah's revised GCH
• Splitting Strongly Almost Disjoint Families
• Extender based forcings
• On a property of families of sets

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