Almost Kurepa Suslin trees and destructibility of the Guessing Model Property
Abstract
Building on recent work of Krueger and the second author, we prove the consistency of the Guessing Model Principle at ω2 together with the existence of an almost Kurepa Suslin tree. In particular, it is consistent that the Guessing Model Principle holds but is destructible by a ccc forcing of size ω1. We also prove the consistency of the existence of a weak Kurepa tree together with the failure of the Kurepa Hypothesis and a certain guessing model principle that, for example, implies the tree property at ω2.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.