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.
This is a fine theorem, which is proved in this way:
a is b, therefore ad is bd (by what precedes),
d is c, therefore bd is bc (again by what precedes),
ad is bd, and bd is bc, therefore ad is bc.  Q.E.D.

— Leibniz • Logical Papers, p. 41.

Expressed in contemporary logical notation, the theorem may be written as follows.

((a \Rightarrow b) \land (d \Rightarrow c)) \Rightarrow ((a \land d) \Rightarrow (b \land c))

Expressed as a logical graph under the existential interpretation, the theorem takes the shape of the following formal equivalence or propositional equation.

Praeclarum Theorema (Leibniz)

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

Praeclarum Theorema • Proof

The steps of the proof are replayed in the following animation.

Praeclarum Theorema • Proof 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 : Logical Papers, Oxford University Press, London, UK.

Readings

Resources

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

This entry was 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 and tagged , , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.