Explore >> Select a destination
|
You are here 
|
jdh.hamkins.org | ||
| | | | |
inquiryintoinquiry.com
|
|
| | | | | 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... | |
| | | | |
inquiryintoinquiry.com
|
|
| | | | | 1 post published by Jon Awbrey on November 16, 2013 | |
| | | | |
inquiryintoinquiry.com
|
|
| | | | | Re: R.J. Lipton and K.W. Regan ? Proving Cook's Theorem Synchronicity Rules? I just started reworking an old exposition of mine on Cook's Theorem, where I borrowed the Parity Function example from Wilf (1986), Algorithms and Complexity, and translated it into the cactus graph syntax for propositional calculus I developed as an extension of Peirce's... | |
| | | | |
nunopratasfotografia.wordpress.com
|
|
| | | Refraction | ||
