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.
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.
cc: FB | Logical Graphs • Laws of Form • Mathstodon • Academia.edu
cc: Conceptual Graphs • Cybernetics • Structural Modeling • Systems Science


Pingback: Survey of Animated Logical Graphs • 5 | Inquiry Into Inquiry
Pingback: Survey of Animated Logical Graphs • 6 | Inquiry Into Inquiry
Pingback: Survey of Animated Logical Graphs • 7 | Inquiry Into Inquiry