A formalization of forcing and the unprovability of the continuum hypothesis
Jesse Michael Han, Floris van Doorn

TL;DR
This paper formalizes the method of forcing within the Lean 3 theorem prover, demonstrating its application by verifying the unprovability of the continuum hypothesis in a specific Boolean-valued model.
Contribution
It introduces a formalization of forcing in Lean 3, including core theorems and a deep embedding of logic, enabling rigorous verification of set-theoretic independence results.
Findings
Formalization of forcing in Lean 3
Verification of the failure of the continuum hypothesis
Deep embedding of first-order logic with Boolean-valued soundness
Abstract
We describe a formalization of forcing using Boolean-valued models in the Lean 3 theorem prover, including the fundamental theorem of forcing and a deep embedding of first-order logic with a Boolean-valued soundness theorem. As an application of our framework, we specialize our construction to the Boolean algebra of regular opens of the Cantor space and formally verify the failure of the continuum hypothesis in the resulting model.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Computability, Logic, AI Algorithms · Logic, Reasoning, and Knowledge
