Category Archives: Painted Cacti

Praeclarum Theorema

The praeclarum theorema, or splendid theorem, is a theorem of propositional calculus that was noted and named by G.W. Leibniz. Continue reading

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

Logical Graphs • Introduction

A logical graph is a graph-theoretic structure in one of the styles of graphical syntax that Charles Sanders Peirce developed for logic. Continue reading

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 | Tagged , , , , , , , , , , , , , , , , , , , | 43 Comments