Perfect-set forcing for uncountable cardinals

From MaRDI portal
Publication:3900055

DOI10.1016/0003-4843(80)90021-2zbMath0453.03056OpenAlexW1969653411MaRDI QIDQ3900055

Akihiro Kanamori

Publication date: 1980

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(80)90021-2




Related Items (38)

A lifting argument for the generalized Grigorieff forcingHIGHER INDEPENDENCEMinimalα-hyperdegreesInadmissible forcingCichoń's diagram for uncountable cardinalsEaston's theorem in the presence of Woodin cardinalsMore about \(\lambda \)-support iterations of \((<\lambda)\)-complete forcing notionsNon-trivial automorphisms of \({\mathcal {P}}({\mathbb {N}})/[{\mathbb {N}}^{<\aleph _0}\) from variants of small dominating number] ⋮ Indestructibility of some compactness principles over models of \(\mathsf{PFA} \)Baire numbers, uncountable Cohen sets and perfect-set forcingA definable failure of the singular cardinal hypothesisINDESTRUCTIBILITY OF THE TREE PROPERTYStrong independence and its spectrumPerfect tree forcings for singular cardinalsPERFECT SUBSETS OF GENERALIZED BAIRE SPACES AND LONG GAMESGlobal singularization and the failure of SCHIndependence of Boolean algebras and forcing.Saturation Properties of Ideals in Generic Extensions. Iκ-stationary subsets of , infinitary games, and distributive laws in Boolean algebrasDEFINABLE MINIMAL COLLAPSE FUNCTIONS AT ARBITRARY PROJECTIVE LEVELSEaston's theorem and large cardinalsA Laver-like indestructibility for hypermeasurable cardinalsThe higher Cichoń diagramThe tree property at ℵω+2Some recent developments in higher recursion theorySimple complete Boolean algebrasSmall universal families for graphs omitting cliques without GCHEaston's theorem and large cardinals from the optimal hypothesisUNCOUNTABLE TREES AND COHEN -REALSJOINT DIAMONDS AND LAVER DIAMONDSSheva-sheva-sheva: large creaturesRegularity properties on the generalized realsAn inner model for global dominationThe tree property at the \(\aleph_{2 n}\)'s and the failure of SCH at \(\aleph_\omega\)Perfect trees and elementary embeddingsFinite combinations of Baire numbersThe last forcing standing with diamondsHIGHER MILLER FORCING MAY COLLAPSE CARDINALS




This page was built for publication: Perfect-set forcing for uncountable cardinals