A forcing axiom for a non-special Aronszajn tree

DOI10.1016/j.apal.2020.102820zbMath1481.03053arXiv1805.08164OpenAlexW3022706439WikidataQ114016287 ScholiaQ114016287MaRDI QIDQ2187271

John Krueger

Publication date: 2 June 2020

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

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

zbMATH Keywords

Aronszajn tree\textsf{PFA}\((T^\ast)\)stationarily Knasterstationary antichain

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other combinatorial set theory (03E05) Generic absoluteness and forcing axioms (03E57)

Related Items (3)

Two chain conditions and their Todorčević's fragments of Martin's axiom ⋮ P-ideal dichotomy and a strong form of the Suslin Hypothesis ⋮ A guessing principle from a Souslin tree, with applications to topology

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(L\)-spaces and the \(P\)-ideal dichotomy
• Suslin's hypothesis does not imply stationary antichains
• Forcing with a coherent Souslin tree and locally countable subspaces of countably tight compact spaces
• A family of covering properties
• A weak version of \(\lozenge\) which follows from \(2^{\aleph_0}<2^{\aleph_1}\)
• Applications of cohomology to set theory. I: Hausdorff gaps
• A normal hereditarily separable non-Lindelöf space
• Iterated Cohen extensions and Souslin's problem
• Katetov’s problem
• Forcing Positive Partition Relations
• On the combinatorial principle P(c)
• Partition Problems in Topology
• An variation for one souslin tree
• Embedding Trees in the Rationals

This page was built for publication: A forcing axiom for a non-special Aronszajn tree