Skip to main content
Log in

Bounded forcing axioms as principles of generic absoluteness

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 20 February 1998

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001530050154

Keywords

Navigation