logical graph : formal development

Initial discussion of logical graphs is given in the Topic Introduction (http://planetmath.org/LogicalGraph).

1 Formal development

The next order of business is to give the exact forms of the axioms that are used in the following more formal development, devolving from Peirce’s various systems of logical graphs via Spencer-Brown’s Laws of Form (LOF). In formal proofs, a variation of the annotation scheme from LOF will be used to mark each step of the proof according to which axiom, or initial, is being invoked to justify the corresponding step of syntactic transformation, whether it applies to graphs or to strings.

1.1 Axioms

The axioms are just four in number, divided into the arithmetic initials, $I_{1}$ and $I_{2},$ and the algebraic initials, $J_{1}$ and $J_{2}.$

	(20)
	(21)
	(22)
	(23)

One way of assigning logical meaning to the initial equations is known as the entitative interpretation (EN). Under EN, the axioms read as follows:

$\begin{array}[]{ccccc}I_{1}&:&\operatorname{true}\ \operatorname{or}\ % \operatorname{true}&=&\operatorname{true}\\ I_{2}&:&\operatorname{not}\ \operatorname{true}&=&\operatorname{false}\\ J_{1}&:&a\ \operatorname{or}\ \operatorname{not}\ a&=&\operatorname{true}\\ J_{2}&:&(a\ \operatorname{or}\ b)\ \operatorname{and}\ (a\ \operatorname{or}\ % c)&=&a\ \operatorname{or}\ (b\ \operatorname{and}\ c)\\ \end{array}$

Another way of assigning logical meaning to the initial equations is known as the existential interpretation (EX). Under EX, the axioms read as follows:

$\begin{array}[]{ccccc}I_{1}&:&\operatorname{false}\ \operatorname{and}\ % \operatorname{false}&=&\operatorname{false}\\ I_{2}&:&\operatorname{not}\ \operatorname{false}&=&\operatorname{true}\\ J_{1}&:&a\ \operatorname{and}\ \operatorname{not}\ a&=&\operatorname{false}\\ J_{2}&:&(a\ \operatorname{and}\ b)\ \operatorname{or}\ (a\ \operatorname{and}% \ c)&=&a\ \operatorname{and}\ (b\ \operatorname{or}\ c)\\ \end{array}$

All of the axioms in this set have the form of equations. This means that all of the inference steps that they allow are reversible. The proof annotation scheme employed below makes use of a double bar ${}^{\underline{\overline{~{}~{}~{}~{}~{}~{}}}}$ to mark this fact, although it will often be left to the reader to decide which of the two possible directions is the one required for applying the indicated axiom.

1.2 Frequently used theorems

The actual business of proof is a far more strategic affair than the simple cranking of inference rules might suggest. Part of the reason for this lies in the circumstance that the usual brands of inference rules combine the moving forward of a state of inquiry with the losing of information along the way that doesn’t appear to be immediately relevant, at least, not as viewed in the local focus and the short run of the moment to moment proceedings of the proof in question. Over the long haul, this has the pernicious side-effect that one is forever strategically required to reconstruct much of the information that one had strategically thought to forget in earlier stages of the proof, if “before the proof started” can be counted as an earlier stage of the proof in view.

This is just one of the reasons that it can be very instructive to study equational inference rules of the sort that our axioms have just provided. Although equational forms of reasoning are paramount in mathematics, they are less familiar to the student of the usual logic textbooks, who may find a few surprises here.

By way of gaining a minimal experience with how equational proofs look in the present forms of syntax, let us examine the proofs of a few essential theorems in the primary algebra.

1.2.1 $C_{1}$ . Double negation theorem

The first theorem goes under the names of Consequence 1 $(C_{1})$ , the double negation theorem (DNT), or Reflection.

(24)

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

(25)

(26)

1.2.2 $C_{2}$ . Generation theorem

One theorem of frequent use goes under the nickname of the weed and seed theorem (WAST). The proof is just an exercise in mathematical induction, once a suitable basis is laid down, and it will be left as an exercise for the reader. What the WAST says is that a label can be freely distributed or freely erased anywhere in a subtree whose root is labeled with that label. The second in our list of frequently used theorems is in fact the base case of this weed and seed theorem. In LOF, it goes by the name of Consequence 2 $(C_{2})$ or Generation.

(27)

Here is a proof of the Generation Theorem.

(28)

1.2.3 $C_{3}$ . Dominant form theorem

The third of the frequently used theorems of service to this survey is one that Spencer-Brown annotates as Consequence 3 $(C_{3})$ or Integration. A better mnemonic might be dominance and recession theorem (DART), but perhaps the brevity of dominant form theorem (DFT) is sufficient reminder of its double-edged role in proofs.

(29)

Here is a proof of the Dominant Form Theorem.

(30)

1.3 Exemplary proofs

Using no more than the axioms and theorems recorded so far, it is already possible to prove a multitude of much more complex theorems. A couple of all-time favorites are given next.

1.3.1 Peirce’s law

Peirce’s law is commonly written in the following form:

((p\Rightarrow q)\Rightarrow p)\Rightarrow p

The existential graph representation of Peirce’s law is shown in Figure 31.

(31)

A graphical proof of Peirce’s law is shown in Figure 32.

(32)

Cf. Peirce’s Law (http://planetmath.org/PeircesLaw).

1.3.2 Praeclarum theorema

An illustrious example of a propositional theorem is the praeclarum theorema, the admirable, shining, or splendid theorem of Leibniz.

If $a$ is $b$ and $d$ is $c$ , then $a d$ will be $b c$ .
This is a fine theorem, which is proved in this way:
$a$ is $b$ , therefore $a d$ is $b d$ (by what precedes),
$d$ is $c$ , therefore $b d$ is $b c$ (again by what precedes),
$a d$ is $b d$ , and $b d$ is $b c$ , therefore $a d$ is $b c$ . Q.E.D.
(Leibniz, Logical Papers, p. 41).

Under the existential interpretation, the praeclarum theorema is represented by means of the following logical graph equation.

(33)

And here’s a neat proof of that nice theorem.

(34)

Cf. Praeclarum Theorema (http://planetmath.org/PraeclarumTheorema).

2 Bibliography

•

Leibniz, Gottfried W. (1679–1686 ?), “Addenda to the Specimen of the Universal Calculus”, pp. 40–46 in G.H.R. Parkinson (ed., trans., 1966), Leibniz : Logical Papers, Oxford University Press, London, UK.
•

Peirce, Charles Sanders (1931–1935, 1958), Collected Papers of Charles Sanders Peirce, vols. 1–6, Charles Hartshorne and Paul Weiss (eds.), vols. 7–8, Arthur W. Burks (ed.), Harvard University Press, Cambridge, MA. Cited as (CP volume.paragraph).
•

Peirce, Charles Sanders (1981–), Writings of Charles S. Peirce : A Chronological Edition, Peirce Edition Project (eds.), Indiana University Press, Bloomington and Indianopolis, IN. Cited as (CE volume, page).
•

Peirce, Charles Sanders (1885), “On the Algebra of Logic : A Contribution to the Philosophy of Notation”, American Journal of Mathematics 7 (1885), 180–202. Reprinted as CP 3.359–403 and CE 5, 162–190.
•

Peirce, Charles Sanders (c. 1886), “Qualitative Logic”, MS 736. Published as pp. 101–115 in Carolyn Eisele (ed., 1976), The New Elements of Mathematics by Charles S. Peirce, Volume 4, Mathematical Philosophy, Mouton, The Hague.
•

Peirce, Charles Sanders (1886 a), “Qualitative Logic”, MS 582. Published as pp. 323–371 in Writings of Charles S. Peirce : A Chronological Edition, Volume 5, 1884–1886, Peirce Edition Project (eds.), Indiana University Press, Bloomington and Indianopolis, IN, 1993.
•

Peirce, Charles Sanders (1886 b), “The Logic of Relatives : Qualitative and Quantitative”, MS 584. Published as pp. 372–378 in Writings of Charles S. Peirce : A Chronological Edition, Volume 5, 1884–1886, Peirce Edition Project (eds.), Indiana University Press, Bloomington and Indianopolis, IN, 1993.
•

Spencer Brown, George (1969), Laws of Form, George Allen and Unwin, London, UK.

Title	logical graph : formal development
Canonical name	LogicalGraphFormalDevelopment
Date of creation	2013-03-22 18:19:45
Last modified on	2013-03-22 18:19:45
Owner	Jon Awbrey (15246)
Last modified by	Jon Awbrey (15246)
Numerical id	31
Author	Jon Awbrey (15246)
Entry type	Topic
Classification	msc 03B70
Classification	msc 03B35
Classification	msc 03B22
Classification	msc 03B05
Related topic	Ampheck
Related topic	DifferentialLogic
Related topic	MinimalNegationOperator
Related topic	PropositionalCalculus
Related topic	ZerothOrderLogic
Defines	entitative interpretation
Defines	existential interpretation