Subcomplete forcing principles and definable well‐orders
From MaRDI portal
Publication:5109241
DOI10.1002/malq.201800008OpenAlexW2962704095MaRDI QIDQ5109241
Publication date: 11 May 2020
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.08167
Related Items
Canonical fragments of the strong reflection principle, ARONSZAJN TREE PRESERVATION AND BOUNDED FORCING AXIOMS
Cites Work
- Unnamed Item
- Unnamed Item
- \(C ^{(n)}\)-cardinals
- The bounded proper forcing axiom and well orderings of the reals
- Martin's maximum, saturated ideals, and nonregular ultrafilters. I
- Set theory. An introduction to independence proofs
- Topics in set theory. Lebesgue measurability, large cardinals, forcing axioms, rho-functions
- Forcing axioms and stationary sets
- The axiom of determinacy, forcing axioms, and the nonstationary ideal
- Bounded forcing axioms as principles of generic absoluteness
- Weak square and stationary reflection
- Diagonal reflections on squares
- Extendible cardinals and the mantle
- The subcompleteness of Magidor forcing
- Closure properties of parametric subcompleteness
- Generic absoluteness and the continuum
- Set-theoretic geology
- A simple maximality principle
- SUBCOMPLETE FORCING AND ℒ-FORCING
- On the Singular Cardinal Hypothesis
- The downward directed grounds hypothesis and very large cardinals
- HIERARCHIES OF FORCING AXIOMS, THE CONTINUUM HYPOTHESIS AND SQUARE PRINCIPLES
- HIERARCHIES OF (VIRTUAL) RESURRECTION AXIOMS
- SUBCOMPLETE FORCING, TREES, AND GENERIC ABSOLUTENESS
- The bounded proper forcing axiom
- Closed maximality principles: implications, separations and combinations
- The ground axiom
- The fine structure of the constructible hierarchy
- SET MAPPING REFLECTION
