Combinatorics on ideals and forcing with trees

DOI10.2307/2274351zbMath0646.03048OpenAlexW4239531530MaRDI QIDQ3789553

Marcia J. Groszek

Publication date: 1987

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274351

zbMATH Keywords

forcingminimal degreestreesalmost disjoint codingdegrees of constructibilityLaver-type posetsSacks-type posets

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Axiomatics of classical set theory and its fragments (03E30) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (8)

Mathias-Prikry and Laver type forcing; summable ideals, coideals, and \(+\)-selective filters ⋮ Uncountable superperfect forcing and minimality ⋮ Filter-Laver measurability ⋮ Maximal almost disjoint families, determinacy, and forcing ⋮ On slow minimal reals I ⋮ Fresh function spectra ⋮ The Cichoń diagram for degrees of relative constructibility ⋮ Unnamed Item

This page was built for publication: Combinatorics on ideals and forcing with trees