A Pre-formal Proof of Why No Planar Map Needs More Than Four Colours

Abstract

Although the Four Colour Theorem is passe, we give an elementary pre-formal proof that transparently illustrates why four colours suffice to chromatically differentiate any set of contiguous, simply connected and bounded, planar spaces; by showing that there is no minimal 4-coloured planar map M. We note that such a pre-formal proof of the Four Colour Theorem highlights the significance of differentiating between: (a) Plato's knowledge as justified true belief, which seeks a formal proof in a first-order mathematical language in order to justify a belief as true; and (b) Piccinini's knowledge as factually grounded belief, which seeks a pre-formal proof, in Pantsar's sense, in order to justify the axioms and rules of inference of a first-order mathematical language which can, then, formally prove the belief as justifiably true under a well-defined interpretation of the language.

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Planar and braided proof-nets for multiplicative linear logic with mix.G. Bellin & A. Fleury - 1998 - Archive for Mathematical Logic 37 (5-6):309-325.
Mathematical logic.Heinz-Dieter Ebbinghaus - 1996 - New York: Springer. Edited by Jörg Flum & Wolfgang Thomas.
Unprovability threshold for the planar graph minor theorem.Andrey Bovykin - 2010 - Annals of Pure and Applied Logic 162 (3):175-181.
A Negation-free Proof of Cantor's Theorem.N. Raja - 2005 - Notre Dame Journal of Formal Logic 46 (2):231-233.
About Goodmanʼs Theorem.Thierry Coquand - 2013 - Annals of Pure and Applied Logic 164 (4):437-442.
On Formalization of Model-Theoretic Proofs of Gödel's Theorems.Makoto Kikuchi & Kazuyuki Tanaka - 1994 - Notre Dame Journal of Formal Logic 35 (3):403-412.
Mathematical Inference and Logical Inference.Yacin Hamami - 2018 - Review of Symbolic Logic 11 (4):665-704.
Speedith: A Reasoner for Spider Diagrams.Matej Urbas, Mateja Jamnik & Gem Stapleton - 2015 - Journal of Logic, Language and Information 24 (4):487-540.

Analytics

Added to PP
2021-06-07

Downloads
177 (#111,271)

6 months
66 (#73,833)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references