Complementary Calculi: Distinction and Differentiation

A further step to a graphematic turn in the construction and understanding of calculi

Rudolf Kaehr Dr. phil@

Copyright ThinkArt Lab ISSN 2041-4358

 

Abstract

The paper "Diamond Calculus of Formation of Forms. A calculus of dynamic complexions of distinctions as an interplay of worlds and distinctions” was mainly based on a deconstruction of the conditions of the calculus of indication, i.e. the assumption of a “world” and “distinctions” in it. The present paper “Calculi of Indication and Differentiation” opts for a graphematic turn in the understanding of calculi in general. This turn is exemplified with the George Spencer-Brown’s Calculus of Indication and the still to be discovered complementary Mersenne calculus of differentiations. The proposed study is restricted, mainly, to the mono-contextural case of dissemination of calculi.
First steps toward a graphematics had been presented with “Interplay of Elementary Graphematic Calculi. Graphematic Fourfoldness of semiotics, Indication, Differentiation and Kenogrammatics".
Graphematic calculi are not primarily related to a world or many worlds, like the CI and its diamondization. Graphematic calculi are studying the rules of the economy of kenomic inscriptions.
Graphematics was invented in the early 1970s as an interpretation of Gotthard Gunther’s keno- and morphogrammatics, inspired by Jaques Derrida’s grammatology and graphematics.
A new approach to a formalization of the calculus of indication and the calculus of differentiation too, is proposed.
Spencer-Brown’s calculus of indication has been extensively used to interpret human behavior in general.
The proposed new complementary calculus to the indicational calculus, the Mersenne calculus, might not be applicable to human beings, but there is a great chance that it will be a success for the interaction and study of non-human beings, such as robots, aliens, and Others.
SHORT VERSION (work in progress v.0.9)

1.  Indication and differentiation in graphematics

1.1.  Bracket Grammars

Moshe Klein has given a simple introduction to George Spencer-Brown's calculus of indication (CI) as a special case of a bracket grammar. A context-free language with the grammar: S --> SS|(S)| λ is generating the proper paranthesis for formal languages.

What was an act of a genius becomes an adhoc decision to restrict the grammar of bracket production. Set the restriction of bracket rules to: (()) () = () (()) and you get the basic foundation of the famous CI as introduced by George Spencer-Brown. Nobody insists that this is an appropriate approach but it seems that it takes its legitimacy from the formal correctness of the elaboration.

The law of complementarity
"There is no stronger mathematical law than the law of complementarity. A thing is defined by its complement, i.e. by what it is not. And its complement is defined by its uncomplement, i.e. by the thing itself, but this time thought of differently, as having got outside of itself to view itself as an object, i.e.`objectively', and then gone back into itself to see itself as the subject of its object, i.e.`subjectively' again.” (George Spencer-Brown, Preface to the fifth English edition of LoF)
http://www.hyperkommunikation.ch/literatur/spencer-brown_form.htm

Now, with the same decisionism, albeit not pre-thought by a genius, I opt for an alternative restriction, (( )) = ( ). This decision is delivering the base system for a Mersenne calculus, interpreted as a calculus of differentiation, CD.

I stipulate that both calculi, the CI and the CD, are complementary. And both calculi have additionally their own internal duality, delivering the dual calculi, i.e. the dual-CI and the dual-CD.

It will be shown that, despite of its non-motivated adhocism, both calculi are well founded in graphematical systems, and are to be seen as interpretations of independent complementary graphematical calculi. In fact, they belong, with the identity system for semiotics to the only two non-kenogrammatic graphematical systems of the general architectonics of graphematics.

        Bracket gramma r <br />     &nb ... p;    ) <br />        <br /> Production systems

        Mersenne brackets <br /> <br />      ... sp;      <br />         Production schemes

            Mersenne tree     ...     m          m       m  <br />

Rule systems    <br />      Numeric    i   ndicational ... ^n} | {1 ^n 2 ^(n + 1)}     <br />     

      Numeric    Mersenne rules <br /> <br />     ...  {2 ^n 1 ^n 2 ^1}     <br />      

2.  Brownian and Mersennian Calculi

2.1.  Towards Spencer-Brownian and Mersennian calculi

2.1.1.  Primary lessons out of the bracket systems

LoF                 Mersenne
distinction  --  differentation (separation)
indication   --  identification

Indication :              &nb ...               M2 : [[ ]] = [ ] .

2.1.2.  Brownian calculus

typeset structure                                                      
A distinction of 2 distinctions is a distinction.

typeset structure
A distinction of a distinction is no distinction.

  In Spencer-Browns wording:

   “A1. The value of a call made again is the value of the call. Calling
    A2. The value of a crossing made again is not the value of the crossing. Crossing"

"In his Laws of Form (hereinafter LoF), in print since 1969, George Spencer-Brown proposed a minimalist formal system, called the primary arithmetic, arising from the primitive mental act of making a distinction. He reached the next rung on the ladder of abstraction by letting letters denote, indifferently, a distinction or its absence, resulting in the primary algebra. The primary arithmetic and algebra featured a single primitive symbol ‘ typeset structure’ in LoF.” (Meguire)          

2.1.3.  Mersenne calculus

typeset structure

A differentation between 2 differentiations is an absence of differentiation.

typeset structure
A differentiation of a differentiation is a differentiation.

Paraphrase
    M1. The value of a call made again is not the value of the call. Calling
    M2. The value of a crossing made again is the value of the crossing. Crossing"

"In his Laws of Differentiation (hereinafter LoD), in print since 2011, Rudolf Kaehr proposed a minimalist complementary formal system to the LoF, called the primary complementary arithmetic, pca, arising from the primitive scriptural act of perceiving a differentiation. He reached the next rung on the ladder of graphematic abstraction, the Mersenne calculus, MC, by letting characters inscribe, differently, a differentiation or its absence, resulting in the primary complementary algebra, CD. The primary complementary arithmetic and algebra featured a single primitive symbol ‘ typeset structure’ in LoD.” (Kaehr)  

A morphic turn for LoD and LoF

A Morphic Turn for LoD
"In his Morphic Laws of Differentiation (hereinafter MorphLoD), in print since 2012, Rudolf Kaehr proposed a minimalist complementary formal system to the LoF, called the primary complementary morphic arithmetic, morph-pca, arising from the primitive scriptural act of perceiving patterns of differentiations.

He reached the next rung on the ladder of graphematic abstraction considering the morphic structure of patterns of differentiations and absences of differentiations, the morphic Mersenne calculus, morphMC, by letting patterns of characters inscribe, differently, a differentiation or its absence, resulting in the primary complementary morphic algebra of differentiation, morphCD.

The groups of differentiations, called situations, are defined by the Mersenne distribution of elementary differentiations with the combinatorial formula: 2n-1. Such groups are embedded into differential contexts.

The primary complementary arithmetic features two primitive symbols ‘ typeset structure’ and “∅ “ in LoD.
The pattern or morphic approach is motivated by the fact of the morphogrammatics of the MorphLoD as being a part of the graphematic writing systems.

While the primary complementary morphic algebra features a group of primitive constellations of symbols, ‘ typeset structure’ and ‘∅’,  in morphLoD.” (Kaehr)  

A Morphic Turn for LoF

The groups of distinctions, called constellations, are defined by the Brownian distribution of elementary distinctions with the combinatorial formula:

Brown  _ (n, m)   = ((n + m - 1)/n) .

Accepting the pattern-oriented approach as primordial, it is just a natural step to the development of an element-oriented approach of the classical CI and the proposed CD in its first presentation as a an element-oriented calculus too.


typeset structure

Some further introductions in German at:
http://www.thinkartlab.com/Memristics/Komplementaritaet/Komplementarität%20in%20der%20Graphematik.pdf

2.1.4.   How to draw a difference between distinction and differentiation?

Graphematics of Mersenne and Spencer - Brownian calculi

Mersenne               & ...  (B) : (aa)       (bb)        (ab) <br />

Comparison models          

M = (m, M  _ 1, M  _ 2 )           ...  m  _ 2},     b = {b  _ 1, b  _ 2} . <br /> m , b = {a, b}

Theorem M sim J    iff     M  _ 1 sim    J  ...  (b  _ 2) = m  _ 1,    M  _ 2 (b  _ 1) = m  _ 2

Morphograms and sequences
A further difference between the Mersenne and the Brown calculus is naturally given by the difference of morphograms, MGs, and sequences, Seqs, or monomorphies and constellations of the configuration for m=n=2.

      Systems          & ... a   b Second - level   partitions   and   the   reflectional   property   Ord  _ refl (m)

Another differentiation is achieved with the question of second-level partitions (Moshe Klein) for the graphematics systems of the different calculi. Because of the minimal complexity of the introduced CI and CD with m, n=2, an application of the question of  second-level partitions is not delivering any useful results. Nevertheless, a reflection on the notion of partition, i.e. a partition of partition, is an interesting feature for any calculus. With an extension of the complexity even to just m=3, the covered features are appearing clearly.

It should be reflected that a first-level and a second-level operation of addition based on first-order and second-order distinctions has to be differentiated. In a term like “{1 +{{1+1}}", that is representing the bracket-notation for the CI, there are 2 different kinds of additions involved: a first-level addition “+1”  and a second-level addition "+2”, hence the term is reflectionally: “{1 +1{{1+21}}".

From the standpoint of a theory of reflection (Gunther) which takes into account the difference of the levels of reflection (distinction), it would be more interesting to study the reflectional properties of the process of “nivilation” of partitions towards a conglomerate of indistinguishable elements instead of the results of the elimination of the difference alone. This process second-level reflection is measured by Ordrefl(n).             

Example
m = (3):  {3}, {2 + 1}, {1 + 1 + 1}                       :first-level partition, P(n)
        {3}, {2 + 1}, {{1 +2 1} +11}, {1 + 1 + 1}  : second-level partition, spn
Ordrefl(3) = 2

Table
typeset structure

Therefore, a calculus with complecity n=2, like the CI and CD, has no properties of second-level reflection. A calculus with n=3 has 1 second-level property, written as diff(n).
http://memristors.memristics.com/Interplay/Interplay%20of%20Elementary%20Graphematic%20Calculi.html

Diagrams of distinction and differentiation <br />

FormBox[RowBox[{              ... }}]}]}], BoxMargins -> {{0.2, 0.2}, {0.4, 0.4}}], TextForm],     }], TextForm]

Metaphors
Brown’s tabula rasa world, cut by the act of a distinction. Mersenne’s streams of signs. Differentiated by the perception of a differentiation.

"Distinction without difference.”: typeset structure  or typeset structure but typeset structure != typeset structure ?
"Difference without distinction.”

The motivation for Brownian distinctions are founded in the Mersennian process of differentiation; both are interacting simultaneously together. This interplay of “constructivist” and “recognicist” actions is marked by the quadralectics of both calculi.

"Discuss the distinction between indicational and differential calculi. Is there a difference or is it a distinction?”
"How to draw a difference between a distinction and a differentiation? How is it indicated?”

