proper forcing axiom
Sign in to saveAlso known as PFA
set theory axiom that if 𝑃 is a proper forcing and 𝐷(𝛼) is a dense subset of 𝑃 for each 𝛼<ω₁, then there is a filter 𝐺⊆𝑃 such that 𝐷(𝛼)∩𝐺 is nonempty for all 𝛼<ω₁
In the Vinony graph
Vinony's link graph records 19 inbound references to proper forcing axiom, and connects out to forcing, International Standard Book Number and set theory.
It sits within the topics Axioms of set theory and Forcing (mathematics).
Vinony links it to 5 Wikipedia language editions.
Wikidata facts
Show 2 more facts
- short name
- PFA
- maintained by WikiProject
- WikiProject Mathematics
via Wikidata · CC0
Connections
forcing
Entity
International Standard Book Number
Entity
set theory
Entity
digital object identifier
Entity
Boolean algebra
Entity
cardinal number
Entity
partially ordered set
Entity
Saharon Shelah
Entity
zbMATH Open
Entity
large cardinal
Entity
antichain
Entity
Martin's axiom
Entity
Stevo Todorčević
Entity
Kenneth Kunen
Entity
regular cardinal
Entity
Thomas Jech
Entity
stationary set
Entity
axiom of determinacy
Entity
countable chain condition
Entity
Israel Journal of Mathematics
Entity