Canonical models for \(\aleph_1\)-combinatorics

DOI10.1016/S0168-0072(98)00022-0zbMath0935.03055arXivmath/9806166WikidataQ115970361 ScholiaQ115970361MaRDI QIDQ1302295

Jindřich Zapletal, Saharon Shelah

Publication date: 2 May 2000

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9806166

zbMATH Keywords

forcingdeterminacycombinatorics of \(\aleph_1\)

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Cardinal characteristics of the continuum (03E17) Other aspects of forcing and Boolean-valued models (03E40) Determinacy principles (03E60)

Related Items (13)

ℙ_max variations for separating club guessing principles ⋮ A microscopic approach to Souslin-tree construction. II ⋮ A microscopic approach to Souslin-tree constructions. I. ⋮ \(\mathrm{PFA}(S)[S\) and locally compact normal spaces] ⋮ Souslin algebra embeddings ⋮ Local coherence. ⋮ PFA(S) and countable tightness ⋮ More on weak diamond ⋮ Saturation, Suslin trees and meager sets ⋮ Terminal notions in set theory ⋮ Katetov’s problem ⋮ Hereditarily normal manifolds of dimension greater than one may all be metrizable ⋮ \(P\)-points in \(\mathbb Q_{\max}\) models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Can you take Solovay's inaccessible away?
• Partitioning pairs of countable ordinals
• Proper forcing
• A \({\Delta{}}^ 2_ 2\) well-order of the reals and incompactness of \(L(Q^{MM})\)
• On the consistency of Borel's conjecture
• The axiom of determinacy, forcing axioms, and the nonstationary ideal
• Embeddings of Cohen algebras
• Semi-Cohen Boolean algebras
• Combinatorial aspects of measure and category
• Connections between different amoeba algebras
• Supercompact cardinals, sets of reals, and weakly homogeneous trees
• Souslin forcing
• Partition Problems in Topology
• SOUSLIN'S PROBLEM

This page was built for publication: Canonical models for \(\aleph_1\)-combinatorics