Logical Graphs • Interpretive Duality 1

The duality between Entitative and Existential interpretations of logical graphs is a good example of a mathematical symmetry, in this case a symmetry of order two.  Symmetries of this and higher orders give us conceptual handles on excess complexity in the manifold of sensuous impressions, making it well worth the effort to seek them out and grasp them where we find them.

Both Peirce and Spencer Brown understood the significance of the mathematical unity underlying the dual interpretation of logical graphs.  Peirce began with the Entitative option and later switched to the Existential choice while Spencer Brown exercised the Entitative option in his Laws of Form.

In that vein, here’s a Rosetta Stone to give us a grounding in the relationship between boolean functions and our two readings of logical graphs.

\text{Boolean Functions on Two Variables}

Boolean Functions on Two Variables

cc: FB | Logical GraphsLaws of Form • Mathstodon • Academia.edu
cc: Conceptual GraphsCyberneticsStructural ModelingSystems Science

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Equational Inference, Graph Theory, Interpretive Duality, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , | 7 Comments

Peirce’s Law • 7

Equational Form (concl.)

The following animation replays the steps of the proof.

Peirce's Law : Strong Form • Proof Animation

Reference

  • 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 (CP 3.359–403), (CE 5, 162–190).

Resources

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

Posted in C.S. Peirce, Equational Inference, Laws of Form, Logic, Logical Graphs, Mathematics, Peirce, Peirce's Law, Proof Theory, Propositional Calculus, Propositions As Types Analogy, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , | 9 Comments

Peirce’s Law • 6

Equational Form (cont.)

Using the axioms and theorems listed in the entries on logical graphs, the equational form of Peirce’s law may be proved in the following manner.

Peirce's Law : Strong Form • Proof

Reference

  • 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 (CP 3.359–403), (CE 5, 162–190).

Resources

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

Posted in C.S. Peirce, Equational Inference, Laws of Form, Logic, Logical Graphs, Mathematics, Peirce, Peirce's Law, Proof Theory, Propositional Calculus, Propositions As Types Analogy, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , | 9 Comments

Peirce’s Law • 5

Equational Form

A stronger form of Peirce’s law also holds, in which the final implication is observed to be reversible, resulting in the following equivalence.

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

The converse implication p \Rightarrow ((p \Rightarrow q) \Rightarrow p) is clear enough on general principles, since p \Rightarrow (r \Rightarrow p) holds for any proposition r.

Representing propositions as logical graphs under the existential interpretation, the strong form of Peirce’s law is expressed by the following equation.

Peirce's Law : Strong Form

Reference

  • 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 (CP 3.359–403), (CE 5, 162–190).

Resources

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

Posted in C.S. Peirce, Equational Inference, Laws of Form, Logic, Logical Graphs, Mathematics, Peirce, Peirce's Law, Proof Theory, Propositional Calculus, Propositions As Types Analogy, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , | 9 Comments

Peirce’s Law • 4

Proof Animation

The following animation replays the steps of the proof.

Peirce's Law • Proof Animation

Reference

  • 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 (CP 3.359–403), (CE 5, 162–190).

Resources

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

Posted in C.S. Peirce, Equational Inference, Laws of Form, Logic, Logical Graphs, Mathematics, Peirce, Peirce's Law, Proof Theory, Propositional Calculus, Propositions As Types Analogy, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , | 9 Comments

Peirce’s Law • 3

Graphical Proof

Using the axiom set given in the articles on logical graphs, Peirce’s law may be proved in the following manner.

Peirce's Law • Proof

Reference

  • 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 (CP 3.359–403), (CE 5, 162–190).

Resources

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

Posted in C.S. Peirce, Equational Inference, Laws of Form, Logic, Logical Graphs, Mathematics, Peirce, Peirce's Law, Proof Theory, Propositional Calculus, Propositions As Types Analogy, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , | 9 Comments

Peirce’s Law • 2

Graphical Representation

Representing propositions in the language of logical graphs, and operating under the existential interpretation, Peirce’s law is expressed by means of the following formal equivalence or logical equation.

Peirce's Law

Reference

  • 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 (CP 3.359–403), (CE 5, 162–190).

Resources

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

Posted in C.S. Peirce, Equational Inference, Laws of Form, Logic, Logical Graphs, Mathematics, Peirce, Peirce's Law, Proof Theory, Propositional Calculus, Propositions As Types Analogy, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , | 9 Comments

Peirce’s Law • 1

A Curious Truth of Classical Logic

Peirce’s law is a propositional calculus formula which states a non‑obvious truth of classical logic and affords a novel way of defining classical propositional calculus.

Introduction

Peirce’s law is commonly expressed in the following form.

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

Peirce’s law holds in classical propositional calculus, but not in intuitionistic propositional calculus.  The precise axiom system one chooses for classical propositional calculus determines whether Peirce’s law is taken as an axiom or proven as a theorem.

History

Here is Peirce’s own statement and proof of the law:

A fifth icon is required for the principle of excluded middle and other propositions connected with it.  One of the simplest formulae of this kind is:

\{ (x \,-\!\!\!< y) \,-\!\!\!< x \} \,-\!\!\!< x.

This is hardly axiomatical.  That it is true appears as follows.  It can only be false by the final consequent x being false while its antecedent (x \,-\!\!\!< y) \,-\!\!\!< x is true.  If this is true, either its consequent, x, is true, when the whole formula would be true, or its antecedent x \,-\!\!\!< y is false.  But in the last case the antecedent of x \,-\!\!\!< y, that is x, must be true.  (Peirce, CP 3.384).

