Our main result states that a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give some results concerning cardinal characteristics of the σ-ideals determined by those universality parameters.

We present a method to iterate finitely splitting lim-sup tree forcings along non-wellfounded linear orders. As an application, we introduce a new method to force (weak) measurability of all definable sets with respect to a certain (non-ccc) ideal.

We show that the non-existence of mad families is equiconsistent with \, answering an old question of Mathias. We also consider the above result in the general context of maximal independent sets in Borel graphs, and we construct a Borel graph G such that \ “there is no maximal independent set in G” is equiconsistent with \ “there exists an inaccessible cardinal”.