Hostname: page-component-7b7567c8c-slfcl Total loading time: 0 Render date: 2026-11-19T14:33:05.318Z Has data issue: false hasContentIssue false

ARONSZAJN TREE PRESERVATION AND BOUNDED FORCING AXIOMS

Part of:Set theory

Published online by Cambridge University Press:  01 February 2021

GUNTER FUCHS*
Affiliation:
DEPARTMENT OF MATHEMATICS, THE GRADUATE CENTER THE CITY UNIVERSITY OF NEW YORK 365 FIFTH AVENUE, NEW YORK, NY 10016, USADEPARTMENT OF MATHEMATICS, COLLEGE OF STATEN ISLAND THE CITY UNIVERSITY OF NEW YORK STATEN ISLAND, NEW YORK, NY 10314, USA E-mail: gunter.fuchs@csi.cuny.edu URL: http://www.math.csi.cuny/edu/~fuchs
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

I investigate the relationships between three hierarchies of reflection principles for a forcing class $\Gamma $: the hierarchy of bounded forcing axioms, of $\Sigma ^1_1$-absoluteness, and of Aronszajn tree preservation principles. The latter principle at level $\kappa $ says that whenever T is a tree of height $\omega _1$ and width $\kappa $ that does not have a branch of order type $\omega _1$, and whenever ${\mathord {\mathbb P}}$ is a forcing notion in $\Gamma $, then it is not the case that ${\mathord {\mathbb P}}$ forces that T has such a branch. $\Sigma ^1_1$-absoluteness serves as an intermediary between these principles and the bounded forcing axioms. A special case of the main result is that for forcing classes that don’t add reals, the three principles at level $2^\omega $ are equivalent. Special attention is paid to certain subclasses of subcomplete forcing, since these are natural forcing classes that don’t add reals.

Information

Type
Article
Copyright
© The Association for Symbolic Logic 2021