Peirce goes on to point out an immediate application of the law:

From the formula just given, we at once get:

\{ (x \,-\!\!\!< y) \,-\!\!\!< \alpha \} \,-\!\!\!< x,

where the \alpha is used in such a sense that (x \,-\!\!\!< y) \,-\!\!\!< \alpha means that from (x \,-\!\!\!< y) every proposition follows.  With that understanding, the formula states the principle of excluded middle, that from the falsity of the denial of x follows the truth of x.  (Peirce, CP 3.384).

Note.  Peirce uses the sign of illation ``-\!\!\!<" for implication.  In one place he explains ``-\!\!\!<" as a variant of the sign ``\le" for less than or equal to;  in another place he suggests that A \,-\!\!\!< B is an iconic way of representing a state of affairs where A, in every way that it can be, is B.

References

  • 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 (CP 3.359–403), (CE 5, 162–190).
  • 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 Indianapolis, IN.  Cited as (CE volume, page).

Resources

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

Posted in C.S. Peirce, Equational Inference, Laws of Form, Logic, Logical Graphs, Mathematics, Peirce, Peirce's Law, Proof Theory, Propositional Calculus, Propositions As Types Analogy, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , | 9 Comments

Peirce’s Law

A Curious Truth of Classical Logic

Peirce’s law is a propositional calculus formula which states a non‑obvious truth of classical logic and affords a novel way of defining classical propositional calculus.

Introduction

Peirce’s law is commonly expressed in the following form.

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

Peirce’s law holds in classical propositional calculus, but not in intuitionistic propositional calculus.  The precise axiom system one chooses for classical propositional calculus determines whether Peirce’s law is taken as an axiom or proven as a theorem.

History

Here is Peirce’s own statement and proof of the law:

A fifth icon is required for the principle of excluded middle and other propositions connected with it.  One of the simplest formulae of this kind is:

\{ (x \,-\!\!\!< y) \,-\!\!\!< x \} \,-\!\!\!< x.

This is hardly axiomatical.  That it is true appears as follows.  It can only be false by the final consequent x being false while its antecedent (x \,-\!\!\!< y) \,-\!\!\!< x is true.  If this is true, either its consequent, x, is true, when the whole formula would be true, or its antecedent x \,-\!\!\!< y is false.  But in the last case the antecedent of x \,-\!\!\!< y, that is x, must be true.  (Peirce, CP 3.384).

Peirce goes on to point out an immediate application of the law:

From the formula just given, we at once get:

\{ (x \,-\!\!\!< y) \,-\!\!\!< \alpha \} \,-\!\!\!< x,

where the \alpha is used in such a sense that (x \,-\!\!\!< y) \,-\!\!\!< \alpha means that from (x \,-\!\!\!< y) every proposition follows.  With that understanding, the formula states the principle of excluded middle, that from the falsity of the denial of x follows the truth of x.  (Peirce, CP 3.384).

Note.  Peirce uses the sign of illation ``-\!\!\!<" for implication.  In one place he explains ``-\!\!\!<" as a variant of the sign ``\le" for less than or equal to;  in another place he suggests that A \,-\!\!\!< B is an iconic way of representing a state of affairs where A, in every way that it can be, is B.

Graphical Representation

Representing propositions in the language of logical graphs, and operating under the existential interpretation, Peirce’s law is expressed by means of the following formal equivalence or logical equation.

Peirce's Law

Graphical Proof

Using the axiom set given in the articles on logical graphs, Peirce’s law may be proved in the following manner.

Peirce's Law • Proof

The following animation replays the steps of the proof.

Peirce's Law • Proof Animation

Equational Form

A stronger form of Peirce’s law also holds, in which the final implication is observed to be reversible, resulting in the following equivalence.

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

The converse implication p \Rightarrow ((p \Rightarrow q) \Rightarrow p) is clear enough on general principles, since p \Rightarrow (r \Rightarrow p) holds for any proposition r.

Representing propositions as logical graphs under the existential interpretation, the strong form of Peirce’s law is expressed by the following equation.

Peirce's Law : Strong Form

Using the axioms and theorems listed in the entries on logical graphs, the equational form of Peirce’s law may be proved in the following manner.

Peirce's Law : Strong Form • Proof

The following animation replays the steps of the proof.

Peirce's Law : Strong Form • Proof Animation

References

  • 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 (CP 3.359–403), (CE 5, 162–190).
  • 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 Indianapolis, IN.  Cited as (CE volume, page).

Resources

cc: FB | Logical Graphs • Laws of Form • Mathstodon • Academia.edu
cc: Conceptual Graphs • Cybernetics • Structural Modeling • Systems Science

Posted in C.S. Peirce, Equational Inference, Laws of Form, Logic, Logical Graphs, Mathematics, Peirce, Peirce's Law, Proof Theory, Propositional Calculus, Propositions As Types Analogy, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , | 9 Comments

Survey of Animated Logical Graphs • 6

This is a Survey of blog and wiki posts on Logical Graphs, encompassing several families of graph-theoretic structures originally developed by Charles S. Peirce as graphical formal languages or visual styles of syntax amenable to interpretation for logical applications.

Beginnings

Elements

Examples

Excursions

Applications

Blog Series

  • Logical Graphs • Interpretive Duality • (1)(2)(3)(4)
  • Logical Graphs, Iconicity, Interpretation • (1)(2)
  • Genus, Species, Pie Charts, Radio Buttons • (1)

Anamnesis

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

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Constraint Satisfaction Problems, Differential Logic, Equational Inference, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Theorem Proving, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment