Indestructible guessing models and the continuum

DOI10.4064/FM340-1-2017zbMath1397.03059arXiv1510.05297OpenAlexW2963229138MaRDI QIDQ5368839

John Krueger, Sean D. Cox

Publication date: 10 October 2017

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

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

zbMATH Keywords

approximation propertystrongly properIGMPindestructible guessing model

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other combinatorial set theory (03E05) Other set-theoretic hypotheses and axioms (03E65) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (6)

Indestructibility of some compactness principles over models of \(\mathsf{PFA} \) ⋮ Strong tree properties, Kurepa trees, and guessing models ⋮ Guessing models and the approachability ideal ⋮ NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING ⋮ FORCING AXIOMS, APPROACHABILITY, AND STATIONARY SET REFLECTION ⋮ Specializing trees and answer to a question of Williams

This page was built for publication: Indestructible guessing models and the continuum