Hypergraphs and proper forcing

DOI10.1142/S0219061319500077zbMath1477.03190arXiv1710.10650MaRDI QIDQ4973027

Jindřich Zapletal

Publication date: 29 November 2019

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphproper forcing

Mathematics Subject Classification ID

Descriptive set theory (03E15) Other combinatorial set theory (03E05) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (1)

Subadditive families of hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite games and \(\sigma\)-porosity
• Borel chromatic numbers
• Topology and descriptive set theory
• Cardinal invariants of closed graphs
• Canonical Ramsey Theory on Polish Spaces
• Weak Borel chromatic numbers
• Combinatorial Dichotomies in Set Theory
• Forcing Properties of Ideals of Closed Sets
• n–localization property
• Descriptive set theory and definable forcing
• CONTINUOUS RAMSEY THEORY ON POLISH SPACES AND COVERING THE PLANE BY FUNCTIONS
• Properness Without Elementaricity
• BASIS THEOREMS FOR NON-POTENTIALLY CLOSED SETS AND GRAPHS OF UNCOUNTABLE BOREL CHROMATIC NUMBER
• Analytic countably splitting families

This page was built for publication: Hypergraphs and proper forcing