Cactus Calculus

Table 6 outlines a syntax for propositional calculus based on two types of logical connectives, both of variable -ary scope.

• A bracketed sequence of propositional expressions is taken to mean exactly one of the propositions is false, in other words, their minimal negation is true.
• A concatenated sequence of propositional expressions is taken to mean every one of the propositions is true, in other words, their logical conjunction is true.

All other propositional connectives can be obtained through combinations of the above two forms.  Strictly speaking, the concatenation form is dispensable in light of the bracket form, but it is convenient to maintain it as an abbreviation for more complicated bracket expressions.  While working with expressions solely in propositional calculus, it is easiest to use plain parentheses for logical connectives.  In contexts where parentheses are needed for other purposes “teletype” parentheses or barred parentheses may be used for logical operators.

The briefest expression for logical truth is the empty word, abstractly denoted or in formal languages, where it forms the identity element for concatenation.  It may be given visible expression in this context by means of the logically equivalent form or, especially if operating in an algebraic context, by a simple   Also when working in an algebraic mode, the plus sign may be used for exclusive disjunction.  For example, we have the following paraphrases of algebraic expressions:

It is important to note the last expressions are not equivalent to the triple bracket

More information about this syntax for propositional calculus can be found at the following locations.

Resources

• Logic Syllabus
• Zeroth Order Logic
• Minimal Negation Operators

cc: FB | Differential Logic • Laws of Form • Mathstodon • Academia.edu
cc: Conceptual Graphs • Cybernetics • Structural Modeling • Systems Science