Let us now extend the CSP–GSB calculus in the following way:
Let us now extend the CSP–GSB calculus in the following way:
−
The first extension is the ''reflective extension of logical graphs'', or what may be described as the ''cactus language'', after its principal graph-theoretic data structure. It is generated by generalizing the negation operator <math>\texttt{(\_)}\!</math> in a particular manner,
+
The first extension is the ''reflective extension of logical graphs'', or what may be described as the ''cactus language'', after its principal graph-theoretic data structure. It is generated by generalizing the negation operator <math>\texttt{(_)}\!</math> in a particular manner,