Combinatory Logic and the Laws of Form

The calculus of indication as a special combinatory logical system

Rudolf Kaehr Dr.phil@

Copyright ThinkArt Lab ISSN 2041-4358

 

Abstract

A comparatistics of calculi, formal systems or algorithmic languages should compare the different approaches involved and highlight common and different features. This is well done with the studies of combinatory logic, lambda calculus, category theory and logic. There is yet no similar comparatistics study concerning more deviant systems like the calculus of indication of the Laws of Form (G. Spencer-Brown). This sketch takes a first step to analyze the Laws of Form (FoL) in the context of Combinatory Logic (CL). A first result of a translation of the LoF into the framework of the CL shows the definability of the LoF initial Order by the initials Number and Transposition only. (Work in progress, v. 0.3)

1.  Comparatistics

1.1.  Combinatory Logic and the Laws of Form

1.1.1.  Questions of comparing the LoF with other calculi

"Jeff James (1993) has developed a system, inspired by Spencer-Brown's work, which does arithmetic using a topological notation with only two kinds of boundary. These may be represented textually as brackets () and [], with the interpretation of the empty expression as zero, () as one, ()() as two etc., addition is simple juxtaposition ab and multiplication is ([a][b]) and so on. If () is understood as an exponential function and [] as a logarithmic function, it all suddenly makes sense, however the arithmetic is actually performed using only four simple axioms: ([a]) = a, [(a)] = a, []a = [], ([a][b])x = ([ax][bx]).

I mention this because I can't help feeling that it is somehow related to the lambda calculus and combinators but I don't see how.”

David C Keenan
http://dkeenan.com/Lambda/

Due to the lively feedback I got for my last papers about graphematics and the Laws of Form I feel motivated to continue some further analysis of the intriguing features of both approaches to formalization.

Instead of involving the CI into a complementary context, like the newly introduced calculus of differentiation, another strategy to get rid of the indicational nightmare is recommended: show its similarity or even isomorphy, and differences too, to other much more familiar calculi.

It is sketched without much comments that the CI has some isomorphic neighbors like Combinatory Logic, CL, Category Theory, CAT, Boundary Arithmetic, BA, all together more abstractly conceived than Propositional Calculi, PC, and therefore, probably less well known.

Each approach represents a different thematization of the conception of calculi and computability with its own special properties, despite of some kinds of abstract resemblance or even isomorphism.

Epistemologically and from a meta-theoretic point of view there are significant similarities between the CI and the CL to detect. In comparison with propositional logic, those CL similarities are much closer to the intentions of the CI. Both are emphasizing a kind of an independence from the strict operator/operand-dichotomy. Combinators in CL are playing both role, operator and operand. In a similar sense, the Laws of Form are insisting on the double-function of the cross, being operator and operand at once.

The main difference between the CI and the CL seems to be the CI-abstraction from the commutativity, i.e. the special topology-invariance, of its terms as an underlying presumption of the CI, while the CL is strictly build on the identity of its terms.

Further questions arises: If there is a complementary calculus to the calculus of indication, what is the complementary calculus to the Combinatory Calculus?

Again, this is just a preliminary sketch, and further elaborations are left to the enthusiastic reader.

It is well known and often played as a sophisticated sport that it is worth to try to reduce the number of axioms of the original axiom systems and to proof its completeness despite the loss of an axiom of the axiom system as it was presented originally by its inventor.

This holds prominently for the CL, where it is now common praxis to not to use the identity axiom, I x = x, because of its derivabiltity from the other axioms, i.e. combinators, like K and S.

A similar reduction might happen with CI’s Primary Arithmetic axiom of Order, typeset structure.

Identity seems to be trivial for the CL because the whole concept of formalization of the CL  holds in the framwork of identity. Non-identical systems are covered by the scriptures of the graphematic system, and a formalization then demands identity rules on different levels.

Some questions
Is it possible to define in CI the Initial arithmetic Order, I2, with the Initial arithmetic Number, I1, and the algebraic Transposition, J2, only?
As a consequence: Is it possible to define the CI axioms with number, I1 and distribution (transposition) J2 only?
Position, J1, appears then as a specified Order, I2.

Strategy
Initials in the CI are considered by GSB as imperatives and not as axiomatic relational statements. Hence, the initials can be abstractly understood as operators. Therefore, the name of the imperative indicates an abstraction from the arrangement of the imperative and deserves an operator, i.e. a combinator in the sense of Combinatory Logic.

