Combinatorics on ideals and forcing with trees

DOI10.2307/2274351zbMATH Open0646.03048OpenAlexW4239531530MaRDI QIDQ3789553FDOQ3789553

Authors Marcia Groszek 

Publication date 1987

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

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

zbMATH Keywords

treesforcingminimal degreesalmost disjoint codingdegrees of constructibilityLaver-type posetsSacks-type posets

Mathematics Subject Classification ID

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

Recommendations

• On Tree Ideals
• Strolling through paradise
• scientific article; zbMATH DE number 13056
• Generic trees
• Mathias-Prikry and Laver-Prikry type forcing

Cited in

(16)

• scientific article; zbMATH DE number 3884145 (Why is no real title available?)
• Maximal almost disjoint families, determinacy, and forcing
• Forcing with filters and complete combinatorics
• Mathias-Prikry and Laver type forcing; summable ideals, coideals, and \(+\)-selective filters
• Uncountable superperfect forcing and minimality
• Filter-Laver measurability
• Fresh function spectra
• Distributivity and minimality in perfect tree forcings for singular cardinals
• Generic trees
• scientific article; zbMATH DE number 13056 (Why is no real title available?)
• Norms on possibilities. I. Forcing with trees and creatures
• On Tree Ideals
• Strolling through paradise
• scientific article; zbMATH DE number 2185227 (Why is no real title available?)
• On slow minimal reals I
• The Cichoń diagram for degrees of relative constructibility

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

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