arXiv Analytics

Sign in

arXiv:2011.13218 [math.LO]AbstractReferencesReviewsResources

Formalising Ordinal Partition Relations Using Isabelle/HOL

Mirna Džamonja, Angeliki Koutsoukou-Argyraki, Lawrence C. Paulson FR

Published 2020-11-26Version 1

This is an overview of a formalisation project in the proof assistant Isabelle/HOL of a number of research results in infinitary combinatorics and set theory (more specifically in ordinal partition relations) by Erd\H{o}s--Milner, Specker, Larson and Nash-Williams, leading to Larson's proof of the unpublished result by E.C. Milner asserting that for all $m \in \mathbb{N}$, $\omega^\omega\arrows(\omega^\omega, m)$. This material has been recently formalised by Paulson and is available on the Archive of Formal Proofs; here we discuss some of the most challenging aspects of the formalisation process. This project is also a demonstration of working with Zermelo-Fraenkel set theory in higher-order logic.

Related articles: Most relevant | Search more
arXiv:2104.11613 [math.LO] (Published 2021-04-23)
A Formalised Theorem in the Partition Calculus
arXiv:1607.00205 [math.LO] (Published 2016-07-01)
An Easton-like theorem for Zermelo-Fraenkel Set Theory without Choice
arXiv:1101.5660 [math.LO] (Published 2011-01-29, updated 2013-03-11)
Lifting up the proof theory to the countables : Zermelo-Fraenkel set theory