Combinatory Logic, CL, studies the process of substitutions. For the CI, substitutions are not reflected but considered as not specially problematic. Therefore, substitutions are used to connect the primary algebra with the primary arithmetic in the CI.

With the proposed translation or modeling of the Laws of Form to a system of Combinatory Logic, all the techniques and tools, like programming environments and meta-theoretical analysis, should then be available for further studies of the Brownian universe of distinctive arrangements.

Recalling some conventions about operators and operands in generall

"An expression may occur in three positions as a component of a larger expression:
1. in the
operator position,
2. in the
operand position,
3. as the
body of another lambda expression.
The lambda expression is the second basic method of assembling a new expression.
In their most austere form the expression under consideration may be characterized as
follows.

An expression is
           either simple and is an identifier
           or a lambda expression
               and has a bound variable which is an identifier
               and a body which is an expression,
           or it is composite
               and has an operator and an operand, both of which are expressions.

A rule is needed for recognizing when the body of a lambda expression ends. The rule
is that the body extends as far as it can until it is terminated by a closing bracket, com-
ma, or the end of the whole expression. It follows that parenthesis are only needed to
enclose the body if it is a list although they may be used if this improves readability."

W.H. Burge, Recursive Programming Techniques, 1975, p. 9
http://www.thinkartlab.com/pkl/lola/poly-Lambda_Calculus.pdf

1.1.2.  Operational notation of CI-expressions

Also there is much emphasis on the neutrality of the cross as being both an operator and an operand, an operational notation makes it clear that a permutation of an operator with an operand is producing a strictly different expression, which even might turn out to be a non-expression in the CI. Hence, the distinction of operator and operand is nevertheless crucial for the CI too.

