On the consistency strength of the proper forcing axiom

DOI10.1016/j.aim.2011.07.016zbMath1251.03059arXiv1012.2046OpenAlexW2045584562WikidataQ114016384 ScholiaQ114016384MaRDI QIDQ645215

Matteo Viale, Christoph Weiß

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

zbMATH Keywords

strongly compact cardinalPFAsupercompact cardinalineffable cardinalguessingstandard iteration

Mathematics Subject Classification ID

Consistency and independence results (03E35) Large cardinals (03E55) Other combinatorial set theory (03E05) Generic absoluteness and forcing axioms (03E57)

Related Items

Small embedding characterizations for large cardinals ⋮ A quasi-lower bound on the consistency strength of PFA ⋮ Stationary reflection principles and two cardinal tree properties ⋮ Martin's maximum and tower forcing ⋮ In memoriam: James Earl Baumgartner (1943--2011) ⋮ The super tree property at the successor of a singular ⋮ SUBCOMPACT CARDINALS, TYPE OMISSION, AND LADDER SYSTEMS ⋮ A note on highly connected and well-connected Ramsey theory ⋮ Indestructibility of some compactness principles over models of \(\mathsf{PFA} \) ⋮ SPECIALISING TREES WITH SMALL APPROXIMATIONS I ⋮ Strong Chang’s Conjecture, Semi-Stationary Reflection, the Strong Tree Property and two-cardinal square principles ⋮ Strong tree properties, Kurepa trees, and guessing models ⋮ SQUARES AND NARROW SYSTEMS ⋮ Rado’s Conjecture and its Baire version ⋮ 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 ⋮ The ineffable tree property and failure of the singular cardinals hypothesis ⋮ Characterizing large cardinals through Neeman's pure side condition forcing ⋮ Fragility and indestructibility. II ⋮ Simple proofs of SCH from reflection principles without using better scales ⋮ PFA and guessing models ⋮ Guessing models and the approachability ideal ⋮ NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING ⋮ FORCING AXIOMS, APPROACHABILITY, AND STATIONARY SET REFLECTION ⋮ Strong tree properties for small cardinals ⋮ Martin's maximum revisited ⋮ Category forcings, 𝑀𝑀⁺⁺⁺, and generic absoluteness for the theory of strong forcing axioms ⋮ QUOTIENTS OF STRONGLY PROPER FORCINGS AND GUESSING MODELS ⋮ ITP, ISP, AND SCH ⋮ Descriptive inner model theory ⋮ Guessing models imply the singular cardinal hypothesis ⋮ Specializing trees and answer to a question of Williams ⋮ Prevalence of Generic Laver Diamond

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