The 5 Colour Theorem in Isabelle/Isar

Authors:
Gertrud Bauer;Tobias Nipkow
Affiliations:
-;-
Venue:
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Year:
2002

Citing 5
Cited 7

The four-colour theorem

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
A Formal Theory of Undirected Graphs in Higher-Order Logic

Proceedings of the 7th International Workshop on Higher Order Logic Theorem Proving and Its Applications
Formalization of Planar Graphs

Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications
Formalization of Graph Search Algorithms and Its Applications

Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic

A hypermap framework for computer-aided proofs in surface subdivisions: genus theorem and Euler's formula

Proceedings of the 2007 ACM symposium on Applied computing
Design and formal proof of a new optimal image segmentation program with hypermaps

Pattern Recognition
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof

Theoretical Computer Science
An Intuitionistic Proof of a Discrete Form of the Jordan Curve Theorem Formalized in Coq with Combinatorial Hypermaps

Journal of Automated Reasoning
Program extraction in simply-typed higher order logic

TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Formal verification of coalescing graph-coloring register allocation

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Formal study of plane delaunay triangulation

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on an inductive definition of triangulations, a theory of undirected planar graphs is developed in Isabelle/HOL. The proof of the 5 colour theorem is discussed in some detail, emphasizing the readability of the computer assisted proofs.