Rado's conjecture and its Baire version
Jing Zhang

TL;DR
This paper explores the consistency and implications of Rado's Conjecture and its Baire version, demonstrating their compatibility with certain forcing axioms and analyzing their impact on reflection principles and partition relations.
Contribution
It establishes the consistency of the Baire Rado's Conjecture with a fragment of PFA and investigates its consequences and limitations in set theory.
Findings
Baire Rado's Conjecture is compatible with a fragment of PFA.
Baire Rado's Conjecture does not imply Rado's Conjecture.
The influence of Rado's Conjecture on polarized partition relations was analyzed.
Abstract
Rado's Conjecture is a compactness/reflection principle that says any nonspecial tree of height has a nonspecial subtree of size . Though incompatible with Martin's Axiom, Rado's Conjecture turns out to have many interesting consequences that are consequences of forcing axioms. In this paper, we obtain consistency results concerning Rado's Conjecture and its Baire version. In particular, we show a fragment of PFA, that is the forcing axiom for \emph{Baire Indestructibly proper forcings}, is compatible with the Baire Rado's Conjecture. As a corollary, Baire Rado's Conjecture does not imply Rado's Conjecture. Then we discuss the strength and limitations of the Baire Rado's Conjecture regarding its interaction with simultaneous stationary reflection and some families of weak square principles. Finally we investigate the influence of the Rado's Conjecture on some…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Limits and Structures in Graph Theory