At first, the graphematic complementarity approach is in no way forced to establish a hierarchy between the concepts and strategies of distinction and differentiation.

Secondly, the involved calculi are not forced to reduce their space of realizations to mono-contexturality.
http://www.cpsa-acsp.ca/paper-2003/gaon.pdf

Operator-operand interplay: The “Cross” as an operator and as an operand

"The true nature of the distinction between the pa on the one hand, and 2 and sentential logic on the other, now emerges. In the latter formalisms, complementation/negation operating on "nothing" is not well-formed.
But an empty
Cross is a well-formed pa expression, denoting the Marked state, a primitive value. Hence a nonempty Cross is an operator, while an empty Cross is an operand because it denotes a primitive value.
Thus the
pa reveals that the heretofore distinct mathematical concepts of operator and operand are in fact merely different facets of a single fundamental action, the making of a distinction.” (WiKi, Laws of Form)

The Cross as an operand: typeset structure,
The Cross as an operator: typeset structure.

Obviously, the functionality of the Cross is depending on the contextual use of the Cross. It is lazy thinking to tell that the Cross is both an operator and an operand, i.e. ”merely different facets of a single fundamental action”. The Cross is acting, functioning or playing as an operator or (exclusively) as an operand. But the Cross is not acting as both at once.
A similar situation is well known for the calculus of Combinatory Logic (Schönfinkel, Curry, Fey, Rosenbloom, Barendregt).

Structural   difference   

             Indicational graph  & ... nbsp;     <br />            

Bracket interpretation of graphematic constellations

typeset structure

typeset structure

Interpretations, again
LoF
Following Wolfram’s statement, according to M. Schreiber:
"A kind of form is all you need to compute. A system can emulate rule 110 if it can distinguish: ‘More than one is one but one inside one is none.’
Simple distinctions can be configured into forms which are able to perform universal computations.”

LoD
"A kind of structuration is part of what you need to transpute. A system can inscribe the complementary rule 110” if it can differentiate: ‘More than one is none but one inside one is one.’
Complex differentiations can be inscribed into structurations which are able to create pluri-versal transputations.”

LoF & LoD
Both together, and set into a polycontextural framework, are staging polyversal co-creations in the doman of distinctions, differentiations and worlds.

2.1.5.  Meta-theorems

CI-Brown
T9:
If any space contains an empty cross, the value indicated in the space is the marked state." (Varela, p. 114)

Theorem   T9 :        <br /> e = p  _ 1 0 p  _ 2 ... xF3A0; _ 1 0 e  _ 2    => e  _ 1 0    e  _ 2 = 0 .

This is properly marking the    context - free occurrences of distinctions in the CI .              

Theorem   T12 : <br />   p p = ⌀ <br /> Theorem   T13 : <br />   p r     q r =  p     q    r  Null

CD-Mersenne
DT9:
”If any constellation is enveloped by a singular differentiation, the situation differentiated in the constellation is the singular differentiation."

Theorem   DT9 :    <br /> e = p  _ 1  p  _ 2 <br />   &nbs ... xF3A0; _ 2    =>     e  _ 1  e  _ 2    =  .

This is properly marking the    context - free occurrences of differentiations in the CD .              

Theorem   DT12 : <br /> p  p =  .

With substitution and M1, M2 : <br /> 1. p =  :    =   =     2. p = ∅ : ∅  ∅ =  =     . <br />

Theorem    DT10 The simplification of an expression is unique .

Theorem DT13
Let p, q, r stand for any expressions. Then in any case,

DT13 :     p r      q r    =        p & ... nbsp;  q =   p     q =     .         

2.1.6.  Duality

Duality is well known as an interesting property of formal systems with structural and economic advantages; ”Two for one.” (Herrlich)

Duality for indication calculi
P, A ∈ CI ,
P: property and op= duality operation

1. (Aop)op = A,
2. Ptypeset structureholds if and only if P(Aop) holds.

Example
X, Y ∈ CI:
X = Y   -->  Xop = Yop
For X = AB, Y = BA:

AB = BA  --> typeset structure =  typeset structure


Duality of Mersenne calculi
CM: p = q  -->  typeset structure = typeset structure


typeset structure

2.1.7.  Epistemological complementarity

Both characterizations are referring to the distinctions (differentiations) made, and inscribed, by its marks. There is no reference to an outside world which has to be divided and marked needed.

Mersenne calculi are not referring to a world to be divided but to the media they are inscribed. Hence, they are reflecting and referring to themselves instead of an external world which needs observer who are making distinctions in this world.

Also the basic “beginnings" (initials, axioms) of the complementary Brownian and the Mersennian calculi look intriguingly simple and more like duals of each other than highly different complementary approaches, the consequences of the differences and similarities becomes surprisingly decisive and clear in the “algebra” of both calculi.

Spencer-Brown
The most fundamental activity is to draw a distinction and to mark it.
This marks the constructivitic appraoch of a subject to the world (Kant).

“Draw a distinction! Mark it!” refers to a so called world, and implies an actor of the distinction.
"Distinctions splits the world into two parts, [...]. One of the most fundamental of all human activities is the making of distinctions.” (Principles of Biological Autonomy, Varela, 1979, p. 84)

There is no need to privilege a starting point as the ultimate beginning and determination of human activities as the Brownians are insisting. There are other possibilities too, and there is also no chance to legitimate or to prove the correctness of such a statement about any beginnings.
http://www.vordenker.de/ics/downloads/logik-second-order.pdf

Mersenne
The most fundamental activity is to separate and to identify the separated.
"Without separation no identification, and vice versa."

This hints to the transcendental-phenomenological turn to the “Sachen selbst” (Husserl, Heidegger) as a complementary approach to cognitivistic constructions.

There is no need to privilege a starting point as the ultimate beginning and determination of human activities as the Brownians are insisting. There are other possibilities too, and there is also no chance to legitimate or to prove the correctness of such a statement about any beginnings. There is also no need to insist on a Mersenne complementary statement about the importance of beginnings.

Spencer-Brown/Mersenne
The constructivistic approach of the CI is forgetting that it needs something to construct something, even if this something is self-referentially constructed by itself.
The “transcendental-phenomenological” approach of the CD is forgetting that it needs methods to detect something that is not yet a detected method.

Both approaches are denying their “blind spot”, unmasked by the graphematical approach as the graphematic “gaps” of the calculi. Both gaps are complementary to each other.

Instead of the constructivist activity to draw a distinction in a presumed world as demanded by the CI, the CD ask to accept the perceived or encountered difference in the world as a separation or differentiation of something, especially something written or inscribed, independent of an active and constructivist observer but depending on someone who is able to accept what is given. The given is not a pre-given entity from nowhere but a cultural event of other cultural events, i.e. cultural agents. With this turn, miseries of solipsism are results of blindness towards what is given as encountered in an happenstance of encounter.

In other words, the CI is drawing distinctions, the CD is encountering events.
For the CI, the ‘patron’ might be Immanuel Kant, for the CD, a reference to Alfred North Withehead might be accurate.

Hence, the interpretation of the initials of the CD are becoming:
M1: The iteration (of the acceptance) of an event is the absence of (an acceptance of) an event. And,
M2: The (acceptance of an) event of an event is (the acceptance of) an event.

Graphematics
The most fundamental activity is to live the “Schied” of the “Unterschied”, i.e. the ‘tinction’ of the dis-tinction, distinction and difference, between the two complementary ‘tinctions’ of Brown and Mersenne and their dual forms of inscriptions as part of the general system of graphematics. The “Schied” of the “Unterschied” is in the history and ressemblance with the process of  “différance” as close as possible to the movement of identity.

Both, the Brownian calculus of indication and and the Mersennian calculus of differentation might be based on the graphematic system of inscription. Both appears as interpretations of different graphematic systems, belonging to the general system of graphematics.
How is the system of graphematics introduced? Is there any transparency or is it as obscure as the introduction of the Calculus of Indication?

Graphematics are an interpretation based on the classification of partitions of a set of signs. It is proved that this classification system of sets of signs is complete. With the Stirling Turn, graphematics is based on kenogrammatics and not anymore exclusively on semiotics.

Gaps
Gaps appear in the interaction between different calculi, i.e. CI, CD and semiotics. There is no direct access for a calculus to its own gap. Hence, a gap is a blind spot of a calculus. An interactional calculus of indication and differentiation is including the interactivity of calculi and gaps. Gaps are a third category to the “mark”, “unmark” , ⌀, and differentiation and absence of differentiation, ∅.

Algebraic and Co-algebraic characterizations
There is also no single point of beginning in graphematical scriptures, like “Mark it!”. The “algebraic” distinctions of syntax, semantics and pragmatics are not guiding for graphematic formal systems (languages, i.e. scriptures).

Algebraic CI:
”In the beginning there is a space, normally a plane surface, that is featureless but upon which symbols (a primitive notion) may be inscribed.” (Meguire)

Co-algebraic graphematics
"There are always symbols to encounter that are defining a space of inscriptions. Such a scriptural space is never featureless, and symbols, marks and signs (complex kenoms) are always distinguishable and are always further differentiated by coordinated inscriptions.” (paraphrase)

"Interaction of actors has no specific beginning or end. It goes on forever. Since it does so it has very peculiar properties.” (Gordon Pask, 1996)

What might be presupposed for the CI as minimal conditions, is a 2-dimensional open field of kenomic marks. Then, to each identified kenomic mark of the two dimensions the questions leading to the initials “J1” and “J2” might be asked and answered by the indicational rules of J1 and J2 of the Laws of Form.

Calculi, like the CI and the MC, arise as “interpretations” of graphematic streams of kenomic inscriptions.

A formalization of the behavior of the graphematic systems implied by the calculi CI and CD would have to be realized as an interplay between algebraic and co-algebraic tectonics.

Also both calculi are, in their complementarity, very similar, they are based on strictly distinct graphematic systems.

The whole wording introduced by GSB to characterize the process of distinction and indication related to a space and time, is a relict from a subordination of writing to the aim of representation in the tradition of sign-related ontology. From a graphematic point of view, only the inscriptions and their laws are of relevance.

This is a step further towards a graphematic understanding of calculi compared to the sketch presented by the Diamond Calculus approach which is still emphasizing the proemiality of ”world” and “distinction”.

2.1.8.  Qualitative characterizations

Qualitative characterizations of the graphematics of Brownian and Mersennian configurations
Following Matzka’s charcterizations of semiotic, indicational and trito-systems (or strings), but omitting Mersenne systems, the formal approach of Schadach gets some intuitive support additionally to its strictly combinatorial treatement.

General assumption
(A) If the two given tokens of strings have different lengths, then they are different.
If they have equal lengths, then go to (B).

x = (a1 a2 a3... an),
y = (b1 b2 b3 ... bm),
m=n or m!=n.

Identity
(B) For each position i from 1 to the common length, check whether the atom at the i-th position of x equals the atom at the i-th position of y. If this is true for all positions i, then the given tokens are equal, otherwise they are different.

