Strong tree properties, Kurepa trees, and guessing models

DOI10.1007/s00605-023-01922-2arXiv2209.01925OpenAlexW4389001392MaRDI QIDQ6137883

Šárka Stejskalová, Chris Lambie-Hanson

Publication date: 16 January 2024

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

square principlesMitchell forcingguessing modelsKurepa treesgeneralized tree propertiestwo-cardinal combinatorics

Mathematics Subject Classification ID

Consistency and independence results (03E35) Large cardinals (03E55) Other combinatorial set theory (03E05)

Cites Work

• Unnamed Item
• Squares and covering matrices
• Guessing models and generalized Laver diamond
• The combinatorial essence of supercompactness
• Strong tree properties for two successive cardinals
• On the consistency strength of the proper forcing axiom
• Aronszajn and Kurepa trees
• On the Hamkins approximation property
• Aronszajn trees on \(\aleph_2\) and \(\aleph_3\).
• Some consequences of MA + non wKH
• Small embedding characterizations for large cardinals
• The super tree property at the successor of a singular
• Fragments of strong compactness, families of partitions and ideal extensions
• Stacking mice
• On strong compactness and supercompactness
• ℵ1-TREES
• Combinatorial Characterization of Supercompact Cardinals
• THE EIGHTFOLD WAY
• SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS
• Set Theory
• Extensions with the approximation and cover properties have no new large cardinals
• The tree property and the continuum function below
• Guessing models imply the singular cardinal hypothesis
• Ascending paths and forcings that specialize higher Aronszajn trees
• SQUARES AND NARROW SYSTEMS
• Indestructible guessing models and the continuum
• Some combinatorial problems concerning uncountable cardinals

This page was built for publication: Strong tree properties, Kurepa trees, and guessing models