I read on Wikipedia that G. Spencer-Brown gave a non-computer based proof of the four color theorem. As I'm not an expert in the subject I'm unable to verify that claim. Does any one have an idea about the proof or a reference to a serious discussion of the subject?
closed as not constructive by Robin Chapman, Felipe Voloch, Theo Johnson-Freyd, Gerry Myerson, S. Carnahan♦ Sep 30 '10 at 11:23
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance. If this question can be reworded to fit the rules in the help center, please edit the question.
I spent some time with this a couple of years ago out of curiosity, but did not make it any farther than you're like to be able to find online. The water is definitely murky.
Here is a discussion of the work which makes it clear that there are substantial ideas in Spencer-Brown's work, though Kauffman makes it clear that he is not evaluating the work per se. Kauffman reports that Spencer-Brown definitely gives (with proof) a reformulation of the 4-Color Theorem into something called the Primacy Principle, that "A minimal planar (non-empty) uncolorable trail is prime." (You'll have to see the references for the terminology). Kauffman points out that Spencer-Brown has set up his logical foundations to have basically unintentionally axiomatized this Principle (hence the line on Wikipedia that Spencer-Brown's work "straddles the boundary between mathematics and of philosophy"), which is the source of Spencer-Brown's claimed proof. This seems to be far as Kauffman is willing to go in giving caution as to the validity of the proof.
The Wikipedia article on Laws of Form is decidedly less charitable.