Spencer-Brown
(B') Check whether each atom appears equally often in both string-tokens. If this is the case, then they are equal, otherwise they are different.

Here we have enlarged the abstractive distance between string-token and string-type, by including the abstraction from the order of the atoms into the abstraction from token to type.

Trito-stucture
(B'') For each pair i, k, i<k, of positions, check whether within x there is equality between position i and k, and check whether within y there is equality between position i and k. If within both x and y there is equality, or if within both x and y there is inequality, then state equality for this pair of positions, otherwise state inequality for this pair of positions. If for each pair of positions there is equality, then x and y are equal. Otherwise they are not.

Mersenne
(B“‘) For each pair i, k, i<k, of positions, check whether within x there is equality between position i and k, and check whether wihin y there is equality between position i and k. If within both x and y there is equality for all i, k, and additionally (B) holds, then x and y are equal. Otherwise they are not.

2.1.9.  Combinatorial characterizations

typeset structure

2.2.  Comparison of primary arithmetics and algebras of CI and CD

The graphematic complementarity of CI and CD is reflected in the complementarity of their arithmetics and algebras.

Graphematic constellations

typeset structure    typeset structure

How are the graphematic situations mirrored in the formulas of the calculi?

For the CI it seems easy to show the property of commutativity of the terms, like
typeset structure typeset structure  = typeset structure typeset structure
typeset structure   = typeset structure  

How is the non-commutativity in the CM represented?
typeset structure typeset structure = typeset structuretypeset structure --> typeset structuretypeset structure = typeset structuretypeset structure--> ∅ = ∅.

States and constellations:
CD = {typeset structure, ∅}
CD-constellations = {typeset structure, typeset structure typeset structure , typeset structure typeset structure }.

CI = { typeset structure , typeset structure}
CI-constellations = {typeset structure, typeset structure typeset structure, ∅∅}

Concatenation, combination and superposition
CI:

X ∈ CI, Y ∈ CI  =>  X^Y ∈ CI : concatenation
X ∈ CI, Y ∈ CI  =>  X(Y) ∈ CI : superposition

CD:
X ∈ CD, Y ∈ CD  =>  X*Y ∈ CD : combination
X ∈ CD, Y ∈ CD  =>  X(Y) ∈ CD : superposition

Equality in CI and CM
Equality in the CI is defined in a traditional way, i.e. an equality relation is reflexive, symmetric transitive.
Therefore, x = x and x != typeset structure, hence:

CI: typeset structure != typeset structure  --> typeset structure != typeset structure.

This corresponds in the CI properly the graphematic situation: (aa) != (bb), confirmed with:

CI: typeset structure  != typeset structure typeset structure  --> typeset structure != typeset structure ⌀ --> typeset structure != typeset structure .

The corresponding situation for the CD is given with (aa) = (bb) and confirmed with:

CD: typeset structure = typeset structure typeset structure  -->  ∅ = typeset structure -->  ∅ = ∅.

And in particular: (a) = (b):

CD: typeset structure = typeset structure  -->  typeset structure = typeset structure.

Trans-classical concept of equality
As introduced in earlier papers, the equality relation gets a deconstruction into a system of different types of equality:
equality, equivalence, similarity, bisimilarity and metamorphosis. All those concepts or paradigms of “equality” are applicable to a general theory of graphematically based calculi.
http://memristors.memristics.com/Church-Rosser%20Morphogrammatics/Church-Rosser%20in%20Morphogrammatics.pdf

2.3.   Basic interpretations

typeset structure


CI : typeset structure = typeset structure,         corresponds to: (aa) !=Brown (bb).

CD: typeset structure,           corresponds to: (aa) =Mers (bb).

CI:  typeset structure,          corresponds to: (ab) =Brown (ba).

CD: typeset structure  =  typeset structure, corresponds to: (ab) !=Mers (ba).

<br /> Comparison of the    CI and CD formula " exchange " <br /> <br /> C ... sp;                 # <br />

CD :  p  q    =  q  p        (Exchange ... 9;     -->      =        -->  =  .

<br /> CD1 :     p     =    p <br /> p =  :  =   &n ... =    :    =  <br />     = ∅ :   ∅ = ∅ . <br />    

Logic    val ( p  q) = val ( q  p)     (Exchange) non ... 44; 2) eq non ( non (2) ∨ 1) non (2 ∨ 2) eq    non (1 ∨ 1) 1 eq 2 : #

Hence, the formula of "exchange" in the calculus of differentiation CD is specific for the CD. It doesn’t hold in the calculus of indication, CI, nor in a Boolean logical interpretation with negation and conjunction (disjunction). Therefore, the calculus of differentiation is not modeled by a Boolean algebra as this is the case for the calculus of indication (minus some differences).

"Negation” in CD?
How to define “negation” in CD if the calculus of differentiation, CD, is negation-invariant?

val (    p) =    (p)     p = p        =            ∅     = W ...  =>      = ∅ <br /> p = ∅  =>     ∅ =     .

Again,
M1: A repetition of a quotation is the absence of a quotation.
M2: A quotation of a quotation is a quotation.

3.  Primary arithmetics and algebra of CI and CD

3.1.  Table of some complementary laws

 CI - Meta                                                                                     ...                                    <br /> Simplification <br /> Completeness <br /> Theorem D 11.9

                                                                                               ...                  morph               Classification <br /> of constellations <br /> as Hom and Het


typeset structure

3.2.  Explanations for Mersenne laws

C1: A differentiation of a differentiation of a situation p is a differentiation: typeset structure
C2: The differentiation of 2 situations, p and q, combined with the second situation is the
       differentiation of the first situation p combined with the second situation q: typeset structure
C3: A differentiation of a differentiation combined with a situation is a differentiation: typeset structure
C4: A differentiation of a situation p combined with a differentiation of a combination of a situation
       q combined with the differentiation of the situation p is a differentiation of p: typeset structure .
C5: The repetition of a differentiation is the absence of a differentiation: typeset structure.
       (The iteration of the same differentiation is not a differentiation.)
C5’: The differentation of the repetiton of a situations p, is a differentiation per se: typeset structure = typeset structure .
     : To differentiate and to differentiate and to differentiate again is to differentiate: typeset structure typeset structure typeset structure =    
        typeset structure, i.e. p p = ∅, but p p p = p, based on M1, i.e. typeset structure typeset structure typeset structure typeset structure= typeset structure.  

4.  Proofs of some complementary laws

4.1.  Algebraic proofs for CI and CD

Algebraic proofs are not referring anymore to states and meta-states of a formula. They refer solely to some selected formulas, proven as correct and used as axioms, and the rules of equality and substitutions applicable in the domain.

4.1.1.  Algebraic proof for CI

Example
Proof based on (GSB) the CI initials J1, J2 and equality.

CI1: typeset structure = a

1. typeset structure typeset structure             J1, 0
2.   typeset structure typeset structure   J2, 1
3.  typeset structure                  J1, 2
4.   typeset structure        J1, 3
5.   typeset structure a          J2, 4
6.     a                           J1, 5.

4.1.2.  Algebraic proofs for CD

Examples
Proof based on N1, N2 and equality.


typeset structure


typeset structure

Applying the rules Het and Hom   CI <br />    0.     a = a,  &nb ... sp;     a =  a         2, 0    <br />

4.2.  Tableaux proofs for CI, CD and PC

4.2.1.  Tableaux for propositional logic

Rules for concatenation
Concatenation is either disjunctive or conjunctive exclusively.
Rules for signatures
T (typeset structure ) = F
F (typeset structure ) = T.

Example
log2: typeset structure =  typeset structure disjunctive                  log2: typeset structure =  typeset structure conjunctive

  1. F  typeset structure              (0                        1. F  typeset structure              (0
  2. T   typeset structure               (0                        2. T   typeset structure               (0
  3. F typeset structure                        3. F typeset structure  |  F q       (1           
  4. F q                      (1                        4. T p q    | T p q     (3
  5.  T p q                  (3                        5. T p       |  T p       (4
  6.  T typeset structure       | T q    (2                         6. T q      |   T q      (4
  7. F p          |   #     (6                        7. T typeset structure    |    #       (2
  8.  T p | T q |          (5                        8.  F p      |              (7
  9.  #      #                                          9.  #

4.2.2.  Tableaux for the calculus of indication

Rules for concatenation
Concatenation is disjunctive or conjunctive.

Rules for signatures
T (typeset structure ) = F
F (typeset structure ) = T.

e1: typeset structure                                       e2: typeset structure =  typeset structure disj.

1. F typeset structure         1’.   F p                          1. F  typeset structure       (0
2. T p              2’.  T typeset structure                      2. T   typeset structure        (0
3. T typeset structure            3’.   F  typeset structure                       3. F typeset structure          (1         
4. F p              4’.   T p                          4. F q              (1
5. #                5’.   #                            5.  T p q           (3
                                                            6.  T p | T q     (5
                                                     7. F p | T q | #      (2
                                                     8.   # | #   |          (5

4.2.3.  Tableaux for the calculus of differentiation

Rules for signatures
T (typeset structure ) = T but T (typeset structure typeset structure ) = F
F (typeset structure ) = F and F (typeset structure typeset structure ) = T.

Contradiction set:
# = {typeset structure, typeset structuretypeset structure } for CD
value set = {T, F} for signatures.

Rules for concatenation
Concatenation is disjunctive or conjunctive.

Hence,
T p q            F p q
     /\                  |
  T p T q            F p
                        F q

Contradiction
1. Proof by contradiction of signatures, based on Mersenne M2: typeset structure.
Equality “=" is taken as double implication.

Examples
d1 = typeset structure

Tableau (d1):
1. F typeset structure  (0.            1. F typeset structure  (0.
2. T typeset structure     (0.             2. T typeset structure     (0.
3. T p       (2.             3* F p     (1
4. F typeset structure     (1.             4* T p     (2
5. F p       (4.             5* #
6.  #

d2 = typeset structure= typeset structure  

Tableau (d2):                                  Stripped of differentiation operation:
1.  F typeset structure     (0.                             1*.   F typeset structure     (0.
2.  T typeset structure     (0.                             2*.  T typeset structure     (0.
3.  F  typeset structure         (1.                             3*. F p q          (1
4.  F q             (1.                             4*. T q p          (2
5.  F p             (3.                             5*. F p            (3
6. T q | T typeset structure    (2.                             6*. F q             (3
7.       | T p      (6.                             7*.  T q  | T p  (4
7.  #       #      (6, 4; 7, 5                  8*.  #   |  #

2. Proof of annulation: p p = ∅, based on Mersenne M1: typeset structure

d3: p p = ∅
1. F p p  (0.)        1’.  F ∅  
2. T ∅    (0.)         2’. T p p
3. F p     (1.)         3’. T p | T p
4. F p     (1.)         4’. #  | #     (1’, 3')
5. #

d4: typeset structure = typeset structure  
Tableau (d4):

1. Ftypeset structure      (0
2. T  typeset structure    (0
3.  T typeset structure typeset structure       (2
4. F typeset structure       (1
5. F typeset structure          (4
6. F r                 (4
7. F p                (5
8. F q                            (5
9. T  typeset structure     |   Tq r        (3
10. T p r      | T q | T r   (9
11. T p | T r |                (10
12.  #    #      #     #

Comment
The formulae typeset structure =  typeset structure ,  typeset structure= typeset structure are generally provable in CI, CD and PC.

4.3.  Recursive arithmetics for Mersenne and Brownian calculi

4.3.1.  Recursive arithmetics for Mersenne calculi

A comparison of Spencer-Brown’s calculus of indication, CI, and the postulated complementary Mersenne calculus of differentiation, CD, is not emphasizing properly enough its differences based on its underlying structural difference of the corresponding graphematical systems. In fact, the underlying graph-models, tree and commutative graph, are hinting to the very difference of the structures of both calculi.

It seems that the strictly complementary behavior of both calculi is clearly established. This give the chance to disseminate them in a polycontextural framework, where they hold simultaneously, and allowing to study the complementarity of the indicational and distinctional aspects of events.

A similar comparison to the recursive arithmetic setting is available with the modeling of indicational and differentiational features in a cellular automata framework.

Both calculi are extracting interesting features out of the graphematic systems but are, as far as they are defined up to now, not yet covering the full range of its operative and formal properties. Both calculi, the CI and the CD, are “state"-oriented, i.e. the results of their demonstrations are, in fact, the states “mark” and “unmark”.  Both states are atomic, there are no patterns, i.e. morphograms involved. Like it would be suggested by the constellations “(tt), (tf), (ff)" for the CI and “(tt), (tf), (ft)" for the CD. Hence, the variables are defined over tuples of states and not on atomic states.

The asymmetry of both graphematic systems is not yet mirrored in the calculi. It seems, that a further analysis, based on the recursive behavior of both graphematic systems might give some additional insight into the developed structure of the calculi.

In contrast to semiotic and numeric recursivity, i.e. recursivity in the mode of identity, Mersenne and Brown recursivity has to introduce a normal form (standard notation) selection from the possible semiotic representations of Mersenne and Brown “strings” or “numbers”. Similar to the trito-normal form (tnf) for trito-kenogrammatic operations.

       typeset structure     

       typeset structure

Examples for Mersenne calculi

Addition Sum
Sum(a, 0) = a
Sum(a, Succ 0)  = Succ(Sum(0, a))
                = Succ(a) = {aa, ab, ba}.          : R2.x

Sum(a, Succ a)  = Succ(Sum(a, a))
                = Succ(aa, ab, ba) = {aaa, aab, bba; aba, abb; baa, bab}.

Sum(a, Succ aa) = Succ(Sum(a, aa))
                = Succ(aaa, aab, bba),
                = Succ(aaa) = {aaaa, aaab, bbba},  : R2.x
                = Succ(aab) = {aaba, aabb},        : R2.1, R2.2
                = Succ(bba) = {bbaa, bbab}.        : R2.1. R2.2

Sum(a, Succ aaa) = Sum(a,(aaaa, aaab, bbba)
                 = {aaaaa, aaaab, bbbba; aaaba, aaabb; bbbaa, bbbab}.

Multiplication Prod
Prod(a, 0) = 0
Prod(a, Succ 0) = Sum(a, Prod(a, 0)) = Sum(a, 0)) = a
                = Prod(a, a) = a
Prod(a, Succ a) = Sum(a, Prod(a; aa, ab, ba)) = Sum(a, (aa, ab, ba))
                = {aaa, aab, bba; aba, abb; baa, bab}.

4.3.2.  Recursive arithmetics for Brownian calculi

       typeset structure  

Examples for Brown calculi

Addition Sum
Sum(a, 0) = a
Sum(a, Succ a) = Succ(Sum(a, a))
               = Succ(aa, ab, bb) = {aaa, aab; abb; bbb} : R2.x
                                   with {aba, bba} ∉ bnf
Sum(a, Succ aa) = Succ(Sum(a, aa))
                = Succ(aaa, aab, bba, bbb)
                = {aaaa, aaab, bbba; aaba, aabb; bbaa, bbab; bbbb}.
                                   with {aaba, bbaa, bbab} ∉ bnf
Sum(a, Succ ab) = Succ(Sum(a, aa))
                = Succ(aa, ab, bb) = {aaa, aab; abb; bbb}.

Sum(a, Succ bb) = Succ(Sum(a, aa))
                = Succ(aa, ab, bb) = {aaa, aab; abb; bbb}.

Multiplication Prod
Prod(a, 0) = 0
Prod(a, Succ 0) = Sum(a, Prod(a, 0)) = Sum(a, 0)) = a
                = Prod(a, a) = a
Prod(a, Succ a) = Sum(a, Prod(a; aa, ab, bb)) = Sum(a, (aa, ab, bb))
                = {aaa, aab; abb; bbb}.

Comparision
Prod(a, Succ a)
Brown:       Sum(a, Prod(a; aa, ab, bb)) =
                 Sum(a, (aa, ab, bb)) =
                 {aaa, aab; abb; bbb}.

Mersenne: Sum(a, Prod(a; aa, ab, ba)) =
                 Sum(a, (aa, ab, ba)) =
                 {aaa, aab, bba; aba, abb; baa, bab}.

5.   Recursion and self-referentiality

5.1.  Reentry for CD

5.1.1.  Reentry introduction and comparison

"By adding reentry as a third term, Varela took Spencer-Brown’s work a step further and left behind the tame, two-valued world of Aristotelian logic. Varela made the radical assertion that reentry, along with paradoxical dynamics it entails, is built right into the very structure of the form. Varela upheld reentry as the cornerstone to autonomous functioning in nature.” Terry Marks-Tarlow, Mario E. Martinez, Francisco Varela (1946-2001), in: Society for Chaos Theory in Psychology & Life Sciences 2001, 9 (2), 3-5.
http://www.biocognitive.com/images/pdf/Francisco_Varela.PDF

typeset structure

LoF example  a  b    -->    a  b a  b  &nb ... A0; b     -->    : a  b  . _     

<br /> LoD example <br />  a    b    -->     a    b  &nb ...     a    b     --> :  a    b    . <br />

Eigenvalue for differentiations <br />     f =     f f <br />  & ... ; f =        f , we get : <br /> <br /> SR : f ≡  f =     f .

<br /> This hints to Smullyan ' s self - quotation of an expression . <br /> Representation of logical negation    in the CD with "    f    f " .

http://memristors.memristics.com/MorphoReflection/Morphogrammatics%20of%20Reflection.html

5.1.2.  A flip-flop application:

Brownian case z = z y x z ' =    z y x     =     y  x        (Varela)

6.  Bifunctoriality of Brownian and Mersennian calculi

6.1.  Polycontextural distribution of CI and CD

Brownian and Mersennian calculi are accessible to category-theoretic considerations. And might therefore been distributed over different contextures of a polycontextural category. Interactions between different contextures containing different calculi are well ruled by the construction of bifunctoriality between discontextural contextures. Such a polycontextural dissemination is just a first step to emphazise with the means of category theory the complementary aspects and their interplay of  Mersennian and Spencer-Brownian calculi.

CI : <br /> J1 :       _ 2      _ 1    =  & ...  ) = id                

CD : <br /> M1 :   _ 1   _ 2 = ∅ cat - M1 :     &nbs ... bsp;  : Brown             <br /> Null

     BIFUNCTORIALITY OF    MERSENNE ,   BROWN   and   SEMIOTICS <br /> <br ...                                                                                                Sem

With such a bifunctorial framework it is possible to distribute complementary formulae over the polycontextural grid.
From the point of view of the third contexture, both calculi are accessible to analysis of their semiotic properties and the embedment into the general framework.

6.2.  Monocontexturality of CI and CD

Albeit the insistence of a “two-dimensional” notation and conception of the indicational Laws of Form, any dimensionality is reduced to one-dimensional linearity by the primary arithmetic law J2 and the law of reflexion. The same holds complementarily for the CD. The law of double differentiation is reduced to a single differentiation. Their might be some topological detours but the results of such journeys is always something simple and never involved in any non-reducible complexity. Such a indicational and differentiational simplicity is, together with the identificational simplicity of semiotics (logic), a strong criterion for mono-contexturality.

As it was pointed out with the paper “Diamond Calculus of Formation of Forms” there is a natural way to disseminate the calculus of indication over different loci: the double meaning of the “zero'-indication as a nullity in its calculus and at once as an indication in a neighboring other indicational calculus. This is formalized by the law of enaction. Obviously, the same holds complementarily for the calculus of differentiation too.

The “Diamond Calculus” paper is not yet dealing with the complementary calculus of differentiation, CD. The elaborations for the CI of “interactional and reflectional” indications, enactions and retro-grade recursivity have to be mirrored in the complementary setting of the CD.

With the concept of distributed and mediated enaction, the limitations drawn by the mono-contexturality of the CI and the CD are well overcome. The price to pay is an acceptance of other graphematic systems as grid for dissemination, keno- and morphogrammatics, of the trito-structure of graphematics. This polycontextural approach is not considered in this study.

6.2.1.  Enaction rules for the CI

      Enaction rule <br /> <br />      0  _ 1  ...  : 0  _ 1  _ 1 -> 0  _ 2 )) <br />       

                 En ... ; ↔ ((∅  _ (i . j))/(0  _ (i + j, . j + 1)))     <br />

   <br />    Laws of dynamics in complexions of LoFs <br /> <br />    1. c ...  1)))      & destruction <br />        

6.2.2.  Enaction rules for the CD

   <br />    Laws of dynamics in complexions of LoDs <br /> <br />    1. c ... _ i -->  ((∅  _ i)/(    _ (i + 1)))    & destruction <br />

   <br />     Interplay between CI and CD <br /> <br />     ...  i  _ i    -->  (--  _ i/(    _ (i + 1)))    <br />

7.  Cellular automata of CI and CD

7.1.  Indicational CAs

Indicational CAs are identical to the indCAs introduced in previous papers.

Calculus of indication: a=a, a!=b, ab=ba
For 1D indCA:
Indicational normal form (inf):
inf([typeset structure typeset structure]) = inf([typeset structure])= [typeset structure])
inf([typeset structure]) = inf([typeset structure]) = [typeset structure)]
inf([typeset structure typeset structure]) !=  inf([typeset structure])
inf([typeset structure]) !=inf([typeset structure])

Enactional rule set for indicational cellular automata indCA <br />  R1 •   •   &# ...  O         -          -   O   -             -         •   -            -         •   -

<br /> Example <br /> indCA, r = {5, 6, 3, 8} <br /> Nr . l                      1             ...           x                           x                           x                           stop

7.2.  Mersenne CAs

2 ^3 - 1 = 7   :        {aaa, aab, aba, abb, bba, bab, baa}, with  ...        ]) . <br /> <br /> MersenneCA ^(3, 2) = (2 ^3 - 1) x P (2, 2) = 7 x 2 = 14.

Rules   for   Mersenne   CA ^(3, 2) R1 •   •   • R2 •   • ...          O         -                        -         O         -           -         O         -

Example  Nr . l                                                                                ...                                                                                              MERS

8.  Appendix

8.1.  Appendix 1: Headaches with complementary calculi

If two formal systems have a very close familiarity as a duality or even a complementarity, and are therefore to some degree nearly indistinguishable, but you nevertheless discovered in a strange situation of an insight a decisive difference between them. Then it might easily be possible, as in my case, that you get nightmares of endless oscillations and manifestations of something you don’t yet have access to, and what, as far as you guess, what it could be, you anyway wouldn’t like at all.

That’s what happens with the discovery of the complementary calculus of indication, a calculus I call a Mersenne calculus of differentiation and separation, in contrast to the Spencer-Brown calculus of indication and distinction. I have never been a friend of this calculus of The Laws of Form, therefore to get involved with its complementary calculus is no pleasure at all.

Obviously, to get rid of the headache with the CI and its ambitious and annoying celebrations, especially in German humanities, the best is to show, or even to prove, that there is a complementary calculus to the calculus of indication, too. And furthermore, both calculi are based on the general graphematic system, where they are located as the two only non-kenomic systems together with the graphematic system for semiotics as the sole pure identity system.

In fact, this is also a very late contribution to clear a situation that has not only produced unnecessary nightmares, I couldn’t avoid with my early papers, but also a late confirmation for the importance of Gotthard Gunther’s approach in this context that was demolished by the propaganda of the so-called Second-Order Cyberneticians, following Heinz von Foerster’s enthusiasm for self-referentiality, fixed points and the famous circulus creativus based on a non-existing chapter about the self-referentiality of reentry in George Spencer-Brown’s Laws of Form.

It turns out that the calculus of indication is the smallest possible calculus of the graphematic indicational system. Because Mersenne and Brownian calculi are conceived as complementary, this restriction holds for the original Mersenne calculus too.

With that, the sectarian propaganda for the CI boils down to a strictly one-sided and utterly restricted endeavour.

In-between I have written some papers dealing with the complementarity and applications of the concepts of the CI and the CD in the framework of a general graphematics.

There might be still too much undeliberated obfuscation involved, at least, some clear aspects of the new calculus of differentiation, CD, and its complementarity to the calculus of indication and distinction, positioned in the system of graphematics, are now elaborated as far as it takes to get a primary understanding of the new situation.

Specification
typeset structure

This study “Interplay of Elementary Graphematic Calculi” is a direct continuation of the previous paper “Graphematic System of Cellular Automata” which is studying 9 levels of graphematical inscription.

8.2.  Appendix 2: Logical interpretations

8.2.1.  Boolean algebra and CI

"Freilich sind die primäre Algebra und die Aussagenlogik nur bedingt isomorph (strukturgleich). Neben der ungewöhnlichen Verwendung des leeren Ausdrucks, der einer beliebigen Folge von adjunktiv zugefügten Konstanten für >>das Falsche<< entspricht und der >>topologisch invarianten Notation<<, die die Reihenfolge von Adjunktions- und Konjunktionsgliedern irrelevant macht, und damit die entsprechenden Kommutativ- und Assoziativgesetze im Rahmen der primären Algebra überflüssig werden läßt, besteht ein entscheidender Unterschied zu nahezu allen gängigen formalen Systemen in der anadischen Verwendung (das heißt Verwendung ohne Stellenzahl für die Argumente) des Operators typeset structure.
Während in der gewöhnlichen Aussagenlogik die Negation einstellig ist und eine Adjunktion als zweistellige Verknüpfung >>a<< und >>b<< zu >>a oder b<< verknüpft, hat der Operator
typeset structure typeset structurejede beliebige endliche Stellenzahl.” (Matzka, Varga, Motive und Grundgedanken der >>Gesetze der Form<<, 1993)

Recalling Varela:
CI: Calculus of Indication,
PC: Propositional Calculus,
Variables: A, B, ... ∈ CI, PC.
Procedure: Π.

Definition B.1
If A is ¬ B, write typeset structurefor A in CI;
If A is B
typeset structure C, write BC for A in CI;
If |- A in PC, write Π(A) =
typeset structurein CI;
If |- ¬A in PC, write Π(
typeset structure) = typeset structurein CI.

Lemma B.2
To every expression in PC there corresponds an indicational form.

Lemma B.3
Every demonstrable expression in PC is equivalent to the cross, typeset structure, in CI.
(Varela, Principles of Biological Autonomy, 1979, p.285)

DeMorgan

typeset structure = A
typeset structure = typeset structure corresponds to: ¬ (¬ A typeset structure¬ B) = A typeset structure B.

typeset structure

contra
"I want to conclued by emphazising once again, that the calculi of indication are not a subtle form of logic. They really intent something quite different ..." (Varela, 1979)

Nevertheless, there is a strong isomorphism between the CI and Boolean algebra (Kaehr, Schwartz).
Such a kind of isomorphism is not (easily) to establish between the CD and a Boolean algebra.

8.2.2.  Mersenne calculus and algebra

Definition   D .1 StyleBox[RowBox[{If A is ¬ B, ,,  , RowBox[{RowBox[{write,  , Cell[BoxDa ... , Cell[BoxData[A], MR], )}]}], =,  , RowBox[{Cell[BoxData[ ], MR], in,  , CD .}]}]}], MR]

Lemma D.2
To every expression in PC there corresponds a differential form.     

Lemma D.3
Every demonstrable expression in PC is equivalent to the mark, typeset structure, in CD.

DeMorgan complementarity ¬ A ≅  A ¬ A <==> ¬ B ≅    A B ( A  B) =  _ Mers A B . <br /> A <==> B    ≅     (A B)

Mersenne CD translates into a " bi - conditional " logical calculus . <br /> Exchang ... eled in the CD . <br /> A ∨ B ≅ A B : wrong A ∧ B ≅  ( A  B) = AB : wrong

<br /> Double   " negation " <br />    (    A)   =   A   : <br />     (     ) =  <br />  (    ∅) = ∅ .

<br /> Concatenation A B is a contra - valence : A B ≅ A !~= B   <br />  ( A  B) != AB   ... B) =  A B   =   A     B . <br /> A B =  A  B     (contravalence) . <br />

A                   B                    A                   B                   A  B          ...                                                    ∅                                 ∅

8.2.3.  Trichotomic interpretation

CD : Calculus of differentiation The differential domain of the Mersenne calculus is trichotom ... m ({tt, tf, ft}) = (1, 2, 3) = X non   (1, 2, 3 ) = (1, 3, 2) Mersenne : ord (X) = 1 < (2, 3),

 ord(val (Mers)) <br />         1 ↗ 2 <br /> ↕  ...                                                                           ↘ 3

FormBox[RowBox[{<br />, RowBox[{RowBox[{Cell[BoxData[negation   A          ¬ A ], MR], &nb ...                              1                                 3                                 3

Therefore :   = ∅ . <br />

CI : Calculus of indication Spencer - Brown : <br /> Brown = {tt, tf, ff} ord (X) = 1 < 2 & ... 2                       O          3          1 Therefore :  =  _ Brown   ⌀ .

In contrast: Logical complementary systems
Johannes Oetsch and Hans Tompits, Gentzen-type Refutation Systems for Three-Valued Logics
"In contrast to conventional proof calculi that axiomatise the valid sentences of a logic, refutation systems, or complementary calculi, are concerned with axiomatising the invalid sentences. Hence, the inference rules of such systems formalise the propagation of refutability instead of validity.
While the traditional method to show that a formula is not valid is exhaustive search for counter models, refutation systems establish invalidity by deduction and thus in a purely syntactic way.
In fact, already the forefather of modern logic, Aristotle, studied rules that allow to reject assertions based on already rejected ones."

publik.tuwien.ac.at/files/PubDat_187985.pdf

8.2.4.  Constellations

Combinatorial studies are determining the number and structure of indicational and differentiational constellations. Constellations are similar to logical functions for Boolean algebras and propositional logics.

The hidden dynamics of such constellations are becoming manifest and productive if the constellations are interpreted as rules of cellular automata or finite state machines.

The classical presentation of the Laws of Form, and its calculus of indication, are not giving any hint to dynamize the very structure of the calculus. Dynamics are studied inside the calculus on the base of so called second-order formulas and reentry functions based on speculations about recursion in the framework of the CI (Kauffman, Varela, et al).

The new turn, presented in previous papers, is changing the static constellations into dynamic CA rules. Of special interest is the functional change of morphograms into morphic CA rules. But the same mechanism works for indicational and differentiational calculi too.

Where are the constellations from? Constellations are automatically introduced with the use of variables for values and to build expressions by concatenation of terms. Therefore, the study of constellations instead of singular values (states) as results or cases of demonstrations (proofs) is well defined.

Following the classification of the valuation of constellations by Spencer-Brown, there are, as for propositional logic too, 3 different classes: truth, untruth, or contingency.

The first we learn from the constellations of the values typeset structure∈ CI is that the correspondence between the CI and Boolean logic, with a distribution of typeset structure for the CI and mtypeset structure, m=2, for Booleans, is not as close as it seems. Neither for the CD, with typeset structure.

Hence, the story of the isomorphism between the CI and Boolean algebra has to be reconsidered again.

Indicational case

CI : <br /> Brown : {, ⌀} ^2  _ ind  --> {, ⌀} : <br  ... ;  ((4 + 2 - 1)/4) = (5/4)    = 5,    for m = 2, n = m ^2 = 4.

 Reduction   quotient :   <br /> reduction ((Logic (m, n))/Overscript[Brown (m, n), _]) = (m & ... ;^(2  ^2))/(Overscript[(4 + 2 - 1)/4, _]) = 16/Overscript[5, _] = 3, 3 <br /> Null

CI standard    normal fom [op1]                             [op2]                    ...                       ⌀                 ⌀                          ⌀

Logical representation of indicational constellations
Following the example of G.Spencer-Brown, a CI-expression is representing a set of logical functions (Laws of Form, 1979, p. 115).
Hence, the CI-expression "typeset structure” represents 6 binary logical functions:
           AB,                  BA
          ¬ (¬ A typeset structure B),  ¬ (¬ B typeset structure A),
          ¬ (A typeset structure B),    ¬ (B typeset structure A).

But that’s not really the point. Because of the property of permutation-invariance of the basic elements, the constellations “op2” and “op3” are representing 4 different logical realization of the CI-expression. And the constellation “op4” is representing 5 logical functions. The constellations “op1” and “op5” are invariant. All together, the 5 CI-constellations are representing the full range of binary two-valued logical functions: 1+4+4+6+1 = 16.

This kind of modeling is not taking into account the commutativity of conjunction respectively disjunction as in GSB’s model but is focusing on the primary structure of indicational forms. The commutativity might be added secondarily as a property of the logical connectives.

Because the DeMorgan laws and even Nicod’s function or the Sheffer stroke are representable by the CI on the base of concatenation (in contrast to superposition), all the PC functions are representable too.

<br /> CI - normal form     --> logical representation <br /> [op2]     &nbs ...          ⌀ ⌀                                                                ⌀

[op1]        --> op1 =       op5 =                             &# ...                                       ⌀                                            ⌀

The listed constellations op1, op5, and op2 and op3, correspond to Kauffman's classification. The constellations op4 and op6 are not represented in Kauffman’s graphs.
The second graph entails all constellations build by “binary” applications only, i.e. typeset structure and typeset structure are not considered.

The Brownian algebra is a system of 5 basic patterns, op1 - op5, and a concatenation/superposition operation. The calculus of indication is abstracted from this algebra and reduced to an element-oriented calculus of distinction, with the operator and element typeset structure with its supplement ⌀, supported by the traditional concept of variables and equality, operated by concatenation on the base of linearized strings.

                 CI-Algebra = (Brown; op1, ..., op5, concatenation/superposition, typeset structure, typeset structure, =).

Classification of the constellations
op1: "truth”, tautology
op5: "untruth”, contradiction
op2-op4: "contingency".
The CI is still a calculus of the dichotomy of  "truth" and "untruth", with an emphasis on indicational "truth".

Consequences

Again, the relationship between CI-representations and CI-expressions has to be re-established.

[op1]: {op1, op5 }       ∈ CI-rep  ==> op1  =CI op5
[op2]: {op2.i, i=1, ..,5} ∈ CI-rep ==> op2.i =CI op2.j, ∀i, j=1, ...,5
[op3]: {op3.i, i=1, ..,4} ∈ CI-rep ==> op3.i =CI op3.j, ∀i, j=1, ...,4|
[op4]: {op4.i, i=1, ..,6} ∈ CI-rep ==> op4.i =CI op4.j, ∀i, j=1, ...,6

Kauffman’s graphs

[Graphics:HTMLFiles/Complementary Calculi_286.gif]

[Graphics:HTMLFiles/Complementary Calculi_287.gif]

The same again
typeset structure
(Michael Schneider)

Differentiational case

CD : <br /> Mersenne : {a, b} ^2  _ Mers  --> {a, b} : <br /> M  _ n = 2 ^n - 1, for n = 2 : 2 ^4 - 1 = 15.

Reduction   quotient :   <br /> reduction ((Logic (m, n))/Overscript[Mersenne (m, n), _]) = (  ... ript[2  ^4 - 1, _] = 16/Overscript[15, _] = 1, 06.  Mersenne standard normal form

       a    a    b      b &nb ...    8    9     10 11 12 13 14 15      <br />

[1]    --> op1 = taut op16 = contra      .  a                                  &# ...  a                                  ∅                          A      A          (A      A )

Here, there are just two constellations that are coinciding:"op1" as logical tautology,“taut", and as logical contradiction, “contra”. The concatenation is logically defined as a disjunction. The other constellations are accessible to a direct one-to-one logical interpretations.

Definition of logical functions by the interpretation of a set of Mersenne constellations.

A          B           A          B          A  B       ( A  B)       ...                                   op13                op10                op10                op10

<br /> Representation <br /> {op1 } => {op16}        &nb ... the set {op1,    op2, op7, op8}    all 16 logical operations are represented .

op2                     A op2             A op2                B op5                 op2       ...           op11                 op3                  op15                 op8                  op12

Because the necessary symmetry for the logical functions is not achievable with the Mersenne calculus, the corresponding generation of the PC functions out of a primary function on the base of concatenation, like Nicod or Sheffer, that is working for the CI, is not working for the CD.

Classification of the constellations
op1: "truth" = "untruth",
op2- op15: "contingency".
The CD is a calculus not so much of "truth" but of "contingency". Nevertheless it is still mainly focused on differentiational “truth".

Duality

op2 ≡ disj (A, B), op11 ≡ conj (A, B) : <br /> op2 dual B (A (op2)) <br /> op6 dual op8 :    A (op2) dual  B (op2)

Comparison of unary constellations

Mersenne combinations  A         A          A         A         A        A          A        A ...                                                                                           ∅

Contrast :   Boolean m appings Boolean (p) : {, ⌀ } ^2 --> {, ⌀ } : m ...                                                                    ⌀              ⌀

              Hom <br /> &nbs ... p;          X =  _ CD     X  <br />

Example for CD f =  f : contradiction f =  :      = ∅ f = ∅ :  ∅ =  .

<br /> Concatenation <br /> A =  A  =   A , <br /> reversion A =  A . <br /> Equivalence   for ... CD  X : CD - equivalence <br /> Constants <br />  = A =  A  = A, <br /> ∅ =  A = A  . <br />

Brownian combinations    A          A           A          A          A         A    ...                                                                  ⌀   ⌀   

Mappings Brown (p) : {, ⌀ } _ (/CI)^1  --> {, ⌀ } : ((n + m - 1)/n) : ((2 + 2 ...   : equivalence ; A =  _ CI A f =  :  = ⌀ f = ⌀ : ⌀ =  . <br />

Superposition A = A, <br /> inversion (A) = A . <br /> Constants  =  A =  A  =  A = A  =  A  .

<br /> Equivalence for the calculus    CI

perm (X)    iff    ∀ x  _ i ∈ X : val (perm (X)) = val ...  (X) <br /> Example : <br /> X ∈ perm (X) :    X    =  _ CI X .

<br />               Het <br  ... r />             X =  _ CI X <br />

The pattern-oriented approach is taking the fact of the permutative abstraction for the CI directly into account. Therefore the initials or axioms have to be adjusted with  “Het: typeset structure” to the new situation. (cf. Appendix 8.3.2)

This approach and result is obviously NOT in correspondence with the classical definition of the LoF.
It might be speculated that with this new understanding of the Laws of Form, the specific novelty of the CI is getting much more accessible than with the propagated classical approach.

The proposed CA-modeling of the behavior of the CI and the CD is adequately implemented with the rules of their cellular automata.

Complementary crossing

A          X    A          -->    A    A   A                                   A                                        A    A

8.2.5.  A further Stirling turn

As demonstrated in this paper, the differences between the calculus of indication and the calculus of differentiation becomes obvious with a complexity of just n=2 (and elements m=2). In the same sense logical basics like semantics are well defined. This is not anymore the case for Stirling calculi that are based on the trito-structure of graphematics. Here a complexity of at least n>=3 is necessary to demonstrate significant calculable differences between the Stirling constellations.

As it is obvious, the operators of distinctions and differentiations are very close to the combinatorial operations of permutation. The logical negation is clearly a permutation of logical values. Indication is changing the states of configurations from the marked to the unmarked and back. Differentiation has similar properties. This fact offers two different readings: an element- and a pattern-oriented understanding.

On the level of trito-structures, i.e. with the introduction of a Stirling calculus, the pattern property becomes dominant. Therefore, such trito-patterns are called morphograms, and their ‘elements’ kenograms. The position of a kenogram in a morphogram becomes crucial for the definition of Stirling patterns, i.e. Stirling morphograms. The identification of kenograms are depending on the position of the kenogram in a morphogrammatic pattern.

The operations of distinction and differentiation are generalized and applied as reflectors to morphograms. What played a relatively reduced role in the CI and the CD, concatenation and superposition, becomes a significant feature in the prominent roles as coalitions and cooperations, supported by other genuine morphogrammatic operations.

Like concatenations are “additions” and superpositions “multiplications” of strings, Stirling coalitions are replacing CI- and CD-concatenation, and Stirling cooperations are replacing CI- and CD-superpositions. Furthermore, the whole apparatus of deconstructed identity or equality relations has to be applied: equality, equivalence, similarity, bisimilarity and metamorphosis.

Superposition for the CI and the CD is not differentiated. It is realized by an unstructured monadic operator. In contrast, operators in Stirling systems are structured. A morphogram is not just an operand but an operator too. This fact is reflected by the structured coalitions and cooperations.

Because this figure of thought is definitively abandoning classical features dictated by identity thinking, the best exemplification, until now, is its interpretation in the framework of morphic cellular automata. A morphogram, then, is at once a pattern (morphé) and a rule (dynamis) of transclassical computation.

Despite the big ambitions declared by GSB with his calculus of indication as having surpassed the distinction of operator and operand, the manoeuvre works only for the highly trivial case of an unstructured operator, the cross. There is no chance, and obviously also no intention, to invent operators able of superposition of higher complexity, superpositions of structured distinctions. Obviously, something like “Q(P(X))" with Q and P defined as composed superposition terms is excluded from the world of forms. And certainly, such a case is not an example for a recursive form. The Laws of Form have a succession in the Laws of Formations (The Calculus of Idempositions, GSB, L. Kauffman, 1968) preserving the principal features of LoF.

What is possible for the CI is a highly restricted form of iteration as a superposition of the cross: From typeset structureiteration:
typeset structure  to composed formulas with iterations:   typeset structure (Wolfram rule).

An   example   of structured   superposition a b c <br /> ^(a b c)   <br /> ^a ... b c     = cross (cross  _ a b c  (cross  _ (a b c) (cross (a b c))) ) .

Superposition as indicational cooperation
What is the superposition of the expression a with the expression b in the CI? We know already the use of superposition with the operator typeset structure. Also it is claimed that the cross is an operator and an operator too, the cross is nevertheless a single and simple operator, applied on itself or on a expression consisting of crosses and variables.
But how could a complex operator be defined and applied for a more complex version of the CI? Concatenation might be generalized to addition (coalition) and superposition to multiplication (cooperation).

Concatenation - Coalition (1 ^1 2 ^1) +  _ CI (1 ^1 2  ... ;^2) : (0 ⌀) +  _ CI   (0 0 ⌀)   =  _ CI   (0 0 0 ⌀⌀)

Quite different approaches to complex dimensionality are given by William Bricken, Jeff James and L. Kauffman.  

"From a boundary perspective, the notation of both arithmetic and algebra is dimensionally impoverished; a one-dimensional string imposes structural and computational rules that are not essential to the inherently parallel structure of numerics.”
http://www.wbricken.com/pdfs/01bm/06number/bnums-complete/04bnums-sb.pdf

Given a = typeset structure, and b = (typeset structure ⌀), then a superposition like ab would have to be defiend as typeset structuretypeset structure.  But for a start it would be easier to define a superposition as a multiplication “a • b”. Hence, with (typeset structure ) •CI (typeset structure ⌀) under the conditions of a Calculus of Indication, the result is a unary set of constellations.

Definition a  _ b = a • b . <br /> <br /> a  _ 0 = a •    ...  = a •    (0 0)  a  _ (0 ⌀) = a •    (0 ⌀)

CI rules (0) •  _ CI (0) =  _ CI (⌀) : 0 = ⌀ . <br /> (0)  ... 2300;) •  _ CI (⌀)       =  _ CI (⌀)

Superposition - Cooperation + GSB (1 ^1) •  _ CI (1 ^1 2  ... 0 0 0 ⌀) =      (0 0 0 0 ⌀⌀⌀ ⌀ ⌀) .

By definition, indicational system (Brownian) are graphematically positioned between deutero- and trito-grammatic systems, and achored in identity systems (Leibniz). Their permutativity, (ab) = (ba) connects them to deutero-systems (Pascal) and the abstraction from the permutations to the trito-systems (Stirling). Because of the identity property of homogeneous constellations, (aa) != (bb), Brownian systems are additionally partly anchored in identity systems (Leibniz).

Considering the sketched approach, it is quite natural to generalize the base of the calculus of indication, and complementary, the base of the Mersenne calculus, to non-restricted calculi of arbitrary complexity. Therefore, a reduction to a two-element calculus is a restriction dictated not by formal but by philosophical or ideological reasons.

Is the emptiness empty at all?
The aim of GSB's Laws of Form is to give the most simple calculus of form out of the void. As shown, there is at least a complementary calculus of similar simplicity, the calculus of differentiation. Hence, the uniqueness of the CI simplicity is disturbed by its ”mirror” image.

May be, simplicity is not anymore what we are looking for.

The cultural belief into the metaphysical doctrine: “the emptiness is empty” and the “void is void”, etc., has become as shallow as Edinburgh’s famous Ghost House. Everybody who knows Loch Ness knows about the dynamics of emptiness, the Lochness of the Loch Ness.

8.2.6.  A new look on contradictions with reentry forms

An interesting consequence, still to study, is the application of the new situation to reentry forms.
Take 12.2: f = typeset structure, then the usual construction of a contradiction, as shown by Varela, becomes questionable, again.
With the application of the initial typeset structure = ⌀ to the formula "f = typeset structure”, we have, according to Varela’s construction:
f = typeset structure, then

  = typeset structure
  = typeset structure, with substitution
  = typeset structure
  = f , with substitution.
"But this leads to a contradiction, because substituting in (12.2) we have
  =  
typeset structure,    [⌀ = typeset structure]
which would render the calculus of indication inconsistent, and thus useless, by confusing every form
.” (Varela, p. 128).

This result is obviously based on the “element-oriented” approach that is excluding any pattern-oriented considerations.
A pattern-oriented understanding of the calculus would clearly deliver a different result. Following the sketched introduction to the pattern-oriented CI we would not get “⌀ = typeset structure”, which is obviously a contradiction based on an atomic constellation, but the pattern “⌀⌀ = typeset structure typeset structure”.

But the different approach is directly applicable to Varela’s start formula "f = typeset structure“.
For f = p we get val(p) = (typeset structure, ⌀) and val(typeset structure) = (⌀, typeset structure) and applying Het, we get p =typeset structuretypeset structure, and therefore, by substitution, f = typeset structure, which holds in the pattern interpretation of the CI as an equivalence relation. With that, the Brownian emphasis on the difference between the CI and negational logic gets some further justification.

With that, the still identity-logic inspired construction Varela’s is losing all its resonability.
It is also an open question if this direct modeling of the reentry form corresponds to the Brownian approach. To my knowledge, reentry occurs in the CI only in context with a form defined by other constituents, i.e. variables, and not in isolation.

A more profound analysis of the situation, considering polycontexturality, is given by Elena Esposito in Ein zweiwertiger nicht-selbständiger Kalkül:

"Wollte man dies formalisieren, müßte man auf einen Kalkül von Wiedereintritten rekurrieren, das heißt auf einen Kalkül von Beziehungen nicht mehr zwischen Bezeichnungen, sondern zwischen Beobachtungsordnungen. Das jedoch ist nicht mehr die Aufgabe des Indikationenkalküls.” Elena Esposito, Ein zweiwertiger nicht-selbständiger Kalkül, in: Kalkül der Form, (Dirk Baecker, hrsg.), suhrkamp taschenbuch, Frankfurt/M. 1993, p.96-111.

8.2.7.  Reflector analysis

Apart of a logical interpretation of CI-constellations, there is a reflector-oriented analysis of direct interest. The merits of a reflector-approach becomes evident in a polycontextural framework of complexions of CIs (Kaehr, 1981). The reflector-analysis was successfully applied for the study of the behavior of composed morphograms in morphogrammatics.

The calculus of indication intents to strip down the logical “corset” of variables and functions down to the structural bones of its mechanism. Therefore, a reflectional analysis is achieving more directly the attempts of a skeleton-analysis than the common approaches of logical comparisons. A sketch of a reflector-analysis is given for Brown, Mersenne, Stirling and Deutero-structures.

Reflector analysis for CI

refl (op  _ i) = op  _ i, for i = 1, 4, 5        ... > refl (refl (op  _ i)) =    op  _ i, i = 1, ..., 5 : self - reflective

Reflector analysis for CD

refl(1) = (1)           refl(4) = (7)
refl(2) = (12)         refl(5) = (15)
refl(3) = (11)         refl(6) = (9).
(1)                        : self-reflective
(i), i = 2,...,15       : reflective

Reflector analysis for Stirling

typeset structure

refl(1) = (1), refl(5) = 5, refl(6) = (6), refl(7) = (7) : self-reflective
refl(2) = (8) : reflective,
refl(3) = (4) : reflective.

Reflector analysis of deutero-structures

typeset structure

refl(i) = (i), i = 1, 2, 3.

This short analysis of different reflector-systems makes the position of Mersenne and Brownian calculi inside the graphematic system more clear.

                &nb ... bsp;           Leibniz     <br />

8.3.  Appendix 3: A second look at the calculi

8.3.1.  Pattern oriented CI and CD
Conflicts with the primary intentions

Calculi shall be developed that are dealing not just with atomic elements (states) but with patterns of behaviors, as far as this is possible within the framework of calculi like the CI and the CD.

With the introduction of the CI- and the CD-equivalence relation over CI-expressions e and CD-expressions d the connection between the intentions of the calculi CI and CD as founded in their graphematical systems is re-established.
It seems, that there is a discrepancy in the formalization of the calculus of indication and its intention. This intention seems to be properly represented by the graphematics of the CI-intention.
Similar holds for the formalization of the calculus of differentiation CD.
The gap in the formalizations is produced by the mapping of expressions of sets of atomic “states” to sets of atomic “states”, in the CI the states Cross and NoCross, i.e. from {typeset structure, typeset structure} to { typeset structure, typeset structure} and in the CD from {typeset structure, typeset structure} to the “states" {typeset structure, typeset structure}.
Hence, the use of a functional representation, i.e. F:{x, y}n --> {x, y}, without an abstraction from the permutation of states for the CI, i.e. Ftypeset structure, and the abstraction from the equality of homogeneous states for the CD, i.e. CDtypeset structure, seems to mislead the intentions of the interventions. The transition from the “primary arithmetic” to the “primary algebra” with its use of variables is based on the assumption of the correctness of the step-wise atomic “substitution”, e.g. “Let p = typeset structure. Then”.  This shows the unresolved complicity with “identity” assumptions, well in contrast with the claims of the Laws of Form.

Albeit differently motivated, and not touching the fundaments of the CI formalization at all, a similarity to the above remarks could be constructed with Varela’s reflection axiom “a = typeset structure” (12.27) and “p(typeset structure) = a” for his “generalized Brownian algebra” of “periodic sequences” and “wave forms"(Varela, p. 150/51). But Varela’s “transposition algebra” of “wave forms” is not considered as a proper Brownian calculus for forms.

The aim of pattern-oriented formalization is defined by the attempt to take directly into account the graphematic structure of the CI and CD calculi as it appears within its tree and graph productions.

The fact that the expressions e1= (aaba) and e2= (aaab) of the primary algebra are indicationally equivalent is not properly represented by the ordinary formalization(s) of the Laws of Form.

The same holds for the CD. The fact that the expressions d1= (aaaa) and d2= (bbbb) are differentially equivalent is not properly represented by the proposed formalization of the Laws of Differentiation. (cf. Appendix 8.2.4)

CI:
e1= (abaa)∈graph with the interpretation (typeset structuretypeset structuretypeset structuretypeset structure) and typeset structure= (aaab)∈graph with the interpretation (typeset structuretypeset structuretypeset structuretypeset structure) results in the conflictive equation: e1 !=  typeset structure.
From the point of view of the graph-generation for the CI, both patterns, etypeset structureand e2, are CI-equal.
Hence, the pattern related fact of permutative equality has to be considered: X =CI perm(X).

CD:
d1= (aaaa)∈tree with the interpretation (typeset structuretypeset structuretypeset structuretypeset structure) and d2= (bbbb)∈tree with the interpretation (∅∅∅∅) results in the conflictive equation: d1 != typeset structure.
From the point of view of the tree-generation for the CD, both patterns, d1and d2, are CD-equal, d1 =CD typeset structure typeset structure.
Hence, the pattern related fact of homogeneous equality has to be considered: X =CD hom(X).

8.3.2.  Definition of a calculus of indication

A different “calculus taken out of the calculus".

Following the standard definitions of a calculus, the simple tectonics of alphabet, syntax and interpretation, “semantics”, proof theory has to be introduced.

Calculus of Indication
Alphabet
constants = {typeset structure, ⌀}
variables = {p, q, r, ...}

Syntax
concatenation of the constants {typeset structure, ⌀} and superposition of {typeset structure}.
R0.1: ==> typeset structure
R0.2: ==> ⌀
R1.1 n ==> n typeset structure
R1.2 n ==> typeset structure
R1.3 n ==> n ⌀

Concatenation and superposition of variables
R3.1: p ==> typeset structure
R3.2: p, q ==> p q

With the rules R1 - R3 a production of strings based on the alphabet is defined.
All the CI-strings produced are accepted as CI-expressions.

Example
e = ppqtypeset structure typeset structure q ⌀ typeset structurer ⌀ typeset structure typeset structure.

Hence, any expression build on the base of CI-constants and CI-variables with the operators of concatenation and superposition of the constant typeset structure is a CI-expression.

Semantics, i.e. indicational rules
J1: typeset structure typeset structuretypeset structure
J2: typeset structure ⇔ ⌀

I1: typeset structure ⇔ ⌀
I2: typeset structure

Valuation
V1: The valuation of variables, ptypeset structure, ..., pn is defined by the mapping val(CI): {typeset structure, ⌀}n --> {typeset structure, ⌀}.

Wording for the valuation of variables:
“Let p = typeset structure. Then ..."
"Let p = ⌀. Then..."
This defines a valuation table, like for the semantics of propositional logic but without a semantic-ontological commitment.

P: Rules for proofs, based on substitution and equality.

With this setting, and its further elaboration, the crucial situations of the CI as they are determined by the graphematic graph-structure of the indicational events are not approached at all.

Therefore, the semantic mapping for the variables has to be specified according to the “pattern"-structure of the indicational graph. With that, the algebraic rules are not just depending on the atomic values (constants) but on the structure of the valuation too. There are just two classes of patterns: homogenous and heterogenous to consider at first.

Homogeneus patterns are treated like atomic constants, i.e. X ∈ Hom ==> X != typeset structure.
Heterogeneous patterns are permutation-invariant, therefore: X ∈ Het ==> X = typeset structure.

Therefore, according to the proposed conception of indication, the calculus of indication has to be specified by the meta-theoretic distinction of homogenous and heterogeneous valuations of its variables, i.e. X ∈ Hom or X ∈ Het.

Heterogenuos patterns are classified according the number of their elements.
The number of all patterns for an indicational graph are given by the combinatirial formula:

val (CI) : {, ⌀} _ (/Ind)^n --> {, ⌀} with    Ind  _ (n, m) = ((n + m - 1)/n)

Because there are only two homogeneous constellation in an indicational graph for m = 2, the number of heterogenous situations is:

Het (CI) = Ind  _ (n, m) - 2. <br />

Classification Het - Hom

1. X ∈ Het    iff val (perm (X)) ∈ CI : (X ∈ Het ==> X = ༺ ...  ==>     X !=  _ CI X <br /> 3. ∀ X : X ∈ CI ==> X = X .

<br /> Short : <br /> val (X) = val (perm (X)) ==> X =  _ CI  X, <br /> val (X) = v ...  =  _ CI  perm (X), <br /> val (X) != val (perm (X)) ==> X !=  _ CI  perm (X) .

<br /> Example <br />               ... Het (p) <br /> p = 2.3 : p = ⌀ ⌀    ==>    p != p : Hom (p) .

Consequences for morphCI The classical CI - Axiom J1, Position :    p p = ⌀ , gets a reformulation in a morphic CI, morpCI, as :

   morphCI - Position <br /> <br />    p ∈ morphCI : p p = p     <br />   

Explanation  ( /⌀) ( /⌀)    =    (⌀ /) ( /⌀) =  ( /⌀) = (⌀ /) = p , hence with p =  _ CI p : <br /> p p = p . <br />

CI - equalities for two variables <br /> 2. p q = p    q = p    q = p &nbs ... nequalities <br /> 1.    !=   , <br /> 5.    p q !=    p q !=    p .

8.3.3.  Definition of a calculus of differentiation

Recalling the usual machinery for calculi, propositional logics and the sketch of a definition of the calculus of indication, the procedure to establish a calculus of differentiation follows the same strategies.

Here, this manoeuvre shall be reduced to the essentials. And that is the pattern aspect of the homogeneous constellations of “valuations".

Classification Het - Hom 1. X ∈ Het    iff val (perm (X)) ∈ CD : (X W ... _ CD X    <br />      . <br />       

     Example <br />         <br />  &nb ... p;     ∅         <br />   

<br /> p = 2.1 : p =      ==>     p = p : Hom (p) <br /> p = 2.2 : p =  ...  != p : Het (p) <br /> p = 2.3 : p = ∅     ==>     p != p : Het (p) .

Consequences for morphCD The classical CD - Axiom N1, Position : p    p =  , gets a reformulation in a morphic CD as :

   morphCD - Position <br /> <br />    p ∈ morphCD : p    p = p     <br />   

Explanation morphCI :    ( /⌀) ( /⌀)    =    ( ... sp;  hence with    Annulation     p p =  p : p    p = p .

8.4.  Appendix 4: Mersenne analysis of Brownian de/inscriptions

Second-order formulas have different motivations in Spencer-Brown's Laws of Form. A new turn is achieved with the introduction of the complementary Mersenne calculus. The CI is studying distinction in or of a world, while the CD is studying the differentiations of inscriptions of calculi in a graphematic (scriptural) space. Hence, a new second-order type of analysis is opened up: the differentiational study of distinctional inscriptions, i.e. the CD-study of CI-notations.

X ∈ CI => XX = X ∈ CI . => . XX = ∅ ∈ CD

This is similar to GSB’s the study of Russell/Whitehead’s logic with the means of his CI. This analysis of logic by the CI offers a specific reduction of the logical material: “this represents a reduction of the mathematical noise-level by a factor of more than 40000” (LoF, 1972, p. 117)

Hence, a minimal graphematic comparistics of formal languages is in place: logic, distinctional and differentional calculi.

A self-application of CI formulae are a reentry of the form into the form.
A CD self-application is analyzing the form of the CI.

8.5.  Memristivity in CI and CD

The interesting feature of memristivity that has been discovered for morphogrammatics in general, gets its special realization in the calculi of Spencer-Brown and Mersenne too. Both are founded in graphematic systems and have partially morphogrammatic properties.

Memristivity is closely related to the fact that a repetition of a term in a morphogrammatic system has to decide as what kind of a representation of the term the term has to be repeated. This question is obsolete for identity systems, like semiotics. It occurs at first on a low level with the CI and the CD. According to the relevant abstractions, a term in a CI constellation is involved into its permutations. Thus the choice of a representation is defined by the range of the number of permutations of the elements of the term.

Following the idea of complexity reduction of graphematic systems in respect to semiotic sign systems, the measure of reduction, the reduction quotient, is in fact representing the degree of memristivity of a system. As it is clear, semiotic systems are of zero memristivity, i.e. measured as typeset structure - 1= 0.

Example: Logic/Indication

typeset structure

This approach gets a more precise elaboration with the combinatorial formulas of the specific representations of morphogrammatic situations in semiotic realizations.

8.6.  Appendix 5: Quadralectics of distinction and differentiation

As we learned from the papers “Diamond calculus” and “Quadralectics”, there is a precise architecture and mechanism of 4-fold disseminations of calculi, esp. the calculus of indication. What wasn't established in the previous papers was an exact specification of the laws of a “complementary” calculus of indication, i.e. the Mersenne calculus. Dual-forms to existing calculi had been well defined but not elaborated.

With the approach to Mersenne calculi the promise for a complementary calculus is fulfilled and the gap is finally closed.

Quadralectics of CI and CD

  Quadraletictypeset structure (CI, CD, CID, CDD)  =  typeset structure      


        typeset structuretypeset structure

<br />         Duality <br /> <br />     &nb ... p;                

Complementary and inverse forms
Because of the principle of "perfect continence”, there are no dual forms in a logical sense in the calculi of forms. What is reflecting the formation of forms are parallax and complementary, i.e. diamond formations of form. This is mirrored firstly, by the systems of inverse forms. Hence, the basic, and not yet disseminated planar forms, are the forms of complementarity and inversion (here: duality).

Complementary calculi are based on complementary graphematic systems. Therefore, there is no mechanism given by a calculus to define its complementary calculus by the means of the calculus. Dual systems remain in their graphematic framework, i.e. the dual of a calculus is defined by the means of the calculus itself. Hence, the graphematics of the CI is complementary to the graphematics of the CD, while the graphematics of the dual systems are unchanged.

Distinctions between distinction systems
Beyond the systematics of planar distinctions, a polycontextural theory and calculus of distinctions, is demanding for distinctions between discontextural distinction systems. This might be realized by the introduction of topological and knot-theoretic constellations of distinction systems. A simple start could be a 3-dimensional distinction system with the set of planar distinctions and reentries at each contextural position and the transcontextural distinctions and reentry forms between distributed contextural distinction systems.

An interesting interplay between the calculi of distinction and differentiation might be introduced as a chiasm between the calculi and their gaps. In this sense, a gap of a calculus is the placeholder for its neighbor calculus.

CI = (dist, gap) CD = (diff, gap) chi (CI, CD) = (dist, diff, gap  _ diff, gap  _ dist) .

8.7.  Appendix 6: Complementarity: A case for Diamond Theory

One of the main terms used in this presentation of a complementarity between the Spencer-Brown calculus of indication and the Mersenne calculus of differentiation is the term “complementarity” itself.
As shown in other papers, the most fundamental and most direct approach to define the term “complementarity” is, as far as I know, accessible by the theory of diamond category. Diamond category is defined as an interplay of categories and saltatories. Such an interplay defines the complementarity of categories and saltatories in diamonds.

One crucial motivation to use diamond categorical constructions is the fact that the “concatenation” of marks in the CI  is not defined by properties of the calculus but based on cultural intuition. This lack of definition is fixed with the strategy of the matching conditions for morphisms.  

Complementarity = diamond (Brown, Mersenne).

diamond (Mersenne ∐ Brown) = Mersenne || Brown

     Complementarity of CI and CD    <br /> <br />   & ... bsp;  ≡ Brown             <br />

<br />           Diamond of Brown and Mersenne    ... p; ≡ : coincidence <br />       ≅ : similarity <br />  <br />

Semiotics in this chiastic diamond diagram is reflecting the ‘common’ and acceptional features of Brown and Mersenne, while complementarity is the place where the rejectional difference between both are kept together.
Given this chiastic diamond modeling, iterative and accretive combinations to build networks, grids or meshes out of it are following naturally.

9.  Index of Forms and Differentiations

<br />         Bracket   gramma r <br />     ... nbsp;       )         <br />

FormBox[RowBox[{              ... }}]}]}], BoxMargins -> {{0.2, 0.2}, {0.4, 0.4}}], TextForm],     }], TextForm]


typeset structure

         Numeric    i   ndicational     ...  {2 ^n 1 ^n 2 ^1}     <br />      

 CI - Meta                                                                                     ...                                      Classification <br /> of constellations <br /> as Hom and Het

CI - Theorems                                                                                  ... sp;  p     q  s     p    r                          O

    <br />    f = f ∉ CI <br /> f =  :     =   =  ... ; a    b    a    b <br />     f = f a    b

<br /> Mersenne Mappings <br /> Mersenne (p) : {, ⌀ } _ (/CD)^2  --> {, ⌀ } : ...                                                                                            ∅

               &nbs ... p;          X =  _ CD     X  <br />

Concatenation A =  A  =   A , <br /> reversion A =  A . <br /> Equivalence   for   the   calcu ... bsp; X =  _ CD  X : CD - equivalence Constants  = A =  A  = A, <br /> ∅ =  A = A  .

<br /> Brownian      Mappings <br /> Brown (p) : {, ⌀ } _ (/CI)^2  --> {,  ...                                                                                ⌀   ⌀

<br />               Het <br  ... r />             X =  _ CI X <br />

Contrast :   Boolean mappings Boolean (p) : {, ⌀ } ^2 --> {, ⌀ } : m  ...                                                                       ∅             ∅

Classification Het - Hom    for CI 1. X ∈ Het    iff val (perm (X))  ... p;     <br /> X ∈ Hom  ==>     X !=  _ CI X <br />

CI - equalities for two variables <br /> 2. p q = p    q = p    q = p &nbs ... nequalities <br /> 1.    !=   , <br /> 5.    p q !=    p q !=    p .

Classification Het - Hom for CD 1. X ∈ Het    iff val (perm (X)) ∈ CD :  ... nbsp;       X =  _ CD X    <br />     

     BIFUNCTORIALITY OF    MERSENNE ,   BROWN   and   SEMIOTICS <br /> <br ...                                                                                                Sem

          Quadralectics <br />      ...  r    p r      =     r    q     p

                    ... bsp;  ≡ : coincidence <br />       ≅ : similarity <br />

Structured versus unstructured superpositions  Unstructured   0 0 0 ,      ... a b c     = cross (cross  _ a b c  (cross  _ (a b c) (cross (a b c))) .