Separating Subversion Forcing Axioms
Hiroshi Sakai, Corey Bacal Switzer

TL;DR
This paper introduces variants of forcing axioms and develops techniques to demonstrate their non-implications, revealing that certain strong axioms do not imply others like Martin's Maximum.
Contribution
It presents a general method for proving non-implications among forcing axioms and applies it to show specific independence results.
Findings
SCFA does not imply MA^+(σ-closed)
SubPFA does not imply Martin's Maximum
Developed a technique for non-implication proofs
Abstract
We study a family of variants of Jensen's\emph{subcomplete forcing axiom}, and \emph{subproper forcing axiom}, . Using these we develop a general technique for proving non-implications of , and their relatives and give several applications. For instance we show that does not imply -closed and does not imply Martin's Maximum.
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
TopicsPhilosophy and Theoretical Science · Logic, Reasoning, and Knowledge · Advanced Topology and Set Theory