Example
Take, typeset structure !=CI (typeset structure.
"typeset structure" ∈ CI as typeset structure, while "(typeset structure” has no proper representation in the CI.
By definition, the expression, typeset structure or typeset structuretypeset structure, gets a representation in an operational approach of the CI as:  
                typeset structure.

Transcription:
typeset structure

Definitions

1. Primary operational arithmetic Superposition : (SUP), sup (x (y)) = y ^(x ) ... /> Concatenation :    (CON), con (x, y, z) = (xyz) con ( ( 0 ) ( 0 ) ( 0 )) = ( 0 0 0 )

Distributivity of concatenation (+) and superposition (•) : <br /> distr (x, y, z) = (x  ... ; z = (x • z) + (y • z)  ( 0 0 ) ( 0 ) = ( 0 (0 )) ( 0 (0 )) = 0 0 0 0    .

2. Primary operational algebra (SUP) , sup (x (y)) = y ^(x ) . <br /> sup (0 ( ... (a) (0 (a)) = a ( a) = 0 a a , <br /> 0 (a) (0 (a) (0 (a))) = a ( a ( a) ) =    a a a .

Concatenation :    (CON), con (x, y, z) = (xyz) con (a ,  a , a) = ( a a a) con (p,  ... a)) ((0 (a)) ( 0 (a)) : <br /> (a     a ) a = (a (a )) (a (a)) = a a    a a .

The algebraic structure of the operational LoF scripture
The syntactic rules of the LoF scriptures are not the rules of the calculus “out of the syntax”. The LoF-scripture is constructed by the unary superposition operation (•) and the binary concatenation operation (+) over the base B = {typeset structure, ⌀}.
Definition
Cooperation  (•):      typeset structureb =  a • b .
Superposition (•):   typeset structure typeset structure • (a) = typeset structure (a) =  typeset structure .
Coalition       (+):   a + b = (a b) : Concatenation

LoF - script  LoF - syntax = (lof, {0, ⌀}, (+), (•), =) with concatenation : (+)  ... sp;        (x + y) • z = (x • z) + (y • z) .

LoF calculus <br /> Primary arithmetic <br /> reflexivity :      &nbs ...   • ( 0 + 0 ) =    (0    • 0 ) + ( 0    • 0 )

Primary algebra absorption :             ... ;                

Rules for substitution and equality (=) .    

1.1.3.  LoF as algebras

Further elaborations
There are other approaches to the study of the algebraic properties of the LoF that are more close to 2-element Boolean algebras. (Further elaborations are left to the reader.)

“In a more conventional notation an equational axiomatization can be written based on the reduction rules above:
                (ab)c = a(bc),
                a1 = a,
                ab = ba,
                (a'a)' = 1
                ((ac)'(bc)')' = (a'b')'c
This yields an equational algebra equivalent to a Boolean Algebra.” (Mark Hopkins, 1996)
http://groups.google.com/group/sci.math.research

B. Banaschewski, On G. Spencer Brown’s Laws of Form (1977)
http://projecteuclid.org/DPubS/Repository/1.0/

Philip Meguire, Boundary Algebra: A Simple Notation for Boolean Algebra and the Truth Functors (2007)
http://www.lawsofform.org/docs/Meguire_LoF.pdf

1.1.4.  Generalizing approaches

Idemposition
A(AB) = (AB)

"This calculus is based on the principle of idemposition saying that: superposition of segments of the same color results in the cancellation of those segments" (Kauffman, 2005, Map Reformulation)

typeset structure

"The Calculus of Idempositions is a Diagrammatic Language involving Closed Curves.” (GSB)
The new property of “The calculus of Idempotence” is: “Common Boundaries Cancel”.

Bifunctoriality
Another unifying approach for the Laws of Form was introduced as a bifunctorial interplay between the operations of concatenation and superposition: typeset structure

 Interchangeability arithmetics   <br />    <br />     [( 0   ...       /( 0  (o 0 ) <br /> ⊗)/o 0 ))  <br />

How are number and order related in a bifunctoral approach?
The law of functorial interchangeability for the CI has to be set, it can't be deduced from the original mono-contextural Laws of Form. Interchangeability is introducing a new kind of abstraction beyond the isolated forms for number and order.

There is a reason to apply bifunctoriality to the CI because it contains two operators which are similar to yuxtaposition and composition, i.e. to serial and parallel application.
http://www.thinkartlab.com/pkl/media/Diamond%20Calculus/Diamond%20Calculus.html

1.1.5.  Translation from CI to CL

1. Identity and order
CL identity: I
(x) = x:
                    I2:    Order:  typeset structure,   typeset structure,  typeset structure.

The initial I2 might therefore be considered as an operator (imperative), combinator or the name of an operator, hence as the mapping I2: typeset structure --> ⌀ with I2 as its operator. From a combinatory logical point of view such a functional operator of a morphism might be abstracted from its special realization, and set as an operator in the sense of a combinator. Hence, the mapping I2: typeset structure --> ⌀ becomes the base of the CI-operator I2.

This interpretation of the Initials as operators instead of relations is supported explicitly by GSB himself with his wordings of commands and by his followers too.

I2: typeset structure --> ⌀ :

typeset structure  --> typeset structure ; typeset structure  <--typeset structure : ⌀.

The double cross gets a notational definition as a superposition in a linearly written form:
typeset structure (typeset structure) = typeset structure. Thus, the brackets are indicating the superposition and are hindering to read the term as a concatenation: typeset structure typeset structure.

In fact it is I2: typeset structure --> ⌀: I(⌀) = ⌀.

A more intuitive version of the Identity Initial is given by the general mapping I(a), i.e. I2:  typeset structure --> a, which also reads as: I(a): a --> typeset structure .

Therefore, the operational formulation of the identity initial, i.e. the Initial Order I2, reads as  I2(x) = x.

   Identity <br />    <br />    I2 (x) =  _ CI x     <br />

2. Constancy and number
CL-constancy: K
(xy) = x:        
                        Number:      typeset structure typeset structure  ⇔ typeset structure :  I1
                                            typeset structure typeset structure --> typeset structure,
                                            typeset structure  --> typeset structuretypeset structure.

                                    C3:   typeset structure typeset structure --> typeset structure , trivially: y = typeset structure, y = ⌀  => typeset structure typeset structure --> typeset structure .
                                    C"3:  typeset structure -->  typeset structure typeset structure
C3 (x y) = x

    Constancy         <br />    I1 (x y) = & ...    I1 ( 0    y) =  _ CI 0     <br />    

Examples
(typeset structure typeset structure) =CI (y typeset structure ) =CI typeset structure, but

I1 (typeset structure typeset structure) !=CI I1 (y typeset structure):

I1 (typeset structure typeset structure) =CI typeset structure
I1 (y typeset structure) = typeset structure= typeset structure: #

This correspondence with its conditions included, seems to be quite natural compaired to the identity function. The correspondence with the distributivity in CL follows without much interpretation.

3. Substitution and transposition

For   CL : <br /> Distributivity of substitution  S :    (S x y z ) =   (x z (y z)) .

For CI Transposition J2 :  p     q    r =     p r  &nb ... nbsp;   q    r =>      p r     q r .    Null

     Substitution <br />     <br />      J2 (x y z) =  _ CI (x z (y z))     <br />

4. Principle of topological invariance

"Combinatory algebras (except the trivial one) are never commutative, never associative, never finite, and never recursive.” (Barendregt)
http://mathgate.info/cebrown/notes/barendregt.php#7

Even if the translation of the CI-initials to CL-axioms is working, there is still no guarantee that the calculus as such is working at all. The reason is simple. There are crucial abstractions necessary to run the CI that are not manifestly implemented in the CI. Too much depends on intuition and informal instructions. One of the most crucial intuition of the CI is the “topology invariance” (Matzka/Varga) of its terms. This becomes clear if the graphematic base of the CI is considered and accepted.

"Remark. Note that in working with the primary algebra, we take it for granted that elements of the algebra commute:
                                                    A B = B A
for any algebraic expressions A and B. Certainly, we can observe that this is indeed an identity about the primary arithmetic. It is just that we use this identity so frequently, that it is useful to take it as a given and not have to mention its use.” (Kauffman)

A dominant precondition of the definition of the CI is its topological invariance, i.e. commutativity in respect of the positions of its terms in an arrangement. This is in strict contrast to the basic non-commutativity of terms in the CL. For the CI, commutativity of terms is an undefined prerequisite of the very calculus based on convention. Because of this abstraction, problems with the formalization of a proper calculus are following automatically.

Summary
This notion of commutativity as Kauffman’s remark shows is still very vague. As a summery of the exercise some results might be collected.
Commutativity for the CI holds for concatenation of arithmetic and algebraic expressions. Commutativity doesn’t hold, trivially, for superposition, except for the case of notational identity of operator and operand of the superposition, say typeset structure1 with typeset structure= typeset structure.

This confirms, again, the observation of Varga/Matzka that the CI-commutativity is not just an algebraic property as in the sense of Kauffman et al but a semiotic or, as it was emphasized in other papers, a graphematic property.

"A third deviation from classical semiotics is less obvious: the commutativity of the concatenation operation. For any two terms "a" and "b" the terms "ab" and "ba" are identical. That this is indeed a semiotic identity (and not just a logical equality) has been stressed by Varga.“ (Matzka, 1993)

Nevertheless, this insight into the semiotic deviation, in respect of the type/token-relation, for semiotic concatenation, in contrast to “encloser" (superposition), is still not very clear. That is, taken at face value, it boils too quickly down to the classical algebraic situation of commutativity.

The proposed solution, presented in my previous papers, stresses the fact that the CI-semiotics and its syntactical structure is not a tree, based on mark and unmark, cross and blank, but is,  from the very beginning of the calculus, a commutative structure. This structure makes no sense for a 2-element CI-algebra with {cross, blank} but needs a “pattern”-oriented approach of at least 3 different configurations: (aa), (ab), (bb), with (ab) =CI (ba).

On this graphematic level, the famous “commutativity” holds in a strictly deviant sense at least in respect of an identity-based semiotics. And that just blocks any reduction of the CI to a Boolean algebra. Usually, the concatenation of terms in the CI gets a logical interpretation as conjunction or as disjunction. Obviously, both are commutative: p typeset structure q = q typeset structure p. It seems then, that on this level of reflection, commutativity of concatenation appears as not such special as pronounced.

The presented reflections and the following arguments may give some insights into the different levels of “commutativity” in the CI. But it is still not specially clear, if those insights still remain in the conceptual and technical framework of the CI. If not, it seems difficult to “save” the CI from being reduced to a conventional calculus based on 2 atomic states: cross and blank.

Without the insistence on the “topology-invariant” features, it seems that the concept and some  primary formalization of the CI is not just more or less “isomophic” to propositional logic but also to Combinatory Logic, and with that to the Lambda Calculus too.

Conventional reception of the CI was mainly interested in the re-entry form and its speculations, and not much into the epistemological and technical aspects of the basic calculus of indication as such.

Combinatorics CI - graphematics : a != b, (aa) != (bb), (ab) = (ba) . <br /> Brown  _  ... br /> Catalan number of brackets for ∀ n ∈ N : C  _ n = 1/(n - 1) ((2 n)/n) .

                &nb ... sp;       b <br />          

Commutativity and the combinator T
Some further "elaborations" of the commutativity topic is accessible with the help of the combinator T.

   Abstraction     Symbol       Bird  & ... bsp;     ((S (K (S ((SK) K)))) K)     <br />    

http://www.angelfire.com/tx4/cus/combinator/birds.html

<br />    T a b =  _ CL b a    <br />  <br />

CI <br /> T (p q) =  _ CI (p q) <br />

<br /> ((T a b =  _ CI ab <br /> K (a b) = a)/(K " (a b ) = b)) => K a b =  _ CL K " ( T (ab)) ;    but K a b !=  _ CI K ( T (ab)) .

A solution of the conflict is offered by the rules of standard normal forms. Also the operator T has an invariant result in the CI, its abstraction, i.e. Tab = ab, has to be followed by the choice of a standard normal form presentation of the terms “ab”. Hence, also Tab = ba, and ab =CI ba, the representation of the abstraction T demands an invariant representation in the calculus. This is nothing new but has to be considered again.

Therefore, in a isolated situation, the formula (ab) =typeset structure(ba), i.e. for a, b ∈ CON (concatenation), may hold but this is not the case if the terms are involved with an operation and are including variables, say, albeit
(ab) =CI(ba), Kab !=typeset structure Kba.

Definition of a CI-expression
Hence, a CI-expression e is defined as an abstraction over T:
e ∈ CI iff ∀ a, b ∈ CI: (a b) = e1, T(a b) = e2: etypeset structureCIe2.
e ∈ CI iff e ≅CI T(e) .

1.1.6.  Demonstrations

e1 : 0 0 0 0 0    = ⌀ <br /> dem (e1) : 0 0 0  0 0     =>   ... <br /> perm (e1) : 0 0 0  0 0    = 0 0 0 0 0     =    0 0  0 0 0  .

How to decompose  e   = 0 0  0 0 ? <br /> <br /> dec (0 0  0 0 )    => {  &n ...                                                                                        0  ; 0 ; 0

Instead of brackets and their use as superposition marker the semicolon ";" is used to avoid confusion.

Application <br /> S (x y z ) = x z (y z), with brackets : <br /> 1. (x y z)    = (& ... p; 0  0 0 ) : <br /> S ( 0  0 0 ) = 0 0    ( 0 0)  K (0 ( 0    (0 0 ))) = 0

2. (x y z)    = ( 0 0    0 ) : <br /> S ( 0 0    0 0 ) = 0  0    (0  0 ) K ( 0  0    ( 0  0 )) = 0  0 K ( 0  0 ) = 0  .

3.    (x y z)    = ( 0    0 0 ) : <br /> S    ( 0 &nbs ... bsp; 0 0 (   0 0 ) = 0 0       K 0 0    = 0 . <br />

4.    (0 0  0 0 ) <br /> B (0 0  0 0 )    = ((0 0  0) 0 ) K " ((0 0  0) 0 ) = 0 .

short:
Brackets for notational order and brackets as superposition markers.

5.   0  0 0    : <br /> K (K "    0  0 0)    = K (0 0 ) = 0 ... p; = 0 0 = ⌀, <br /> KK "    0  0 0    != K    0  0 0 .

Result of 5.
There is a conflict between the rules for T and K applied to the CI.

1.2.  Church-Rosser confluence for CI expressions

1.2.1.  Church-Rosser for CL

CL-expressions are well defined with variable x, primitive functions P, and applications (E1E2) of combinatory terms E1 and E2. Brackets are associative:  (E1 E2 E3 ... En) = (...((E1 E2) E3)... En).

Associativity of applications is not to confuse with the permutativity of terms in the CI.
Hence,
            E1, E2 ∈ CL : (E1 E2) !=CL  (E2 E1).

Combinatory Logics are well documented.

http://maths.swan.ac.uk/staff/jrh/papers/JRHHislamWeb.pdf
Church-Rosser for morphogrammatics are sketched at:
http://memristors.memristics.com/Church-Rosser%20Morphogrammatics/Church-Rosser%20in%20Morphogrammatics.pdf

1.2.2.  Church-Rosser for CI

A simple CI-example for a CI-expression e is given by the fact of the permutation-invariance of its marks. A CI-expression e is an abstraction of its possible realizations based on the set of its terms and the position of the terms in the expression. The implicit algebraic axiom of the commutativity, ab = ba, of the concatenation of terms is ruling the game.

e  _ 1 =   0 0 0 0 0  e  _ 2 =    0 0 0 0 0  e  _ 3 =  0  0 0 0   ...  0 0  0 0 0 <br /> ∀ i, j : e  _ i =  _ CI e  _ j, i, j = 1, ..., 6

e = perm {α, β, γ} <br /> α =   0 0 0 <br /> β = 0 <br /> γ = 0 <br /> type = {α, β, γ}    

Hence, a CI-expression or arrangements consists of the marks typeset structure the combinations and the positions of the combinations. Combinations are closed under the dominating mark. The concept of positions of terms of an expression is not used in the CI. It seems to be one of the hidden abstractions.

   expr/type     pos1          pos2          pos3   e             1   α        &# ...  γ        β        α   e             6   β        γ        α

Therefore, a CI-expression is an abstraction of the realizations of the permutation of its terms. What is considered commonly as a CI-expression is a representation or a standard normal form of an expression and not the concrete expression defined by the explicit and hidden rules of the CI. This observation holds under any “umbrella” of a dominating form, too.
typeset structure

               &nbs ... nbsp;               0 <br />

Thus a value for any arrangement can be supposed if the arrangement can be simplified. But it is plain that some arrangements can be simplified in more than one way, and it is conceivable that others might not simplify at all. (GSB, LoF, p. 10)

Also the CI is governed by the hidden law of permutational invariance, a reduction of a CI-expression delivers, at least in the finite case, an identifiable value. All CI-expressions are reducible to the value mark or unmark. Because the CI is defined by an “elementaristic” approach, two marks are unambiguously equal or non equal. Therefore, the CI belongs nevertheless to the class of identity calculi.

A pattern-oriented approach is able to keep the property of permutational invariance in the result of a demonstration. Hence, a result of a demonstration or reduction might differ in the order of its values, like (typeset structure ⌀) =typeset structure (⌀ typeset structure).

"The simplification of an expression is unique.” (LoF, p. 14)

Permutation-invariance disappears in the results of a CI demonstration or calculation.

1.3.  Reductions of axioms

1.3.1.  Reduction of basic operators

To define a similarity or even an isomorphism between two calculi is a straight-forward exercise. But to find a way to apply the translation and to find similar reductions of axioms, is a more challenging entertainment.

For CL
The reduction of the identity combinator I of the CL is standard. The identity I(x) might be defined by the combinators S and K only.

I (x) = x :    <br /> ((SKK) x) --> (SKK x) --> (K x (K x)) --> (I x) .

(Kx(Kx)) is a superposition of Kx onto Kx, and not a concatenation. Hence,  (Kx(Kx)) is an application of the combinator K as an operator on the combinator K as an operand.

This reduction is applied to the CI : <br /> ((J2 I1 I1) x)    --> (J2   I1   I1  ... sp;         Distr = J2,   I1 = K, I x by definition : 0 .

Therefore, it can be shown by means of CL, that the initial I2 can be eliminated without loss in the CI, resulting in the new calculus CI'= (I1, J2, app), similarily to the reduction of the identity combinator I(x) in CL. Thus, application in CL is superposition in CI, concatenation in CL is concatenation in CI.

    Reduction in CI <br /> <br />     I2 x ⇔     ... nbsp;  <br />      for any x <br />       <br />

Position J1
typeset structure = ⌀    ::   typeset structure = ⌀ :  typeset structure =  typeset structure = typeset structure  ,  typeset structure = typeset structure = ⌀.

typeset structure (typeset structure) = typeset structure : (Stypeset structure (typeset structure )) x = (typeset structure x (typeset structure x) ) =  typeset structure

typeset structure (typeset structure) = typeset structure : (S typeset structure (typeset structure )) p = typeset structure p (typeset structure p) =  typeset structure.


typeset structure   typeset structure   typeset structure


typeset structure   typeset structure

Results
The Initials I2 for Order of the primariy arithmetic and J1 for Position of the primary algebra are reducible to I1 for Number of the primary arithmetic and J2 for Transposition of the primary algebra.
Order and Position are definable by the equivalents of the CL combinators K and S.
That is to say, the CI Initials for Order and Position are redundant.
The proofs are accepting a strategic mix of primary arithmetic and primary algebra, i.e. I1 and J2.

1.3.2.  Definition of self-referential operators

Re-entry operator
Self-reference in the CI is build by an adhoc construction of abstraction but not by the application of CI rules.

f =  ... a    b a b    f =  f a    b

And so on . And by meditation you get : f = f  ≡     f, LoF ' s final script for self - reference (Varela) .

But this is just part of magic and has no foundation in the appartus of the CI. A similar figure of introduction occurs by meditation on iterativity with Heinz von Foersters Eigenvalues of his Uroboros. In contrast, Combinatory Logic is able to construct its beasts. In this sense, the CL is “deeper than truth”, simply because these CL-contradiction-free constructions are producing contradictions in the context of a logical interpretation.
http://www.thinkartlab.com/pkl/lola/poly-Lambda_Calculus.pdf

Self-reference CL
--> (S I I (S I I))
|             ↓
|     (I (S I I (I (S I I)))
|             ↓
|     (S I I (I (S I I)))
|             ↓
<--  (S I I (S I I))

Y-operator in CL

Y =CL f (Yf).

One of the many classical definitions of Y:
Y f = (W(B f)) (W(B f)) = WS (BWB) f
with
W x y = x y y         : W = SS (SK)
B x y z = x (y z)    : B = S (KS) K

Proof of Y: Y f = f (Y f):
Yf = WS (BWB) f
    = BWB f (BWB f)
    = W (B f) BWB f)
    = f (Y f).

Self-reference in operational CI
The operational version of the CI might mimicking the CL construction of a CI-Y operator.
--> (J2 I2 I2 (J2 I2 I2))
|             ↓
|     (I2 (J2 I2 I2) (I2 (J2 I2 I2)))
|             ↓
|     (J2 I2 I2 (I2 (J2 I2 I2)))
|             ↓
<--  (J2 I2 I2 (J2 I2 I2))

1.4.  An alternative calculus out of the form

Elements B = {0, ⌀ } Axioms K : 0    a --> 0  I : a --> a   & ... nbsp;  S :  p     q    r -->   p r     q r <br />

2.  Pattern-oriented formalization

2.1.  Orientation

Motivations
Also it seems to be difficult to characterize the CI properly in its own conception, because of a serious lack of original elaborations of the calculus by George Spencer-Brown, my own main interest into this confusing situation is to find genuine “formal systems” that correspond to the scriptural levels of the proposed graphematics.

The identity level of the graphematic architecture is obviously perfectly covered by standard mathematical formal systems, logics and formal languages.
The purely non-identity, i.e. kenogrammatic levels, are principally well accessible by the conceptions and apparatus of morphogrammatics.

The formal system, covered or hidden by the CI has similarities to the mixed language of kenogrammatics and identity system of “topology” invariance. I am not aware of another approach to deal with this graphematic level of mixed formal languages as with a generalized approach to the Brownian “indicational” systems.

The motivation to the complementary system to the generalized indicational system, proposed by the generalized calculus of differentiation, has the function to offer a formal interpretation to the Mersenne languages as the second mixed language of graphematics.

Leaving the battlefield
The easiest way to find peace with the Brownian ambitions and its defenders is to find a compromise in the valuation of the whole drama. It seems, as many have shown before, that the calculus of indication, as it is developed by Spencer-Brown, is not delivering the proclaimed revolution in formal thinking. The apparatus, as it exists and as far as it works, is not much more than a deviant notation for a well known conceptual structure.

The hope to find a structure or even a realm “deeper than truth" (Varela) uncovered by the CI has not been fulfilled. The intention may fit well into the project of graphematics with its different types of scriptural systems. But the Brownians are not aware of graphematical systems as they have been introduced since 1962 by Gotthard Gunther.

What makes the difference concerning the claims of GSB in respect of his calculus are the non-formal declarations. One aspect is leading to the underlying commutative graph-structure of the concept of the CI. Opting for this approach is motivating an indicational calculus of patterns, instead of atomic elements of arbitrary complexity.

The Brownian community, still alive, especially in Germany, seems still not to be aware of the many different other approaches to formalization beyond classical logic, notational inventions and profound philosophical interventions concerning the well known structures, albeit from different angles, perspectives, motivations and practical considerations. All developed in the long history after George Boole, Gottlob Frege, C.S. Peirce and many others, and up to date in mathematical linguistics, programming languages and computer science too.

There is quite clearly also no special merits to earn with GSB’s concept of re-entry for tackling self-referential formal structures. A lot of work has been done from the side of the followers of GSB  in this direction but mainly ignoring the classical results of recursive function theory, modal logics and other formalizations of self-reference and the strange fact, that there is no proper connection between the CI and self-referentiality established.

2.1.1.  Sketch of a morphogrammatic modeling

Tree-structure of Combinatory Logic
        CL

        Syntax
        (0) terms = {K, S, I, T}, variables = {x, y, z,...}, operator *
        (i) all variables and constants are CL-terms,
        (ii) if X and Y are CL-terms, then (X Y) is a CL term.

        Semantics
        K: LA-tree(K(xy))  => x   
        S: LA-tree(Sxyz)  => 2-tree(2-tree(xz), 2-tree(yz))
        T: LA-tree(Txy) => 2-tree(y x)
        I: tree(x) => tree(x).

        Algebra
        CL = (CL, •, S, K)
        Axioms and  Rules
        Reductions:
        CL axioms are not equalities, “⇔”, like in the CI but reduction rules with “-->”.

It seems that there is no chance to build a primary “topology-invariant” structure out of the tree-rules for the CL. Again, Tab !=CL ab.

Tree-structure for the calculus of indication
        CI
        Syntax
        (0) terms = {typeset structure, ⌀}, variables = {p, q r, s,...}, operators = {*, ^},
        (i) all variables and constants are CI-terms,
        (ii) if X and Y are CI-terms, then (X * Y) and (typeset structure ^(Y)) is a CI term.

             Semantics <br /> &nbs ... p;  J2 :  p     q    r ⇔   p r     q r . <br />

Graph - structure of CI - com As an improvised solution : <br />       ... ; _ CI xy . <br /> Or simply as the hidden assumption for the commutativity of concatenation J0 :

           <br />            J0 : ∀ x, y ∈ CI : x^y =  _ CI  y^x .

In CL - terms :    <br />            J0 :    ∀ x, y ∈ CI : T xy =  _ CI xy . <br />

   CI = ({, ⌀}, I1, I2, J0, J1, J2, * , ^, ⇔ )

It seems that there is no chance to build a primary “topology-invariant” structure out of the tree-rules for the elementaristic CI.

Unfortunately, the intentions of the CI suggest a commutative graph instead of a binary tree.

In contrary, again,
"Every finite expression has a unique simplification.” (T3 in LoF);

Because the CI has in fact a base of two elements, {typeset structure, ⌀}, and not of just one element {typeset structure} as it is said, a mapping of the 2-element base onto the syntax produces a binary tree. On this tree, configurations (expressions) are obviously defined unambiguously by their path in the tree. The path is readable in both directions, and therefore, rules are a kind of equalities, with "⇔”, and not strictly uni-directional reductions like in CL with "-->”.

Hence,
"Any pa (or sentential logic) formula B can be viewed as an ordered tree with branches."

This comfortable, but annoying situation, disappears, if the declared intentions and ambitions of the Brownian declarations are taken by face value.

Because of the commutativity of its basic terms, as it is understood by the declared ambitions, the simple syntactic and semantic, or indicational hierarchy, has to be replaced by a commutative structure, where configurations are determined in different ways, as results of different paths in the graph.

Therefore, a CI configuration in a pattern-oriented setting, will be defined by several paths in the graph.

Example :   ⌀ ≅ ((x ->     ->     ⌀)/(x ->  ⌀   ->     ⌀)) .

2.1.2.  Contextural modeling of patterns

A slightly less annoying modeling might be opened up by a contextural approach that is disseminating the classical 2-state calculus of indication over different contextural loci. A 3-contextural modeling is disseminating a 2-state CI over 3 different loci of a reflectional configuration. (cf. Diamond Calculus)

The contextural approach is decomposing patterns into elementary parts, while the morphogrammatic approach to patterns is operating on their morphogrammatic laws.

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

Brown (2, 2) : {, ⌀ } _ (/CI)^1 --> {, ⌀ } : ((n + m - 1)/n) : ((2 + 2 - 1)/2 ...                                 ⌀                                      ⌀   ⌀

Permutation versus braiding for    double - crossing Like double - negation, double  ... ;                

A pattern-related approach is involved into topological chances. Instead of a permutative inversion dictated by an identity space of a set-theoretic permutation, a braiding in a topological space is defined that is taken into account the differences between the directions of the construction and destruction of the superposition "typeset structure":

Braided   crossing :    ⌀   :    ⌀   ... A0; _ 2  _ 1 =    ⌀  _ 2  _ 1  _ 1  _ 2 .

2.1.3.  Dissemination of CIs

          3 - contextural model <br />    <b ... bsp;               3 <br />

Order     --> ⌀     : ∀ i :   _ i > Ȱ ...                  

Algebra  CI = ({, ⌀}, I1, I2, J1, J2, conc, sup, = ) ζ : { I1, I2, J1, J2} x {, &# ... ;} ops : {, ⌀} --> {, ⌀} CI = (ops,    {, ⌀}) = (ops, elements)

Strictly reflectional constellation matrix CI ^(3, 1)      &n ...            CI            3                    1.3      -                   - Null

Mixed reflectional constellation <br /> <br /> CI                   O          ...                                3     1.3                        x                              3.3

      Interchangeability for mixed reflectional configurations <br /> ...                                                                     3           3.3              3

3.  Comparatistics Table

comparatistics                                                                                 ...                                                                             <br /> x = f(x) <br />

http://www.mathematica-journal.com/issue/v5i4/columns/maeder/35-41roman.54.mj.pdf