On the consistency strength of the proper forcing axiom
From MaRDI portal
Publication:645215
DOI10.1016/j.aim.2011.07.016zbMath1251.03059arXiv1012.2046WikidataQ114016384 ScholiaQ114016384MaRDI QIDQ645215
Publication date: 8 November 2011
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.2046
strongly compact cardinal; PFA; supercompact cardinal; ineffable cardinal; guessing; standard iteration
03E35: Consistency and independence results
03E55: Large cardinals
03E05: Other combinatorial set theory
03E57: Generic absoluteness and forcing axioms
Related Items
NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING, Strong tree properties for small cardinals, Guessing models imply the singular cardinal hypothesis, Prevalence of Generic Laver Diamond, SQUARES AND NARROW SYSTEMS, Martin's maximum revisited, Martin's maximum and tower forcing, Guessing models and generalized Laver diamond, The combinatorial essence of supercompactness, Fragility and indestructibility of the tree property, Strong tree properties for two successive cardinals, Fragility and indestructibility. II, Simple proofs of SCH from reflection principles without using better scales, PFA and guessing models, Small embedding characterizations for large cardinals, In memoriam: James Earl Baumgartner (1943--2011), Category forcings, 𝑀𝑀⁺⁺⁺, and generic absoluteness for the theory of strong forcing axioms, QUOTIENTS OF STRONGLY PROPER FORCINGS AND GUESSING MODELS, Descriptive inner model theory, Stationary reflection principles and two cardinal tree properties, Strong Chang’s Conjecture, Semi-Stationary Reflection, the Strong Tree Property and two-cardinal square principles, A quasi-lower bound on the consistency strength of PFA
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Guessing models and generalized Laver diamond
- The combinatorial essence of supercompactness
- All automorphisms of the Calkin algebra are inner
- Smoke and mirrors: combinatorial properties of small cardinals equiconsistent with huge cardinals
- The bounded proper forcing axiom and well orderings of the reals
- A family of covering properties
- A five element basis for the uncountable linear orders
- Martin's maximum, saturated ideals, and nonregular ultrafilters. I
- Basis problems in combinatorial set theory
- Forcing axioms and stationary sets
- Decomposing uncountable squares to countably many chains
- The axiom of determinacy, forcing axioms, and the nonstationary ideal
- OCA and automorphisms of \({\mathfrak P}(\omega)/\text{fin}\)
- Generic absoluteness and the continuum
- Combinatorial principles in the core model for one Woodin cardinal
- Internally club and approachable
- MRP, tree properties and square principles
- INTERNAL APPROACHABILITY AND REFLECTION
- Hierarchies of forcing axioms II
- A general Mitchell style iteration
- Stacking mice
- Nonsplitting subset of κ(κ+)
- Combinatorial Characterization of Supercompact Cardinals
- Analytic quotients: theory of liftings for quotients over analytic ideals on the integers
- Fragments of Martin's Maximum in generic extensions
- Αll $ℵ_1$-dense sets of reals can be isomorphic
- Hierarchies of forcing axioms I
- Aronszajn trees and the independence of the transfer property
- Some combinatorial problems concerning uncountable cardinals
- SET MAPPING REFLECTION
- Gap forcing
