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

Recommendations

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

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)

Cited In (14)

• Title not available (Why is that?)
• Generic trees
• Mathias-Prikry and Laver type forcing; summable ideals, coideals, and \(+\)-selective filters
• Distributivity and minimality in perfect tree forcings for singular cardinals
• On slow minimal reals I
• Maximal almost disjoint families, determinacy, and forcing
• Forcing with filters and complete combinatorics
• Uncountable superperfect forcing and minimality
• On Tree Ideals
• Title not available (Why is that?)
• The Cichoń diagram for degrees of relative constructibility
• Filter-Laver measurability
• Fresh function spectra
• Title not available (Why is that?)

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)