
TL;DR
This paper introduces a hierarchy of $oldsymbol{ ext{Σ}_n}$-correct forcing axioms extending ZFC, explores their consistency relative to large cardinals, and examines their mathematical implications and preservation properties.
Contribution
It defines $oldsymbol{ ext{Σ}_n}$-correct forcing axioms, establishes their consistency relative to large cardinals, and analyzes their relationships and effects in set theory.
Findings
$oldsymbol{ ext{Σ}_1}$-correct forcing axioms are equivalent to classical forcing axioms.
$oldsymbol{ ext{Σ}_2}$-correct forcing axioms are consistent relative to a supercompact cardinal.
Higher $oldsymbol{ ext{Σ}_n}$-correct axioms are consistent relative to a hierarchy of large cardinals.
Abstract
I introduce a new family of axioms extending ZFC set theory, the -correct forcing axioms. These assert roughly that whenever a forcing name can be forced by a poset in some forcing class to have some property which is provably preserved by all further forcing in , then reflects to some small name such that there is already in a filter which interprets that small name so that holds. -correct forcing axioms turn out to be equivalent to classical forcing axioms, while -correct forcing axioms for -definable forcing classes are consistent relative to a supercompact cardinal (and in fact hold in the standard model of a classical forcing axiom constructed as an extension of a model with a supercompact), -correct forcing axioms are consistent relative to an extendible cardinal,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Formal Methods in Verification · Model-Driven Software Engineering Techniques
