Differential Logic • 2.2
• https://inquiryintoinquiry.com/2026/02/06/differential-logic-2-b/
Cactus Language for Propositional Logic (cont.)
The second kind of connective is a concatenated sequence of propositional expressions, written e₁ e₂ … eₖ₋₁ eₖ to mean all the propositions e₁, e₂, …, eₖ₋₁, eₖ are true, in short, their “logical conjunction” is true. An expression of that form is associated with a cactus structure called a “node” and is “painted” with the colors e₁, e₂, …, eₖ₋₁, eₖ as shown below.
Node Connective
• https://inquiryintoinquiry.files.wordpress.com/2020/04/cactus-graph-ej-node-connective.jpg
All other propositional connectives can be obtained through combinations of the above two forms. As it happens, the parenthesized form is sufficient to define the concatenated form, making the latter formally dispensable, but it's convenient to maintain it as a concise way of expressing more complicated combinations of parenthesized forms. While working with expressions solely in propositional calculus, it's easiest to use plain parentheses for logical connectives. In contexts where ordinary parentheses are needed for other purposes an alternate typeface (…) may be used for the logical operators.
Resources —
Logic Syllabus
• https://inquiryintoinquiry.com/logic-syllabus/
Minimal Negation Operator
• https://oeis.org/wiki/Minimal_negation_operator
Survey of Differential Logic
• https://inquiryintoinquiry.com/2025/05/03/survey-of-differential-logic-8/
Survey of Animated Logical Graphs
• https://inquiryintoinquiry.com/2025/05/02/survey-of-animated-logical-graphs-8/
#Peirce #Logic #Mathematics #LogicalGraphs #DifferentialLogic #DynamicSystems
#Inquiry #PropositionalCalculus #BooleanFunctions #BooleanDifferenceCalculus
#EquationalInference #MinimalNegationOperators #CalculusOfLogicalDifferences



