Differential Expansions of Propositions Bird’s Eye View 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, […]
Cactus Language for Propositional Logic (cont.) Table 1 shows the cactus graphs, the corresponding cactus expressions, their logical meanings under the so‑called existential interpretation, and their translations into conventional notations for a sample of basic propositional forms. Table 1. Syntax and Semantics of a Calculus for Propositional Logic The simplest expression for logical truth is […]
Call for Abstracts Submissions for presentations of papers, panel discussions, workshops, performance sessions, and creative contributions, inspired by George Spencer-Brown’s work and life, are now warmly invited for the Laws of Form 2026 Conference (LoF26). There is no charge to attend or present at the conference. Submission Guidelines Please submit an extended abstract (up to 300 words) […]
Cactus Language for Propositional Logic The development of differential logic is facilitated by having a moderately efficient calculus in place at the level of boolean‑valued functions and elementary logical propositions. One very efficient calculus on both conceptual and computational grounds is based on just two types of logical connectives, both of variable -ary scope. The […]
chosen path 