A formalization of forcing and the unprovability of the continuum hypothesis

04/23/2019
by   Jesse Michael Han, et al.
0

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 2^ω_2 ×ω and formally verify the failure of the continuum hypothesis in the resulting model.

READ FULL TEXT

page 5

page 6

page 9

page 14

research
12/12/2021

Interpreting Lambda Calculus in Domain-Valued Random Variables

We develop Boolean-valued domain theory and show how the lambda-calculus...
research
06/18/2018

Boolean-like algebras of finite dimension

We introduce Boolean-like algebras of dimension n (nBA) having n constan...
research
09/10/2018

FKN theorem for the multislice, with applications

The Friedgut-Kalai-Naor (FKN) theorem states that if f is a Boolean func...
research
01/21/2020

Bisimilar Conversion of Multi-valued Networks to Boolean Networks

Discrete modelling frameworks of Biological networks can be divided in t...
research
02/18/2016

Applying Boolean discrete methods in the production of a real-valued probabilistic programming model

In this paper we explore the application of some notable Boolean methods...
research
07/27/2017

Non-Count Symmetries in Boolean & Multi-Valued Prob. Graphical Models

Lifted inference algorithms commonly exploit symmetries in a probabilist...
research
01/05/2022

Local limit theorem for complex valued sequences

In this article, we study the pointwise asymptotic behavior of iterated ...

Please sign up or login with your details

Forgot password? Click here to reset