A quasi-lower bound on the consistency strength of PFA
From MaRDI portal
Publication:3190409
Recommendations
- Computing weak consistency in polynomial time (extended abstract)
- Consistency of circuit lower bounds with bounded theories
- On the Power of k-Consistency
- The complexity of weak consistency
- A note on weak segments of PFA
- Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles
- Decidability and complexity for quiescent consistency and its variations
- A Reduction of the NF consistency Problem
- On the consistency strength of the Milner-Sauer conjecture
- Lower bound techniques for QBF proof systems
Cites work
- scientific article; zbMATH DE number 3861143 (Why is no real title available?)
- scientific article; zbMATH DE number 5233908 (Why is no real title available?)
- An outline of inner model theory
- Collapsing functions
- Condensation and large cardinals
- Fine structure and class forcing
- Hierarchies of forcing axioms I
- Hierarchies of forcing axioms II
- On the Semantics of the Constructible Levels
- On the consistency strength of the proper forcing axiom
- Set Theory
- Squares, scales and stationary reflection
- Subcompact cardinals, squares, and stationary reflection
- The axiom of determinacy, forcing axioms, and the nonstationary ideal
- Variations on ◊
- □ on the singular cardinals
Cited in
(8)- Local club condensation and L-likeness
- Simplest possible locally definable well-orders
- Hierarchies of forcing axioms II
- Evidence for Set-Theoretic Truth and the Hyperuniverse Programme
- Forcing consequences of $PFA$ together with the continuum large
- Definable normal measures
- PFA and guessing models
- On the consistency strength of the proper forcing axiom
This page was built for publication: A quasi-lower bound on the consistency strength of PFA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3190409)
