Joint Laver diamonds and grounded forcing axioms

arXiv1705.04422MaRDI QIDQ6286575FDOQ6286575

Publication date: 11 May 2017

Abstract: I explore two separate topics: the concept of jointness for set-theoretic guessing principles, and the notion of grounded forcing axioms. A family of guessing sequences is said to be joint if all of its members can guess any given family of targets independently and simultaneously. I primarily investigate jointness in the case of various kinds of Laver diamonds. In the case of measurable cardinals I show that, while the assertions that there are joint families of Laver diamonds of a given length get strictly stronger with increasing length, they are all equiconsistent. This is contrasted with the case of partially strong cardinals, where we can derive additional consistency strength, and ordinary diamond sequences, where large joint families exist whenever even one diamond sequence does. Grounded forcing axioms modify the usual forcing axioms by restricting the posets considered to a suitable ground model. I focus on the grounded Martin's axiom which states that Martin's axioms holds for posets coming from some ccc ground model. I examine the new axiom's effects on the cardinal characteristics of the continuum and show that it is quite a bit more robust under mild forcing than Martin's axiom itself.

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35) Large cardinals (03E55) Generic absoluteness and forcing axioms (03E57)

This page was built for publication: Joint Laver diamonds and grounded forcing axioms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6286575)