12,080
edits
Changes
Directory:Jon Awbrey/Papers/Futures Of Logical Graphs (view source)
Revision as of 17:24, 29 July 2009
, 17:24, 29 July 2009→Exemplary proofs: reorg
|}
|}
==Exemplary proofs==
Based on the axioms given at the outest, and aided by the theorems recorded so far, it is possible to prove a multitude of much more complex theorems. A couple of all-time favorites are given next.
Based on the axioms given at the outest, and aided by the theorems recorded so far, it is possible to prove a multitude of much more complex theorems. A couple of all-time favorites are given next.
===Peirce's law===
: ''[[Peirce's law|Main article: Peirce's law]]''
: ''[[Peirce's law|Main article: Peirce's law]]''
|}
|}
===Praeclarum theorema===
An illustrious example of a propositional theorem is the ''praeclarum theorema'', the ''admirable'', ''shining'', or ''splendid'' theorem of [[Leibniz]].
An illustrious example of a propositional theorem is the ''praeclarum theorema'', the ''admirable'', ''shining'', or ''splendid'' theorem of [[Leibniz]].