The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle/ZF

04/26/2021
by   Lawrence C. Paulson, et al.
0

The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF. The proof builds upon a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the formalization unusually long, and not entirely satisfactory: two parts of the proof do not fit together. It seems impossible to solve these problems without formalizing the metatheory. However, the present development follows a standard textbook, Kunen's Set Theory, and could support the formalization of further material from that book. It also serves as an example of what to expect when deep mathematics is formalized.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2019

Formalization of the Axiom of Choice and its Equivalent Theorems

In this paper, we describe the formalization of the axiom of choice and ...
research
03/23/2023

A Formal Proof of the Strong Normalization Theorem for System T in Agda

We present a framework for the formal meta-theory of lambda calculi in f...
research
12/05/2021

Windmills of the minds: an algorithm for Fermat's Two Squares Theorem

The two squares theorem of Fermat is a gem in number theory, with a spec...
research
11/01/2019

A Formal Proof of PAC Learnability for Decision Stumps

We present a machine-checked, formal proof of PAC learnability of the co...
research
06/09/2020

A program for the full axiom of choice

The theory of classical realizability is a framework for the Curry-Howar...
research
01/09/2018

A detailed treatment of Doob's theorem

Doob's theorem provides guarantees of consistent estimation and posterio...
research
06/03/2019

On Radically Expanding the Landscape of Potential Applications for Automated Proof Methods

In this paper we examine the potential of computer-assisted proof method...

Please sign up or login with your details

Forgot password? Click here to reset