Abstract.
We show that Bounded Forcing Axioms (for instance, Martin's Axiom, the Bounded Proper Forcing Axiom, or the Bounded Martin's Maximum) are equivalent to principles of generic absoluteness, that is, they assert that if a \(\Sigma_1\) sentence of the language of set theory with parameters of small transitive size is forceable, then it is true. We also show that Bounded Forcing Axioms imply a strong form of generic absoluteness for projective sentences, namely, if a \(\Sigma^1_3\) sentence with parameters is forceable, then it is true. Further, if for every real x, \(x^{\sharp}\) exists, and the second uniform indiscernible is less than \(\omega_2\), then the same holds for \(\Sigma^1_4\) sentences.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 20 February 1998
Rights and permissions
About this article
Cite this article
Bagaria, J. Bounded forcing axioms as principles of generic absoluteness. Arch Math Logic 39, 393–401 (2000). https://doi.org/10.1007/s001530050154
Issue Date:
DOI: https://doi.org/10.1007/s001530050154