Definable MAD families and forcing axioms
From MaRDI portal
Publication:2660156
DOI10.1016/j.apal.2020.102909zbMath1477.03207arXiv1912.12815OpenAlexW3092888922WikidataQ114682921 ScholiaQ114682921MaRDI QIDQ2660156
Vera Fischer, Thilo Weinert, David Schrittesser
Publication date: 29 March 2021
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.12815
Descriptive set theory (03E15) Consistency and independence results (03E35) Large cardinals (03E55) Generic absoluteness and forcing axioms (03E57)
Related Items (1)
Cites Work
- The bounded proper forcing axiom and well orderings of the reals
- Some exact equiconsistency results in set theory
- Infinite combinatorics and definability
- Set theory. An introduction to independence proofs
- Bounded forcing axioms as principles of generic absoluteness
- Definability and almost disjoint families
- A basis theorem for \(\sum^ 1_ 3\) sets of reals
- Proper forcing and remarkable cardinals II
- BPFA and projective well-orderings of the reals
- Semi-proper forcing, remarkable cardinals, and Bounded Martin's Maximum
- Happy families
- Proper Forcing and Remarkable Cardinals
- HAPPY AND MAD FAMILIES INL(ℝ)
- The bounded proper forcing axiom
- The Ramsey property implies no mad families
- Transfinite inductions producing coanalytic sets
- Σ12 and Π11 Mad Families
- PFA implies ADL(ℝ)
- Internal cohen extensions
- SET MAPPING REFLECTION
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Definable MAD families and forcing axioms