Specializing trees and answer to a question of Williams

DOI10.1142/S0219061320500233zbMath1473.03030arXiv1708.02719OpenAlexW3035493480MaRDI QIDQ4991903

Mohammad Golshani, Saharon Shelah

Publication date: 4 June 2021

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

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

zbMATH Keywords

supercompact cardinalsAronszajn treescollapsing cardinalstree specialization

Mathematics Subject Classification ID

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

Related Items (2)

SPECIALISING TREES WITH SMALL APPROXIMATIONS I ⋮ Fresh function spectra

Cites Work

• Unnamed Item
• Unnamed Item
• Fragility and indestructibility of the tree property
• On the consistency strength of the proper forcing axiom
• Martin's maximum, saturated ideals, and nonregular ultrafilters. I
• Some consequences of MA + non wKH
• Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
• Base tree property
• ON FOREMAN’S MAXIMALITY PRINCIPLE
• Weakly Compact Cardinals and Nonspecial Aronszajn Trees
• Iterated Forcing and Elementary Embeddings
• Some Combinatorial Properties of Trees
• Morasses and the Lévy-collapse
• Trees, Gleason Spaces, and Coabsolutes of βN ∼N
• The ℵ 2 \1-Souslin Hypothesis
• Souslin trees which are hard to specialise
• NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING
• 0^# and some forcing principles
• The special Aronszajn tree property
• Indestructible guessing models and the continuum

This page was built for publication: Specializing trees and answer to a question of Williams