Hostname: page-component-74656f9884-8rzl6 Total loading time: 0 Render date: 2026-11-05T15:28:55.651Z Has data issue: false hasContentIssue false

FORCING AXIOMS, APPROACHABILITY, AND STATIONARY SET REFLECTION

Part of: Set theory

Published online by Cambridge University Press:  20 October 2021

SEAN D. COX*
Affiliation:
DEPARTMENT OF MATHEMATICS AND APPLIED MATHEMATICS VIRGINIA COMMONWEALTH UNIVERSITY 1015 FLOYD AVENUE, RICHMOND, VA 23284, USA E-mail: scox9@vcu.edu
Rights & Permissions [Opens in a new window]

Abstract

We prove a variety of theorems about stationary set reflection and concepts related to internal approachability. We prove that an implication of Fuchino–Usuba relating stationary reflection to a version of Strong Chang’s Conjecture cannot be reversed; strengthen and simplify some results of Krueger about forcing axioms and approachability; and prove that some other related results of Krueger are sharp. We also adapt some ideas of Woodin to simplify and unify many arguments in the literature involving preservation of forcing axioms.

Information

Type
Article
Copyright
© The Association for Symbolic Logic 2021
Figure 0

Figure 1 When the inclusions from (1) are globally strict.

Figure 1

Figure 2 An arrow indicates an implication, and an arrow with an X indicates a non-implication. In order to simplify the figure, the non-implications shown do not incorporate the full strength of the theorems above.