Operations, climbability and the proper forcing axiom
From MaRDI portal
Publication:385066
DOI10.1016/j.apal.2012.11.010zbMath1323.03072OpenAlexW1977183784WikidataQ114016290 ScholiaQ114016290MaRDI QIDQ385066
Publication date: 29 November 2013
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2012.11.010
Games involving topology, set theory, or logic (91A44) Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40) Generic absoluteness and forcing axioms (03E57)
Related Items (2)
The \(\ast\)-variation of the Banach-Mazur game and forcing axioms ⋮ FORCING AXIOMS, APPROACHABILITY, AND STATIONARY SET REFLECTION
Cites Work
- Unnamed Item
- Dense non-reflection for stationary collections of countable sets
- Forcing axioms and stationary sets
- The proper forcing axiom and stationary set reflection
- The axiom of determinacy, forcing axioms, and the nonstationary ideal
- Fine structure and class forcing
- Saturated filters at successors of singulars, weak reflection and yet another weak club principle
- Directive trees and games on posets
- Approachability and Games on Posets
- Games played on Boolean algebras
- On a generalization of Jensen's □κ, and strategic closure of partial orders
- Fragments of Martin's Maximum in generic extensions
- Kurepa trees and Namba forcing
- Separating stationary reflection principles
- The fine structure of the constructible hierarchy
This page was built for publication: Operations, climbability and the proper forcing axiom
