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 graphed as two letters attached to a root node:
Written as a string, this is just the concatenation .
The proposition may be taken as a boolean function having the abstract type where is read in such a way that means and means
Imagine yourself standing in a fixed cell of the corresponding venn diagram, say, the cell where the proposition is true, as shown in the following Figure:
Now ask yourself: What is the value of the proposition at a distance of and from the cell where you are standing?
Don’t think about it — just compute:
The cactus formula and its corresponding graph arise by substituting for and for in the boolean product or logical conjunction and writing the result in the two dialects of cactus syntax. This follows from the fact the boolean sum is equivalent to the logical operation of exclusive disjunction, which parses to a cactus graph of the following form:
Next question: What is the difference between the value of the proposition over there, at a distance of and and the value of the proposition where you are standing, all expressed in the form of a general formula, of course? Here is the appropriate formulation:
There is one thing I ought to mention at this point: Computed over plus and minus are identical operations. This will make the relation between the differential and the integral parts of the appropriate calculus slightly stranger than usual, but we will get into that later.
Last question, for now: What is the value of this expression from your current standpoint, that is, evaluated at the point where is true? Well, substituting for and for in the graph amounts to erasing the labels and as shown here:
And this is equivalent to the following graph:
We have just met with the fact that the differential of the and is the or of the differentials.
It will be necessary to develop a more refined analysis of that statement directly, but that is roughly the nub of it.
If the form of the above statement reminds you of De Morgan’s rule, it is no accident, as differentiation and negation turn out to be closely related operations. Indeed, one can find discussions of logical difference calculus in the Boole–De Morgan correspondence and Peirce also made use of differential operators in a logical context, but the exploration of these ideas has been hampered by a number of factors, not the least of which has been the lack of a syntax adequate to handle the complexity of expressions evolving in the process.