Category Archives: Spencer Brown

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. Reference Peirce, Charles Sanders (1885), “On the Algebra of Logic : A Contribution to the Philosophy of Notation”, … Continue reading

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. Reference Peirce, Charles Sanders (1885), “On the Algebra of Logic … Continue reading

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 … Continue reading

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 … Continue reading

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 Logical Graphs … Continue reading

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

Praeclarum Theorema • 3

Re: Praeclarum Theorema • (1) • (2) The steps of the proof are replayed in the following animation. Reference 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 … Continue reading

Posted in Animata, C.S. Peirce, Cactus Graphs, Deduction, Equational Inference, Form, Laws of Form, Leibniz, Logic, Logical Graphs, Mathematics, Model Theory, Painted Cacti, Praeclarum Theorema, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Relation Theory, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , | 6 Comments

Praeclarum Theorema • 2

Re: Praeclarum Theorema • 1 And here’s a neat proof of that nice theorem — Reference 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, … Continue reading

Posted in Animata, C.S. Peirce, Cactus Graphs, Deduction, Equational Inference, Form, Laws of Form, Leibniz, Logic, Logical Graphs, Mathematics, Model Theory, Painted Cacti, Praeclarum Theorema, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Relation Theory, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , | 8 Comments

Praeclarum Theorema • 1

The praeclarum theorema, or splendid theorem, is a theorem of propositional calculus noted and named by G.W. Leibniz, who stated and proved it in the following manner. If a is b and d is c, then ad will be bc. This … Continue reading

Posted in Animata, C.S. Peirce, Cactus Graphs, Deduction, Equational Inference, Form, Laws of Form, Leibniz, Logic, Logical Graphs, Mathematics, Model Theory, Painted Cacti, Praeclarum Theorema, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Relation Theory, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , | 9 Comments

Logical Graphs • Discussion 9

Re: Logical Graphs • Formal Development Re: Laws of Form • Lyle Anderson LA: The Gestalt Switch from parenthesis to graphs is stimulating.  There are probably things in Laws of Form that we didn’t see because we were blinded by … Continue reading

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

Praeclarum Theorema

Introduction The praeclarum theorema, or splendid theorem, is a theorem of propositional calculus noted and named by G.W. Leibniz, who stated and proved it in the following manner. If a is b and d is c, then ad will be bc. … Continue reading

Posted in Animata, C.S. Peirce, Cactus Graphs, Deduction, Equational Inference, Form, Laws of Form, Leibniz, Logic, Logical Graphs, Mathematics, Model Theory, Painted Cacti, Praeclarum Theorema, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Relation Theory, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , | 8 Comments