University of Cambridge > Talks.cam > Computer Laboratory Automated Reasoning Group Lunches > The Relative Consistency of the Axiom of Choice, Mechanized Using Isabelle/ZF

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

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Thomas Tuerk.

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.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity