Logical Graphs • Formal Development 5

Frequently Used Theorems

To familiarize ourselves with equational proofs in logical graphs let’s run though the proofs of a few basic theorems in the primary algebra.

C1.  Double Negation Theorem

The first theorem goes under the names of Consequence 1 (C1), the double negation theorem (DNT), or Reflection.

Double Negation Theorem

The proof that follows is adapted from the one George Spencer Brown gave in his book Laws of Form and credited to two of his students, John Dawes and D.A. Utting.

Double Negation Theorem • Proof

cc: FB | Logical GraphsLaws of FormMathstodonAcademia.edu
cc: Conceptual GraphsCyberneticsStructural ModelingSystems Science

This entry was posted in Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Deduction, Diagrammatic Reasoning, Equational Inference, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Semiotics, Spencer Brown, Visualization and tagged , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.