Hostname: page-component-89b8bd64d-46n74 Total loading time: 0 Render date: 2026-05-06T09:34:49.160Z Has data issue: false hasContentIssue false

SPECIALISING TREES WITH SMALL APPROXIMATIONS I

Part of: Set theory

Published online by Cambridge University Press:  17 March 2022

RAHMAN MOHAMMADPOUR*
Affiliation:
INSTITUT FÜR DISKRETE MATHEMATIK UND GEOMETRIE TU WIEN, 1040 VIENNA, AUSTRIA URL: https://sites.google.com/site/rahmanmohammadpour
Rights & Permissions [Opens in a new window]

Abstract

Assuming $\mathrm{PFA}$, we shall use internally club $\omega _1$-guessing models as side conditions to show that for every tree T of height $\omega _2$ without cofinal branches, there is a proper and $\aleph _2$-preserving forcing notion with finite conditions which specialises T. Moreover, the forcing has the $\omega _1$-approximation property.

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of The Association for Symbolic Logic