The Four Colour Theorem: Engineering of a Formal Proof
From MaRDI portal
(Redirected from Publication:3598006)
Recommendations
- Formal proof - the four color theorem
- scientific article; zbMATH DE number 1021588
- The four-colour theorem
- The complexity of the four colour theorem
- scientific article; zbMATH DE number 1564003
- A note on the four color theorem
- An approximate restatement of the Four-Color Theorem
- scientific article; zbMATH DE number 849955
Cited in
(36)- Tests and proofs for custom data generators
- Hammer for Coq: automation for dependent type theory
- Incorporating quotation and evaluation into Church's type theory
- A fully automatic theorem prover with human-style output
- Proof checking and logic programming
- Tests and Proofs for Enumerative Combinatorics
- Proof-producing reflection for HOL. With an application to model polymorphism
- The complexity of the four colour theorem
- A Brief Overview of Agda – A Functional Language with Dependent Types
- Formalizing physics: automation, presentation and foundation issues
- Working with Mathematical Structures in Type Theory
- Pure Pointer Programs with Iteration
- A Compiled Implementation of Normalization by Evaluation
- scientific article; zbMATH DE number 1927415 (Why is no real title available?)
- Computational logic: its origins and applications
- Applications of real number theorem proving in PVS
- Formalization \textit{of} quantum protocols using Coq
- Pollack-inconsistency
- Proof auditing formalised mathematics
- Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC
- Towards Formal Proof Script Refactoring
- The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem
- How hard is positive quantification?
- Formal proof - the four color theorem
- The Jordan Curve Theorem, Formally and Informally
- Constructive Mathematics and Functional Programming (Abstract)
- Proof checking and logic programming
- A proof system for graph (non)-isomorphism verification
- Formalising Mathematics in Simple Type Theory
- What is the point of computers? A question for pure mathematicians
- Large-scale formal proof for the working mathematician -- lessons learnt from the ALEXANDRIA project
- Mechanised DPO theory: uniqueness of derivations and Church-Rosser theorem
- On planarity of graphs in homotopy type theory
- Formalising the double-pushout approach to graph transformation
- Automated mathematical discovery and verification: minimizing pentagons in the plane
- Chain Bounding, the Leanest Proof of Zorn’s Lemma, and an Illustration of Computerized Proof Formalization
This page was built for publication: The Four Colour Theorem: Engineering of a Formal Proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3598006)
