Category Archives: Praeclarum Theorema

How To Succeed In Proof Business Without Really Trying

Re: R.J. Lipton • Surely You Are Joking? Comment 1 Even at the mailroom entry point of propositional calculus, there is a qualitative difference between insight proofs and routine proofs.  Human beings can do either sort, as a rule, but … Continue reading

Posted in Algorithms, Animata, Artificial Intelligence, Automatic Theorem Proving, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Graph Theory, Logic, Logical Graphs, Minimal Negation Operators, Model Theory, Peirce, Praeclarum Theorema, Proof Theory, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , , , | 7 Comments

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