MyWikiBiz, Author Your Legacy — Friday November 22, 2024
Jump to navigationJump to search
105 bytes removed
, 03:14, 10 July 2009
Line 7: |
Line 7: |
| | | |
| ===Cactus Language for Propositional Logic=== | | ===Cactus Language for Propositional Logic=== |
− |
| |
− | '''''NOTE.''' This section is currently under construction. In the meantime, see [[Logical Graph]].''
| |
| | | |
| The development of differential logic is greatly facilitated by having a conceptually efficient calculus in place at the level of [[boolean-valued functions]] and elementary logical propositions. A calculus that is very efficient from both conceptual and computational standpoints is based on just two types of logical connectives, both of variable <math>k\!</math>-ary scope. The formulas of this calculus map into a species of graph-theoretical structures called ''painted and rooted cacti'' (PARCs) that lend visual representation to their functional structure and smooth the path to efficient computation. | | The development of differential logic is greatly facilitated by having a conceptually efficient calculus in place at the level of [[boolean-valued functions]] and elementary logical propositions. A calculus that is very efficient from both conceptual and computational standpoints is based on just two types of logical connectives, both of variable <math>k\!</math>-ary scope. The formulas of this calculus map into a species of graph-theoretical structures called ''painted and rooted cacti'' (PARCs) that lend visual representation to their functional structure and smooth the path to efficient computation. |