The authors study Martin's axiom (MA) restricted to all ccc partial orders which have a projective definition, denoted MA(proj). It is shown that, starting from a model of ZFC, MA(proj) can be forced by a finite-support iteration of ccc projective forcings. It is also shown that consistently MA(proj) is strictly weaker than MA. Several arguments for this are given, some of them, but not all, involving the existence of a weakly compact cardinal. E.g. the consistency of MA(proj) with the negation of CH and the existence of a Suslin tree is proved, assuming Con(ZF+ \(\exists \kappa\) weakly compact).
- A model of set-theory in which every set of reals is Lebesgue measurable
- Can you take Solovay's inaccessible away?
- Examples for Souslin forcing
- Forcings with ideals and simple forcing notions
- Fragments of Martin's axiom and \(\Delta_ 3^ 1\) sets of reals
- How special are Cohen and random forcings, i. e. Boolean algebras of the family of subsets of reals moduli meagre or null
- scientific article; zbMATH DE number 3652325 (Why is no real title available?)
- scientific article; zbMATH DE number 218600 (Why is no real title available?)
- scientific article; zbMATH DE number 797418 (Why is no real title available?)
- Independence results concerning the number of nowhere dense sets necessary to cover the real line
- Internal cohen extensions
- Iterated Cohen extensions and Souslin's problem
- Martin's axiom and the continuum
- Martin's axiom does not imply that every two \(chi_ 1-\)dense sets of reals are isomorphic
- Martin's axioms, measurability and equiconsistency results
- More on simple forcing notions and forcings with ideals
- Remarks on Martin's Axiom and the Continuum Hypothesis
- Set theory. An introduction to independence proofs
- sets of reals
- Some exact equiconsistency results in set theory
- Souslin forcing
- SOUSLIN'S PROBLEM
- Trees
- Proper forcing extensions and Solovay models
- Thin equivalence relations and inner models
- Preserving non-null with Suslin^+ forcings
- Generic absoluteness under projective forcing
- C.c.c. forcing without combinatorics
- Solovay models and forcing extensions
- The relative strengths of fragments of Martin's axiom
This page was built for publication: Projective forcing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365248)