MyWikiBiz, Author Your Legacy — Friday January 10, 2025
Jump to navigationJump to search
40 bytes added
, 18:29, 8 July 2009
Line 217: |
Line 217: |
| ===Differential Expansions of Propositions=== | | ===Differential Expansions of Propositions=== |
| | | |
− | An efficient calculus for boolean functions and logical propositions makes it feasible to compute the finite differences and the differentials of those functions and propositions. | + | An efficient calculus for the realm of logic represented by boolean functions and elementary propositions makes it feasible to compute the finite differences and the differentials of those functions and propositions. |
| | | |
− | For example, consider a proposition of the form <math>{}^{\backprime\backprime} p ~\operatorname{and}~ q \, {}^{\prime\prime}</math> that is graphed as two letters attached to a root node: | + | For example, consider a proposition of the form <math>{}^{\backprime\backprime} \, p ~\operatorname{and}~ q \, {}^{\prime\prime}</math> that is graphed as two letters attached to a root node: |
| | | |
| {| align="center" cellpadding="10" | | {| align="center" cellpadding="10" |