Formalizing Ordinal Partition Relations Using Isabelle/HOL
Open Access
- 11 October 2021
- journal article
- research article
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 31 (2) , 383-400
Abstract
This is an overview of a formalization 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ős–Milner, Specker, Larson and Nash-Williams, leading to Larson’s proof of the unpublished result by E.C. Milner asserting that for all , . 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 formalization process. This project is also a demonstration of working with Zermelo–Fraenkel set theory in higher-order logic.
Keywords
All Related Versions
Funding Information
- London Mathematical Society
This publication has 34 references indexed in Scilit:
- Countable partition ordinalsAnnals of Pure and Applied Logic, 2010
- Analyzing Nash-Williams' partition theorem by means of ordinal typesDiscrete Mathematics, 1991
- A Theorem in the Partition Calculus CorrigendumCanadian Mathematical Bulletin, 1974
- Borel sets and Ramsey's theoremThe Journal of Symbolic Logic, 1973
- A partition theorem for the complete graph on ωωJournal of Combinatorial Theory, Series A, 1972
- On Fraisse's Order Type ConjectureAnnals of Mathematics, 1971
- On well-quasi-ordering transfinite sequencesMathematical Proceedings of the Cambridge Philosophical Society, 1965
- Teilmengen von Mengen mit RelationenCommentarii Mathematici Helvetici, 1956
- A partition calculus in set theoryBulletin of the American Mathematical Society, 1956
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940