Rudolf Kaehr Dr.phil^{@}

Copyright ThinkArt Lab ISSN 2041-4358

Abstract

The paper *“Gödel Games: Cloning Gödel’s Proofs”* started a polycontextural dissemination of the *“Beautified Gödel Proofs*” of Hehner. This paper takes a morphogrammatic turn to such a dissemination in emphasizing the distributive possibilities of the modi of repetition in morphic palindromes. Palindromicity of morphograms is a precision and concretization of the philosophical construct of iterability as it was applied for a distribution of Gödel’s theorems.

(Work in progress v. 0.5.5, March 2013)

Again, """In a slogan: "Quotes don't know their mates.""

George Boolos, Logic, Logic, and Logic"

The paper *“Gödel Games: Cloning Gödel’s Proofs”* started a dissemination of the *“Beautified Gödel Proofs*” of Hehner. The emphasis was on a complex distribution, *reflectional* and *interactional*, of the mechanism of “self-quotation”, ruled by the interplay of *quotation* and *interpretation*, as the device of the Gödel construction.

Hence, distribution as a modus of repetition was conceived as “*iterative*” and as “*accretive*” and realized in a grid of contextures.

As a further *concretization* of the idea of quotation and dissemination (distribution and mediation), an application of morphogrammatic *palindromic* constructions shall be risked. Because of the lack of any information about the *internal* differences of the disseminated construction of the polycontextural approach, the chances to fill this gap by a ‘palindromic’ interpretation of iteration shall be taken.

A Turing machine TM M applied on its own ‘description’ [M] leads by diagonalization/normalization to the desired self-referential machine M[M].

M : M --> [M ↔ M]

Gödel’s and Smullyan’s construction are presuming semiotic identity between the ‘active’ definition of the TM M and the ‘passive’, i.e. the quotation [M] of the active TM M. The relationship between M and [M] is hierarchical, and is modeled as a relationship of program (processor) and data, or ‘operator’ and ‘operand'.

Therefore, the texts of M and [M] have to be semiotically (symbolically) identical. The quotation [M] of M is operationally a ‘mirrored’ and ‘replicated’ text of M.

But this corresponds abstractly the definition of a *symmetric palindrome*. A mirror-image is the inverse or dual of the mirrored original. In this scenario, the original comes first, the mirrored image second and in reverse order, both together are involved into the relationship or process of self-similar and self-referential mappings and interactions. This still holds if the replication of the original is mirrored as an iteration of the same identitive structure.

Certainly, that’s not the standard logical and linguistic definition of a quotation as Smullyan's example shows directly: *John is reading "John is reading“*. Here, the quotation is a literal replication of the first occurrence of “*John is reading*” by the quote “*John is reading*”. This surface-structural approach says nothing about the morphic structure of the construction: the composition of the first with the replication of the first as the second in the mode of identity.

To replicate in the mode of identity presupposes a decision in favor for identity, i.e. for equality, in contrast to the possibility of *equivalence*, *similarity* or *bisimilarity* - and others.

Folowing the insights of the morphogrammatic “T*rompe-l'œils* of Semiospheres” of semiotic configurations we get, e.g. for X = [1,2,3,4], the morphogrammatic result, X"X":

- ispalindrome [1,2,3,4,1,2,3,4];

val it = true : bool

And the semiotic result:

- palindrome [1,2,3,4,1,2,3,4];

val it = false : bool

But not all mirrors are offering a symmetric replication of the ‘original’ text. Asymmetric textures with symmetric functionality are the morphogrammatic subversions, enabled and played by morphic palindromes.

Hence, the Gödelian misery (disapointment) of the limitation theorems for Kurt Gödel is inherited by its complicity with the historical concepts of semiotic palindromes and its symmetry.

Historically, Kurt Gödel met Gotthard Gunther a few years to early to get some valuable hints from Gunther to overcome the negativity of his own results. (Charles Parsons) There was probably a mismatch of interests too. Gunther wanted some technical help for his attempts to formalize his reflectional logic (Stellenwertlgik). Gödel assumed to get some hints for conceptual and philosophical inspirations. Both lacked a mediator to help each other.

The proposed dissemination of “Gödel” in the paper *“Gödel Games: Cloning Gödel’s Proofs”* wasn't yet contemplating about the difference of ‘symmetrical’ and ‘asymmetrical’ formulations of a Gödel sentence, here in the context of a Turing machine TM and its program M.

What happens if the quotation quotes creatively a different inscription that is nevertheless palindromically equivalent to its origin?

What happens if the process of cloning is accretively, and not iteratively repeating its iterated origin?

Thus, the Gödel theorems are based on symbolic palindromes.

Post-Gödelian theorems are forced by morphic palindromes.

Why would we need self-referentiality, and all its derivates, like self-applications, etc.?

This *subversion* applied on the definition of the Halting problem has now to consider the double character of self-application, the symmetric and the asymmetric, or as it was conceived before, the *iterative* and the *accretive* modi of iterability.

Things might be confusing! A first confusion is cleared by Sipser’s advice:*"Don’t be confused by the idea of running a machine on its own description! That is similar to running a program with itself as input, something that does occasionally occur in practice.”* (Sipser, 1997, p.165)

Obviously, all philosophical and logical considerations and problems with self-reference are generously bracket out by Sipser’s advice.

The other confusion is harder to disperse. As shown in the paper *”Morphosphere(s)"* palindromes might be asymmetric in the framework of morphogrammatics, i.e. in the paradigm of morphospheres. This possibility of a simultaneity of semiotic asymmetry and a morphic symmetry is the new challenge to the theory of computation.

With the palindromic subversion, the idea of disseminating Gödel’s proof over a polycontextural grid gets a radical concretization, and a possibility of a much more direct elaboration.

Hence, ‘measures’ of undecidability are accessible to intriguing concretions, enabled by the complexity of asymmetric palindromes. Asymmetric palindromes functions as asymmetric *quotations* and *iterations* or repetitions and replications.

The formula <X"X“> always presupposes that X≡X, i.e., that X and the quoted (repeated) X in the quotation “X” are equal. It doesn't say that the unquoted X and the quoted X, i.e. “X”, are equal. One is on a first-order, the other on a second-order level. One occurs first, the other second, hence, the second is a repetition of the first. But what is repeated is X and X is equal as X at both positions of occurrence.

Therefore, the nice text-book presentations of Gödel’s theorems, the self-applications of programs and their *diagonalizations* (Cantor, Tarski, Gödel) and *normalizations* (Smullyan) are appearing as a tiny special case of *identity* strategies in the general framework of graphematic scriptures.

This sounds trivial but if iteration *alters* then the alteration needs to be characterized.

*"The defined theory *allow us to replace something with its equal* but it is not able to disallow a distributed substitution because equality of terms is defined in the theory only *"up to isomorphism". *Such theories are identifying the terms "equal" with "same". The polycontextural approach offers a different option to the difference of equality and sameness. Equality in this sense is an intra-contextural term but sameness is a trans-contextural term. Because substitution is generally defined in a theory only up to isomorphism we always have the possibility to interpret the action also in a trans-contextural way. As long as the definitions of the theory are not disallowing this way to use substitution there is always some degree of freedom to interpret the terms in another similar theory."*

http://www.thinkartlab.com/pkl/lola/Godel_Games/Godel_Games.htm

To quote something as something else that still is the same:*Symbolic quotation*

To quote something as itself, i.e. in the mode of the is-abstraction as: “X as X is X".*Morphic quotation*

To quote something in the mode of the morphic as-abstraction as: “X as Y is Z".*Metamorphic quotation*

To quote something in the mode of the metamorphic as-abstraction as: “X as Y is U as V”.

Hence, *“Self-reference without reference” *is the slogan for the fact that morphogrammatic referencing is evoking its reference in the process of referring to its own reference.

There are many attempts and wordings to introduce the scenario of self-reference in formal languages. It is not my aim to add one more. Therefore I shall quote Raymond Smullyan’s quotations about the process of quotation, its explanation and formalization as it is presented on a semi-formal level.

**Normation and diagonalization**

"By the norm of an expression we shall mean the expression followed by its own **quotation**. For example, consider the following expression.

*(1) John is readingThe norm of (1) is the following.(2) John is reading "John is reading"*

*The sentence (2) is not self-referential; it doesn't assert that John is reading (2); it asserts that John is reading (1). But now consider the following.*

*(3) John is reading the norm ofIts norm is the following sentence.(4) John is reading the norm of "John is reading the norm of"*

*Sentence (4) asserts that John is reading the norm of (3), but the norm of (3) is (4) itself. And so (4) asserts that John is reading (4). Thus (4) is self-referential.*

*Let us look at an abbreviated version. Again, we abbreviate "John is reading" by the letter " J." And we shall use the letter "N" to abbreviate “the norm of." Then (3) and (4) assume the following symbolic forms.*

*(3)' JN(4)' JN"JN"*

*(4)' asserts that John is reading the norm of (3)', but the norm of (3)' is (4)' itself. Thus (4)' asserts that John is reading (4)'.*

*Alternatively, using our notion of norm, the following is a version of the paradox.The set of false sentences contains the norm of "the set of false sentences contains the norm of"*

*Using diagonalization instead of normalization, the paradox would be stated thus.*

*The set of false sentences contains the diagonalization of"the set of false sentences contains the diagonalization of x"*

*Let us note in passing that, using diagonalization, the following is an expression that designates itself: the diagonalization of "the diagonalization of x." Or symbolically: D"Dx". Using normalization, the following expression designates itself: the norm of "the norm of." Or symbolically: N"N"." (Smullyan, 1994, p. 4/5)*

**Repetition**

"A conceptually simpler operation than association, which also accomplishes self-reference, is that of *repetition*, where by the repeat of an expression X is meant the expression XX, i.e., X followed by itself.

*Let us use “R" to abbreviate "the repeat of." Then a sentence that asserts that John is reading it is JR*JR*. It asserts that John is reading the repeat of JR*, which is the very sentence JR*JR*. (The sentence JR*JR won't work; it asserts that John is reading JRJR, not that John is reading JR*JR.)"*

Raymond M. Smulyan, Diagonalization and Self-Reference, 1994

http://bookos.org/g/Raymond%20M.%20Smullyan

http://www.thinkartlab.com/pkl/lola/Godel_Games/Godel_Games.htm

http://www.thinkartlab.com/pkl/lola/Godel_Games-short.pdf

**The general strategy***"Some of mathematicians, for example *George Polya*, argued that deductions is impotent without *analogy*. What I want to show is that there exists a direct line leading from *Cantor*’s diagonal argument to constructions that underlies of the proofs of several important theorems of the mathematical logic (in particular, *Church*’s theorem concerning the undecidability of formal arithmetic, *Gödel*’s theorem concerning the incopleteness of formal arithmetic, *Tarski*’s theorem concerning truth, and *Turing*’s theorem concerning the Halting Problem), and that the line could be described as an analogical mapping. In other words, Cantor’s diagonal argument and the proofs of the limitative theorems are structurally the same.”*

Zbigniew Tworak, ANALOGY AND DIAGONAL ARGUMENT

www.logika.umk.pl/llp/151/151-3.pdf

**Thesis: ***Morphic* self-referentiality is palindromic. Producing finite self-quotational palindromes.

*Indicational* self-referentiality is a re-entry of the form into the form. Producing an infinite re-entry form.

*Symbolic* self-reference of a sentence is based on its self-quotation caught by its norm or diagonalization. Producing infinite iterations and logical contradictions.

The *palindromic* approach to quotation as repetition, replication or reflection gives a closer connection between the formula and its quotation than a free, i.e. a structurally not mediated connection to the original formula in a repetition of the formula.

*"By the *norm* of an expression we shall mean the expression followed by its own *quotation*.” *(Smullyan)

All depends now on the understanding of the term “own”. What does “own” mean in the relation to its own sentence. Who owns this sentence that has a relationship to its own?

Obviously, the ownership of both, the sentence and its own quotation is a property of the identity logic and semiotics of logocentrism.

If an ‘expression’ should be quoted (by another expression) it necessarily has to be the identically same sentence of the quotation that has to be quoted. And not accidentally another possible sentence. Identity secures the truthfulness of the relationship between the original and its replication as a quotation. This is well codified by: ⌈⌈M⌉⌉ = M. Hence, identity is the measure or criterion of the success of the interplay of the original and the replication of the original on a different linguistic and logical level. It guarantees the successful bridging of the different levels.

Morphograms are not sentences, thereafter there is no ownership by logocentric self-reference and logic possible.

In this sense, it makes, without apophantic reference, sense, to refer to what has no reference, the iterability of inscription, technically realized by morphic palindromes.

If morphograms are not linguistic entities or processes like sentences how could a quotation be realized?

A first attempt to tackle this intriguing question might be achieved by the focus on the kind of *iterability* between the ‘original’ and its ‘iteration’ or ‘replication’. Independent of cognitive and linguistic levels of thematizations, the statement of the original and the repetition of it on a different level as a quote, the common or deep-structure of it is the action of iteration. Here, restricted on a kind of a linear order of the first and the second.

With morphogram X = [1,2,2,3] as the stated ‘original’ and “X” = [2,1,1,3] as the quotation of the original ”itself” as “another” [2,1,1,3] with [2,1,1,3] =_{MG} [1,2,2,3], the *composed* morphogram X"X” = [1,2,2,3,2,1,1,3] is introduced as a ’quotational’ composition. But is it a palindrome? The composed morphogram X”X” is a quotation if it is a palindrome.

Also X and “X” of the example are morphogrammatically equivalent, the composition X"X” = [1,2,2,3,2,1,1,3] is *not* a morphic palindrome. Albeit the fact that the morphogram [2,1,1,3] is a sort of an *iteration *or even an *accretion* of the morphogrammatically equivalent morphogram X = [1,2,2,3], the composed morphogram fails the criterion of palindromicity.

In contrast, the composition X"X” with X = [1,2,2,3] and “X” = [3,1,1,2], X"X” = [1,2,2,3,3,1,1,2] is a palindrome, and is therefore qualified as a morphic quotation. The composition <X"X"> might be written as [[1,2,2,3],[3,1,1,2]] to emphasize its two components.

Hence, the new ‘ownership’ of the ‘reference’ to its ‘own’ inscription is in the ownership and control of what is enabling morphic palindromes. Morphic palindromes own the rules of morphic quotations.

How is morphic self-referentiality constructed?

**Smullyan:**

"(3) John is reading the *norm* of x

Its norm is the following sentence.

(4) John is reading the *norm* of x="John is reading the *norm* of x"

Sentence (4) asserts that John is reading the norm of (3), but the norm of (3) is (4) itself. And so (4) asserts that John is reading (4). Thus (4) is **self-referential**."

**Transcription**

(((John is reading the norm=John is reading the norm)=John is reading the norm of))... of "John is reading the norm of"...)))

N"N” => N"N"N”” => N"N"N"N””" => ...

**Morphogrammatic model***The same is different*

Iteration alters. Hence, the iterative procedure is producing a chain of same and different quotations for N"N” depending on the modi of iterativity, replication, reversion and accretion. All have to accept the conditions of palindromicity to realize a morphic quotation.

Hence, morphic self-referentiality, using different modi of iteratiity, is not circular but is creating labyrinthine journeys that might contain circles too.

*The different is the same*

Different morphograms are the same at different places. Quotation is depending on (reflectional, object-, meta-language) places in a contextural grid.

Hence, morphograms N and “N” are morphogrammatically equivalent (similar): [N] =["N"].

Is there a difference between ["X"] and “[X]"?

Thus, morphic self-referentiality is not contradictory. The (negational, reflectional) differences are collapsing in the negation-invariant morphogram.

What are the analogies of contradictions for morphogrammatic systems?

Also the two parts, [1,2,2,3] and [2,1,1,3] of the composition X"X”, [1,2,2,3,2,1,1,3], are morphogrammatically equivalent, [X] =_{MG}["X"], the composition is not a palindrome.

ispalindrome X"X"?

- ispalindrome [1,2,2,3, 2,1,1,3];

val it = false : bool

On the other hand, other morphic quotations of X are compatible with palindromes.

X"X” with X = [1,2,2,3] and “X” = {[3,1,1,2], [3,2,2,1], [4,2,2,1], [4,5,5,6]} are morphic palindromes.

- ispalindrome [1,2,2,3, 3,1,1,2];

val it = true : bool

- ispalindrome [1,2,2,3, 3,2,2,1];

val it = true : bool

- ispalindrome [1,2,2,3, 4,2,2,1];

val it = true : bool

- ispalindrome [1,2,2,3,4,5,5,6];

val it = true : bool

Replication

- ispalindrome[1,2,2,3,1,2,2,3];

val it = true : bool

Again, the *redundant* pattern [1,2,2,3,4,6,6,7] with [1,2,2,3] and [4,6,6,7] is not accepted as a palindrome:

- ispalindrome [1,2,2,3, 4,6,6,7];

val it = false : bool

- tnf[1,2,2,3,4,6,6,7];

val it = [1,2,2,3,4,5,5,6] : int list

Following the classic definition for a palindrome as < X"X">, with “X" = inverse(X), the morphogrammatic equivalent shall be:

[X]"[X]" is a palindrome if "[X]" = kref[X].

**Examples**

X = [1,2,2] is not palindrome

- kref[1,2,2];

val it = [1,1,2] : int list

X, krefX:

- ispalindrome[1,2,2,1,1,2];

val it = true : bool

X = [1,2,2,3] is a palindrome

- kref[1,2,2,3];

val it = [1,2,2,3] : int list

- ispalindrome[1,2,2,3,1,2,2,3];

val it = true : bool

X= [1,1,2,3] is not a palindrome

- kref[1,1,2,3];

val it = [1,2,3,3] : int list

- ispalindrome[1,1,2,3,1,2,3,3];

val it = true : bool

- rev[1,2,2,3];

val it = [3,2,2,1] : int list

- ispalindrome[1,2,2,3,3,2,2,1];

val it = true : bool

In accordance to the concept of morphograms, domains of morphograms are finite and numerically characterized by the sum of the Stirling numbers of the second kind. This kind of finiteness allows to study the whole domains.

For the trito-structure of graphematical systems, such domains are formally defined as *Tcontextures n.*

The set of palindromes is filtered out from Tcontexture 8 by the ML-function *“List.filter*”. The palindromes of *Tcontextures* are ‘found’ here by ‘search’ and not by construction.

**Tcontexture 8**

- length(Tcontexture 8);

val it = 4140 : int

**List.filter ispalindrome “Tcontexture 8”:**

val it =

[[1,1,1,1,1,1,1,1],[1,1,1,1,2,2,2,2],[1,1,1,2,1,2,2,2],[1,1,2,1,2,1,2,2],

[1,1,2,2,1,1,2,2],[1,1,2,2,2,2,1,1],[1,2,1,1,2,2,1,2],[1,2,1,2,1,2,1,2],

[1,2,1,2,2,1,2,1],[1,2,2,1,1,2,2,1],[1,2,2,1,2,1,1,2],[1,2,2,2,1,1,1,2],

[1,1,1,2,2,1,1,1],[1,1,2,1,1,2,1,1],[1,2,1,1,1,1,2,1],[1,2,2,2,2,2,2,1],

[1,1,1,2,2,3,3,3],[1,1,2,3,3,1,2,2],[1,1,2,1,3,2,3,3],[1,1,2,3,1,2,3,3],

[1,2,1,3,3,2,1,2],**[1,2,2,3,3,1,1,2**],[1,2,3,1,2,3,1,2],[1,2,3,2,1,3,1,2],

[1,2,1,1,3,3,2,3],[1,2,1,3,1,3,2,3],[1,2,3,1,3,1,2,3],[1,2,3,3,1,1,2,3],

[1,2,2,2,3,3,3,1],**[1,2,2,3,2,3,3,1]**,[1,2,3,2,3,2,3,1],[1,2,3,3,2,2,3,1],

[1,1,2,2,3,3,1,1],[1,1,2,3,2,3,1,1],[1,1,2,3,3,2,1,1],[1,2,1,2,3,1,3,1],

[1,2,1,3,2,1,3,1],[1,2,1,3,3,1,2,1],[1,2,2,1,1,3,3,1],[1,2,3,1,1,2,3,1],

[1,2,3,1,1,3,2,1],[1,2,2,1,3,2,2,3],**[1,2,2,3,1,2,2,3]**,**[1,2,2,3,3,2,2,1**],

[1,2,1,2,2,3,2,3],[1,2,3,2,2,1,2,3],[1,2,3,2,2,3,2,1],[1,1,2,2,2,2,3,3],

[1,2,3,3,3,3,1,2],[1,2,3,3,3,3,2,1],[1,1,1,2,3,1,1,1],[1,1,2,1,1,3,1,1],

[1,2,1,1,1,1,3,1],[1,2,2,2,2,2,2,3],[1,1,2,2,3,3,4,4],[1,1,2,3,2,3,4,4],

[1,1,2,3,3,2,4,4],[1,2,1,2,3,4,3,4],[1,2,1,3,2,4,3,4],[1,2,1,3,3,4,2,4],

[1,2,2,1,3,4,4,3]**,[1,2,2,3,1,4,4,3]**,**[1,2,2,3,3,4,4,1**],[1,2,3,1,4,2,3,4],

[1,2,3,1,4,3,2,4],[1,2,3,2,4,1,4,3],[1,2,3,2,4,3,4,1],[1,2,3,3,4,4,1,2],

[1,2,3,3,4,4,2,1],[1,2,3,4,1,2,3,4],[1,2,3,4,1,3,2,4],[1,2,3,4,2,1,4,3],

[1,2,3,4,2,3,4,1],[1,2,3,4,3,4,1,2],[1,2,3,4,3,4,2,1],[1,2,3,4,4,1,2,3],

[1,2,3,4,4,2,3,1],[1,2,3,4,4,3,1,2],[1,2,3,4,4,3,2,1],[1,1,1,2,3,4,4,4],

[1,1,2,3,4,1,2,2],[1,1,2,1,3,4,3,3],[1,1,2,3,1,4,3,3],[1,2,1,3,4,2,1,2],

** [1,2,2,3,4,1,1,2]**,[1,2,3,1,2,4,1,2],[1,2,3,2,1,4,1,2],[1,2,1,1,3,3,4,3],

[1,2,1,3,1,3,4,3],[1,2,3,1,3,1,4,3],[1,2,3,3,1,1,4,3],[1,2,2,2,3,3,3,4],

**[1,2,2,3,2,3,3,4]**,[1,2,3,2,3,2,3,4],[1,2,3,3,2,2,3,4],[1,1,2,3,4,2,1,1],

[1,1,2,3,3,4,1,1],[1,2,1,3,4,1,2,1],[1,2,3,1,1,4,2,1],[1,2,1,3,3,1,4,1],

[1,2,3,1,1,3,4,1],**[1,2,2,3,4,2,2,1]**,[1,2,3,2,2,4,2,1],[1,2,3,3,3,3,4,1],

[**1,2,2,3,3,2,2,4],**[1,2,3,2,2,3,2,4],[1,2,3,3,3,3,2,4],[1,1,2,3,4,2,5,5],

[1,1,2,3,3,4,5,5],[1,2,1,3,4,5,2,5],**[1,2,2,3,4,5,5,1]**,[1,2,3,4,5,1,2,3],

[1,2,3,4,5,2,3,1],[1,2,3,4,5,3,1,2],[1,2,3,4,5,3,2,1],[1,2,3,1,4,5,2,4],

[1,2,3,2,4,5,4,1],[1,2,3,4,1,5,2,4],[1,2,3,4,2,5,4,1],[1,2,3,4,4,5,1,2],

[1,2,3,4,4,5,2,1],[1,2,1,3,3,4,5,4],[1,2,3,1,4,3,5,4],[1,2,3,3,4,4,5,1],

[1,2,3,4,1,3,5,4],[1,2,3,4,3,4,5,1],[1,2,3,4,4,1,5,3],[1,2,3,4,4,3,5,1],

**[1,2,2,3,3,4,4,5**],[1,2,3,2,4,3,4,5],[1,2,3,3,4,4,2,5],[1,2,3,4,2,3,4,5],

[1,2,3,4,3,4,2,5],[1,2,3,4,4,2,3,5],[1,2,3,4,4,3,2,5],[1,1,2,3,4,5,1,1],

[1,2,1,3,4,1,5,1],[1,2,3,1,1,4,5,1],**[1,2,2,3,4,2,2,5]**,[1,2,3,2,2,4,2,5],

[1,2,3,3,3,3,4,5],[1,1,2,3,4,5,6,6],[1,2,3,4,5,6,1,2],[1,2,3,4,5,6,2,1],

[1,2,1,3,4,5,6,5],[1,2,3,4,5,1,6,3],[1,2,3,4,5,3,6,1],[1,2,3,1,4,5,6,4],

[1,2,3,4,1,5,6,4],[1,2,3,4,4,5,6,1]**,[1,2,2,3,4,5,5,6]**,[1,2,3,4,5,2,3,6],

[1,2,3,4,5,3,2,6],[1,2,3,2,4,5,4,6],[1,2,3,4,2,5,4,6],[1,2,3,4,4,5,2,6],

[1,2,3,3,4,4,5,6],[1,2,3,4,3,4,5,6],[1,2,3,4,4,3,5,6],[1,2,3,4,5,6,7,1],

[1,2,3,4,5,6,2,7],[1,2,3,4,5,3,6,7],[1,2,3,4,4,5,6,7],[1,2,3,4,5,6,7,8]]

: int list list

- length it;

val it = 164 : int

Symmetric palindromes from Tcontexture 8:

val it =

[[1,1,1,1,1,1,1,1],[1,1,2,2,2,2,1,1],[1,2,1,2,2,1,2,1],[1,2,2,1,1,2,2,1],

[1,1,1,2,2,1,1,1],[1,1,2,1,1,2,1,1],[1,2,1,1,1,1,2,1],[1,2,2,2,2,2,2,1],

[1,1,2,3,3,2,1,1],[1,2,1,3,3,1,2,1],[1,2,3,1,1,3,2,1],**[1,2,2,3,3,2,2,1],**

[1,2,3,2,2,3,2,1],[1,2,3,3,3,3,2,1],[1,2,3,4,4,3,2,1]] : int list list

The *emphazised* palindromes, e.g. **[1,2,2,3,4,5,5,1],** are the palindromes with the presuposed header **[1,2,2,3].**

The examples for the ‘quotational’ palindromes are therefore defined by:

List.filter ispalindrome “Tcontexture 8” modulo head= “[1,2,2,3]".

**- Tcontexture 4;**

val it =

[[1,1,1,1],[1,1,2,2],[1,2,1,2],[1,2,2,1],[1,1,1,2],[1,1,2,1],[1,2,1,1],

[1,2,2,2],[1,1,2,3],[1,2,1,3],[1,2,3,1],[1,2,2,3],[1,2,3,2],[1,2,3,3], [1,2,3,4]] : int list list

- List.filter ispalindrome “Tcontexture 4"

val it =

[[1,1,1,1],[1,1,2,2],[1,2,1,2],[1,2,2,1],[1,2,3,1],[1,2,2,3],[1,2,3,4]] : int list list

For head [1,2]:

[1,2,1,2],[1,2,2,1],[1,2,3,1],[1,2,2,3],[1,2,3,4].

**Modi**

repetition: [1,2,1,2],

inversion: [1,2,2,1],

accretion: [1,2,3,1],[1,2,2,3],[1,2,3,4].

**Odd morphograms**

- Tcontexture 3;

val it = [[1,1,1],[1,1,2],[1,2,1],[1,2,2],[1,2,3]] : int list list

- List.filter ispalindrome [[1,1,1],[1,1,2],[1,2,1],[1,2,2],[1,2,3]];

val it = [[1,1,1],[1,2,1],[1,2,3]] : int list list

Modi for head [1,2]:

repetition: [1,2,1],

inversion: -

accretion: [1,2,3].

**Tcontexture 5**

- List.filter ispalindrome “Tcontexture 5"

val it =

[[1,1,1,1,1],[1,2,1,2,1],[1,2,2,2,1],[1,1,2,1,1],[1,1,2,3,3],[1,2,3,1,2],

[1,2,3,2,1],[1,2,1,3,1],[1,2,2,2,3],[1,2,3,4,1],[1,2,3,2,4],[1,2,3,4,5]]

: int list list

**Partial quotations**

Modi for head [1,2]:

repetition: [1,2,1,2,1],

inversion: [1,2,2,2,1]

accretion: [1,2,3,1,2],[1,2,3,2,1],[1,2,1,3,1],[1,2,2,2,3],[1,2,3,4,1],[1,2,3,2,4],[1,2,3,4,5].

Modi for head [1,2,1]:

repetition: -

inversion: [1,2,1,2,1], [1,2,2,2,1],

accretion: [1,2,3,1,2],[1,2,3,2,1],[1,2,1,3,1],[1,2,2,2,3],[1,2,3,4,1],[1,2,3,2,4],[1,2,3,4,5].

**Quotations with a ‘neutral’ midpoint for palindromes(5)**

head: [1,2], midpoint[x] of length=1repetition: [1,2,

inversion: [1,2,

accretion: [1,2,

Modi of quotation and morphic palindromicity. Palindromicity is guaranteeing the adequateness of the modi of morphic quotations. Palindromes are preserving the quotational relatedness between the morphogram X and its quotation “X” in the normalization (diagonalization) X"X”. The relationship between X and the quotation “X” is ruled by retro-grade recursive repetition modulo palindrome.

That is, not all retro-grade recursive repetitions “X” are producing a palindrome X"X".

Palindromicity is therefore a criterion to decide the correctness of quotational formulas in the use as normalizations and diagonalizations in morphic formal systems.

Normalization is related to *concatenation*, while diagonalization is related to *substitution*. Both kinds of iterability are ruled by complementary context conditions. The context conditions (rules) for normalization is palindromicity. The context rules for substitution are more complicated and had been sketched in earlier papers.

There might be other criteria for normalization and substitution for morphic systems.

Following the distinction of *even* and *odd* palindromes some further distinctions follow naturally: quotations with midpoint centre of different length, interpreted as neutral parts of the quotational process, and quotations without neutral parts.

Even, odd and symmetric, asymmetric, inverse and iterative/accretive modi of quotation.

**Main modi of quotation **

Quotation as *replication*: [1,2,2,3,1,2,2,3]: [head, tail=head],

Quotation as *inversion*: [1,2,2,3,3,2,2,1]: [head, tail=rev(head)],

Quotation as *accretion*: [1,2,2,3,4,2,2,5]: [head, tail=accr(head)].

**Relationships between the modi of quotation**

Repetition or replication is a kind of accretion without differentiation.

Repetition is kind of an inversion of an inversion.

Inversion is a special repetition of the reversed original word.

Repetition is a kind of inversion without reversion.

Accretion is repetition with differentiation.

Accreation is neither iteration nor inversion.

Order(Rep, Inv, Accr): Repetition ⊆ Inversion ⊆ Accretion.

**Again, example Tcontexture 8:**

All 14 possible X"X” palindromic constructions as quotations of X = [1,2,2,3]:

[1,2,2,3,3,1,1,2],

[1,2,2,3,2,3,3,1],

[1,2,2,3,1,2,2,3], [1,2,2,3,3,2,2,1],

[1,2,2,3,1,4,4,3], [1,2,2,3,3,4,4,1]

[1,2,2,3,4,1,1,2]

[1,2,2,3,4,2,2,1], [1,2,2,3,2,3,3,4]

[1,2,2,3,4,5,5,1]

[1,2,2,3,3,2,2,4]

[1,2,2,3,4,2,2,5]

[1,2,2,3,4,5,5,6]

[1,2,2,3,3,4,4,5].

Mirror-image preserving quotation as *inversion*: [1,2,2,3,3,2,2,1].

- ispalindrome [1,2,2,3,3,2,2,1];

val it = true : bool

- palindrome [1,2,2,3,3,2,2,1]; : symmetric palindrome

val it = true : bool

Direct quotation as *repetition*, X”X”: ** **[1,2,2,3,1,2,2,3].

- ispalindrome [1,2,2,3,1,2,2,3];

val it = true : bool

- palindrome [1,2,2,3,1,2,2,3];

val it = false : bool

*Accretive* quotation as asymmetric palindrome: [1,2,2,3,2,3,3,4].

- ispalindrome [1,2,2,3,2,3,3,4];

val it = true : bool

- [1,2,2,3] = tnf[2,3,3,4];

val it = true : bool

**Modi for head=[1,2,2,3]**

repetition: [1,2,2,3,1,2,2,3],

reversion: [1,2,2,3,3,2,2,1],

accretion: [1,2,2,3,2,3,3,1], [1,2,2,3,3,1,1,2],

[1,2,2,3,1,4,4,3],[1,2,2,3,3,4,4,1],[1,2,2,3,4,1,1,2],[1,2,2,3,4,2,2,1],[1,2,2,3,2,3,3,4], [1,2,2,3,3,2,2,4]

[1,2,2,3,4,5,5,1] ,[1,2,2,3,4,2,2,5],[1,2,2,3,3,4,4,5],

[1,2,2,3,4,5,5,6],

Read backwards, accretions are *reductions*: [1,2,2,3,4,5,5,6]: [4,5,5,6] => [1,2,2,3].

Examples for reduction from [4,1,2,3]: [1,2,3,4], [1,1,2,3] and [1,2,1,3]

[1,2,3,4,4,1,2,3],[1,1,2,3,4,1,2,3],[1,2,1,3,4,1,2,3].

Without doubt there are some possibilities of a ‘micro'-classification of the accretive mode of ‘quotation’.

**Accretion as negation**

To build a simple connection to the classical expression of self-reference and contradiction it seems to be appropriete to use a form of a permutative negation over the structure of the quote to replace negation.

Hence, a quotation of [1,2,2,3] combined with ‘accretive’ negation (permutation) becomes [1,4,4,3] with

neg[1,2,2,3] = [1,4,4,3], i.e. 1->1, 3->3 and 2->4.

**Examples**

Micro-classification of accretion

[1,2,2,3,1,4,4,3], [1,2,2,3,3,4,4,1]: tail1=inv(tail2)

[1,2,2,3,4,1,1,2],[1,2,2,3,4,2,2,1]: tail2=accr(tail1).

Balanced replication points: lst(head)=frst(tail)

[1,2,2,**3,3**,1,1,2],[1,2,2,**3,3**,4,4,1], [1,2,2,3,3,2,2,4],[1,2,2,3,3,4,4,5].

Each palindrome is morphogrammatically a *palindromic field* defined by its dynamic ‘source' and its dimensions *reversion*, *repetition* and *accretion*. Single palindromes are members of their palindromic field.

With that, a more intertextual approach is emphazised. The metaphor of a *Möbius strip* could add to its understanding.

**Example**

Part of the palindromic field of palin1 = [1,2,2,3]:

palin1 = [1,2,2,3], palin2 = [3,2,2,1], palin3 = [2,3,3,1], palin4 = [3,1,1,2], palin5 = [1,4,4,3].

Again, the cycles are in no way something like feed-back loops or similar iterations. Without introducing too much complications it shall

be remembered that the ‘head’ of the palindromes, palin_{i}, is not atomically defined in the equivalent way for all ‘turns’ but gets retro-recursively involved by each of its turns at new with the added part palin_{i}.

This is well demonstrated by the ENstructure of the palindromes.

- ENstructure [1,2,2,3]; : EN(palin1)

val it = [[],[(1,2,N)],

[(1,3,N),(2,3,E)],

[(1,4,N),(2,4,N),(3,4,N)]]

: (int * int * EN) list list

- ENstructure[1,2,2,3,3,2,2,1];

val it =

[[],[(1,2,N)],[(1,3,N),(2,3,**E**)],[(1,4,N),(2,4,N),(3,4,N)], : EN(palin1)

[(1,5,N),(2,5,N),(3,5,N),(4,5,**E**)],

[(1,6,N),(2,6,**E**),(3,6,**E**),(4,6,N), (5,6,N)],

[(1,7,N),(2,7,**E**),(3,7,**E**),(4,7,N), (5,7,N),(6,7,**E**)],

[(1,8,**E**),(2,8,N),(3,8,N),(4,8,N), (5,8,N),(6,8,N),(7,8,N)]]

EN(palin1 in [palin1, palin2]) EN(palin2)

- ENstructure[1,2,2,3,1,4,4,5];

val it =

[[],[(1,2,N)],[(1,3,N),(2,3,**E**)],[(1,4,N),(2,4,N),(3,4,N)], : EN(palin1)

[(1,5,**E**),(2,5,N),(3,5,N),(4,5,N)],

[(1,6,N),(2,6,N),(3,6,N),(4,6,N), (5,6,N)],

[(1,7,N),(2,7,N),(3,7,N),(4,7,N), (5,7,N),(6,7,**E**)],

[(1,8,N),(2,8,N),(3,8,N),(4,8,N), (5,8,N),(6,8,N),(7,8,N)]]

EN(palin1 in [palin1, palin5]) EN(palin5)

Thus, EN(palin1 in [palin1, palin2]) != EN(palin1 in [palin1, palin5]).

Hence, the head [1,2,2,3] gets different embedments into the whole palindrome, and therefore different characterizations, by each composed palindrome [palin1, palin_{i}]. The same holds obviously for the ‘tail'.

**Evolution/reduction of palindromic fields**

Palindromic fields are what was metaphorically called the *‘spatiality*’ of (classical) palindromes.

The whole field of palindromes of a contexture, *Contexture(n)*, is defined by the interaction (evolution/reduction) of all possible morphic palindromes generated by the different ‘heads' (sources, morphograms) of a given contexture.

**Example**: **Tcontexture 6**

- Tcontexture 6;

- length it;

val it = 203 : int

List.filter ispalindrome “Contexture 6"

val it =

1. [[**1,1,1**,1,1,1], [1,1,1,2,2,2], :2

2. [**1,1,2,**1,2,2],[1,1,2,2,1,1], [1,1,2,3,4,4],[1,1,2,2,3,3], [1,1,2,3,1,1], : 5

3. [**1,2,1**,2,1,2],[1,2,1,1,2,1],[1,2,1,3,2,3],[1,2,1,1,3,1],[1,2,1,3,4,3],[1,2,1,3,4,3], : 6

4. [**1,2,2**,1,1,2],[1,2,2,2,2,1],[1,2,2,3,3,1],[1,2,2,2,2,3],[1,2,2,3,3,4], : 5

5. [**1,2,3**,1,2,3],[1,2,3,2,3,1],[1,2,3,3,1,2],[1,2,3,3,2,1],[1,2,3,4,1,2],[1,2,3,4,2,1],[1,2,3,1,4,3], : 14

[1,2,3,3,4,1],[1,2,3,2,3,4],[1,2,3,3,2,4],[1,2,3,4,5,1],[1,2,3,4,2,5],[1,2,3,3,4,5],[1,2,3,4,5,6]] : int list list

- length it;

val it = 31 : int

Tcontexture(6) opens up 5 fields of palindromes of length 6.

For the case of *Tcontexture 8* there are interesting types of quotation patterns.

[**1,1,1,1**,1,1,1,1]: homogeneous replication

[1,1,1,1,2,2,2,2]: homogeneous accretion

**[1,2,3,4,**1,2,3,4]: heterogeneous replication

Heterogeneous inversions

[**1,2,3,4**,1,3,2,4],[1,2,3,4,2,1,4,3],[1,2,3,4,2,3,4,1],

[1,2,3,4,3,4,1,2],[1,2,3,4,3,4,2,1],[1,2,3,4,4,1,2,3],

[1,2,3,4,4,2,3,1],[1,2,3,4,4,3,1,2],

[1,2,3,4,4,3,2,1]: direct heterogeneous inversion,...

Heterogeneous accretions

[**1,2,3,4**,5,1,2,3],[1,2,3,4,5,2,3,1],[1,2,3,4,5,3,1,2],[1,2,3,4,5,3,2,1],...

[1,2,3,4,1,5,2,4],[1,2,3,4,2,5,4,1],[1,2,3,4,4,5,1,2],[1,2,3,4,4,5,2,1],...

[1,2,3,4,1,3,5,4],[1,2,3,4,3,4,5,1],[1,2,3,4,4,1,5,3],[1,2,3,4,4,3,5,1],...

[1,2,3,4,2,3,4,5],[1,2,3,4,3,4,2,5],[1,2,3,4,4,2,3,5],[1,2,3,4,4,3,2,5],...

[1,2,3,4,5,6,1,2],[1,2,3,4,5,6,2,1],...

[1,2,3,4,5,1,6,3],[1,2,3,4,5,3,6,1],...

[1,2,3,4,1,5,6,4],[1,2,3,4,4,5,6,1]**,...**

[1,2,3,4,5,2,3,6],[1,2,3,4,5,3,2,6],...

[1,2,3,4,2,5,4,6],[1,2,3,4,4,5,2,6],...

[1,2,3,4,3,4,5,6],[1,2,3,4,4,3,5,6],

[1,2,3,4,5,6,7,1],[1,2,3,4,5,6,2,7],

[1,2,3,4,5,3,6,7],[1,2,3,4,4,5,6,7],

[1,2,3,4,5,6,7,8]: total heterogeneous accretion

The palindrome approach to quotation, self-reference and self-citation, i.e. self-referential cognition/action, is reflecting retro-grade recursive the intrinsic complexity of the “original” pattern of the quote and the modi of the complexity of the process of quotation.

Hence, the general, sentence-oriented formula for normalization <N"N">, becomes <compl_{i}(N) compl_{j}"N")>.

compl(N"N") = (compl_{i}(N), compl_{j}("N")), 1<=i,j>=m, m=length of palindrome.

The sentence-oriented formula <N"N"> has the morphic complexity-pattern [1,1]. It might be augmented in meta-language considerations to [1,2].

**Classical modeling with Push-Down automta for even and odd palindromes**

ftp://ftp.cs.kun.nl/pub/CompMath.Found/12TA7.pdf**Examples**

**- ENstructure[1,2,2,3];**

val it =

[[],

[(1,2,N)],

[(1,3,N),(2,3,E)],

[(1,4,N),(2,4,N),(3,4,N)]]

: (int * int * EN) list list

**ENstructure automaton table for MorphoFSM [1,2,2,3] **

**- ENstructure [1,2,2,3,3,1,1,2];**

val it =

[[],

[(1,2,N)],

[(1,3,N),(2,3,**E**)],

[(1,4,N),(2,4,N),(3,4,N)],

[(1,5,N),(2,5,N),(3,5,N),(4,5,**E**)],

[(1,6,**E**),(2,6,N),(3,6,N),(4,6,N),(5,6,N)],

[(1,7,**E**),(2,7,N),(3,7,N),(4,7,N),(5,7,N),(6,7,**E**)],

[(1,8,N),(2,8,**E**),(3,8,**E**),(4,8,N),(5,8,N),(6,8,N),(7,8,N)]]

: (int * int * EN) list list

**ENstructure automaton table for MorphoFSM [1,2,2,3,3,1,1,2] **

**- ENstructure[1,2,2,3,4,5,5,6];**

val it =

[[],

[(1,2,N)],

[(1,3,N),(2,3,**E**)],

[(1,4,N),(2,4,N),(3,4,N)],

[(1,5,N),(2,5,N),(3,5,N),(4,5,N)],

[(1,6,N),(2,6,N),(3,6,N),(4,6,N),(5,6,N)],

[(1,7,N),(2,7,N),(3,7,N),(4,7,N),(5,7,N),(6,7,**E**)],

[(1,8,N),(2,8,N),(3,8,N),(4,8,N),(5,8,N),(6,8,N),(7,8,N)]]

: (int * int * EN) list list

**ENstructure automaton table for MorphoFSM [1,2,2,3,4,5,5,6]**

Creative mirror literature (Oskar Panizza) must be full of unconventional quotations on all levels of the linguistic tectonics.

See *“On Self-referential Sentences”* in: Douglas R. Hofstadter, Metamagical Themas.", 1981

Kenny's Overview of Hofstadter's Explanation of Gödel's Theorem

http://www4.ncsu.edu/unity/lockers/users/f/felder/public/kenny/papers/godel.html

Henry W. Pickford, Heimrad Bäcker’s “System nachschrift” and the Philosophy of Quotation, 2008*"Thus Bäcker writes of quotation as *“deckungsgleiche Wiedergabe”*: “ich erfasse die Möglichkeit, durch die isolierung der reihe und ihre deckungsgleiche Wiedergabe eine konkretion zu bilden: konkret im Hinblick auf die isolierte form, konkret aber auch im Blick auf den Vorgang jener nacht und sein Tremedum” (“Mauthausen” 128).*

http://gsll.colorado.edu/sites/default/files/images/stories/facultymedia/backer.pdf

Steven Rendall, Translation, Quotation, Iterability *"Iterability, the possibility of repetition, is that which, within any utterance, exceeds the utterance as such, escapes any given spatial, temporal, or intentional context, and points toward the possibility of saying (writing, reading) "the same thing" in an infinite *variety* of other contexts. **For Derrida, iterability is a constitutive feature of language; all language is always in principle iterable, and a word that could not be repeated would simply not be a word.*

*discovered in quotation the power, not to preserve, but to purify, to rip out of context, to destroy; the only power in which there remains any hope that something will outlast this era -- precisely because it has been wrenched out of it.*

http://www.erudit.org/revue/TTR/1997/v10/n2/037303ar.pdf

**Analytic theories of quotation**

Jan Schreiber, A Bibliography on Quotation and the Use-Mention Distinction (2008)

http://www.uni-due.de/~gph120/Bib/Bibliography.html

"The key property of Turing machines, and all other equivalent models of computation, is *universality*: there is a single Turing machine U that is capable of simulating any other Turing machine -- even those with vastly more states than U . In other words, one can think of U as a *“Turing machine interpreter,”* written in the language of Turing machines.

"This capability for self-reference (the language of Turing machines is expressive enough to write an interpreter for itself ) is the source of the surprising versatility of Turing machines and other models of computation.”

http://www.cs.cornell.edu/courses/cs4820/2012sp/handouts/turingm.pdf

The analogy to diagonalization/normalization continues with the famous self-application for universal Turing Machines UTM:

< UTM as a *“Turing machine interpreter,”* written in the language of Turing machines >.

**Scheme**

Turing machine description,

Turing machine interpreter,

Turing machine interpreter of “Turing machine description of".

**The mechanism of the analogy**

"The proof proceeded in two steps.

Step 1 is to suppose (for *reductio ad absurdum*) that the sequence S is a complete enumeration of all the members of M .

Step 2 is to employ the *diagonal method* to generate a sequence that belongs to M but does not appear on the list S.

"In other words, they share the same general scheme by which a contradiction results from an enlargement of a set by *constructed-from-the-outside* entities.” (Tworak)

**Strategy***Step 1*

Accept the dominance of logic. (Holds for direct and indirect proofs.)*Step2*

Apply creatively the *ad hoc* trick(of diagonalization or normalization).*Step 3*

Be happy to have constructed on the base of the two presumptions a logical *contradiction* that accepts the *“reduction ad absurdum”* principle.*Step4*

Take your trophy home until it is too late.

**Subversion: to-do list**If you are not happy with this traditionally proved strategy,

firstly, ask for the legitimacy of the presupposition of the dominant logic (even tradition offers different approaches).

Then, study with praxeological strictness what exactly happens step-by-step by the

Don’t be perplexed, there is no reason to freak out, if your description of the game leads you beyond the narrowness of your learned rationality.

This opens up a new job to do: elaborate the game of

If you feel forced to move back home, it will be just a simple exercise to reduce and resume the structural complexity under the established umbrella. And you will be save again.

**Comment**

Don’t forget that from a *praxeological* point of view, a number is a number if and only if it is defined by its rules of construction, and not by its ‘objectional’ product (result) that is denying any history of its construction. Hence, the saying that all numbers are listed in the table is what it is, the list of all numbers defined by the given procedure. And nothing else, not more and not less.

A number defined by *diagonalization* has a totally different definition than the numbers of the list and there is therefore no surprise that this totally differently defined number is not a member of the list of the numbers defined by the first definition of numbers. The numbers of the list of the listed numbers are not defined by the “trick” (or reflection) of diagonalization over the listed numbers defined by the first definition of numbers.

Hence, the* paradox* that there is a number not entailed in the list of all listed numbers does the job only if its praxeological properties are denied and only the ‘object’ number is accepted as a number, i.e. as a numeral - and nothing else. With that we might speak about “all numbers" (independently of their definition).

If the process of the definition of the number is conceived and accepted as crucial, the whole surprise and its paradoxical stumbling falls apart.

There are simply just two kinds of numbers defined in Cantor’s game: the *listed* numbers and the *diagonal* number(s) of the listed numbers. After that, a logical yes/no-comparison follows.

The concept of a “diagonal number” is therefore relative. There is not just one diagonal number but infinite many diagonal numbers depending on the variable definition of the ‘diagonal’ of the listed numbers.

Other constructions are freely possible too.

Again, who is afraid of this* praxeological *approach of two discontexturally different natural number series (NNS) and also doesn’t want to take the burden of a new step of formalization, always has the possibility to freeze the process and to turn back to the text-book knowledge.

**Short double check: the construction of Cantor’s Diagonal Method following Zbigniew** **Tworak**

Theorem 1. *No denumerable sequence of elements of the set M contains all elements of this set. *

*Proof*. Let S = <E_{1} , E_{2} , . . . , E_{j} , . . . > be any denumerable inﬁnite sequence of members of the set *M* . That is *S* is sequence of sequences. The table below is an illustration of this:

"The sequence E_{0} has following properties: (a) it belongs to *M* (because its each element is either *m* or *w*), (b) for a natural number k, *E*_{0} != *E*_{k} (*E*_{0} differs from *E*in the ﬁrst digit, from *E*_{2} in the second digit, and so on), i.e. E_{0} does not appear on the list *S*. Thus the supposition that *S* is a complete enumeration of all the members

of *M* is false. In consequence, the set *M* is *non-denumerable*.”

"The *proof* proceeded in two steps. *Step 1* is to suppose (for *reductio ad absurdum*) that the sequence S is a complete enumeration of all the members of *M* . *Step 2* is to employ the *diagonal method* to generate a sequence that belongs to *M* but does not appear on the list *S*.

"To this end we take into consideration the diagonal sequence <a_{11}, a_{22} , . . . , a_{kk}, . . . > and generate a new sequence E_{0} = <b_{1}, b_{2}, . . . , b_{k}, . . . >, the anti-diagonal sequence, as follows: if a_{kk} = m then b_{k} = w, and if a_{kk} = w then b_{k} = m.

"The two tables below are picturing this procedure:

"(The tables above show why this method is called the *diagonal method* : we have constructed a new sequence by changing each element on the diagonal.)”

(Tworak, Logic and Logical Philosophy, Volume 15 (2006), 39-67)

http://www.logika.umk.pl/llp/151/151-3.pdf

**Further elaborations**

Noson S.Yanofsky, A Universal Approach to Self-Referential Paradoxes, Incompleteness and FixedPoints, 2003

http://xxx.lanl.gov/pdf/math/0305282v1.pdf

"By the *norm* of an *expression* X, we shall mean the expression X(X) -- e.g. the norm of P~ is P~(P~). By a *sentence*, we mean any expression of one of the following four forms (X is any expression):

(1) P(X)

(2) PN(X)

(3) ~ P(X)

(4) ~ PN(X)

Informally, P stands for "printable"; N stands for "the norm of” and ~ stands for "not". And so we define P(X) to be true if (and only if) X is printable. We define PN(X) to be true if the norm of X is printable. We call ~ P(X) true iff (if and only if) X is not printable, and ~ PN(X) is defined to be true iff the norm of X is not printable.”

Print morphogram [M]: print([M])

print norm of [M]: print(norm([MG]))

norm of [MG] : [MG]"[MG]" : quotation

norm of [MG]: repetition of [MG]: R*[MG] = [MG]"[MG]".

Print([M])

print(norm([M]))

non(print([M]))

non(print(norm([M])))

*Also if PR*X is printable, it is true, which means that XX must be printable. Now, suppose that X is printable; does it necessarily follow that P*X is printable? No; if X is printable then P*X is certainly true, but we are not given that the machine is capable of printing all true sentences, but only that the machine never prints any false ones.*

**Corresponcences**

"(1) P*X is true if X is printable.” This corresponds to: [MG]*[MG] is palindromic if [MG*MG] is realizable.

"(2) PR*X is true if XX (the repeat of X) is printable.” This sentence corresponds to the morphogrammatic situation of

[MG]*[MG] is palindromic if [MG*MG] is realizable.

PR*X is true ≅ [MG]*[MG] is palindromic

if XX is printable ≅ [MG*MG] is realizable.

"if X is printable, (PX), then P*X is certainly true" ≅ “if [MG] is realizable then [MG*MG] is palindromic.

A morphogrammatic system (machine, grammer) is producing morphograms.

Palindromes are special morphograms of the morphogrammatic system (scripture).

To interpret is to unquote. Hence, interpretation and quotation, I and Q, are symmetric operations on sentences and programs.

Because morphograms are not sequences there is no need for negation to mark the difference between the results of the quote/interpret mechanism. The morphogrammatic mechanism of quotation and interpretation happens in the framework, i.e. under the conditions of palindromicity.

**Description of the procedure**

Start with a morphogram, G^{1}.

Build a morphic palindrome, G based on the start morphogram, G by quotation, Q of that morphogram, G G^{1}"G.

Interprete, I^{2}, this palindromic morphogram, G^{2}, I^{2}(G

Note the quoted part of the interpreted palindromic morphogram, G by “G.

Start with a morphogram, G equivalent to the morphogram G^{1}.

Build a morphic palindrome, G based on the start morphogram, G^{2} by quotation, Q^{2}, Q^{2}(G.

Interprete, I^{3}, this palindromic morphogram, G^{2}, I^{3}(G

Note the quoted part of the interpreted palindromic morphogram, G by “G^{2}".

Compare both results of the quotation/interpretation process: G.

Note the difference (differentiation, distinction) between G

**Result**

There is no logical contradiction between “G but a *difference* that is separating both morphic palindromes.

As morphograms, both quotations are morphogrammatically equivalent, G^{1}=_{MG} G but semiotically (symbolically) they are different. Nevertheles, the compound morphograms G^{1} and G^{3} are morphogrammatically different.

**Differen****t strategies**

Proof of the Fixed Point Theorem by Barendregt:

Thus, the full scheme of the Fixedpoint theorem is now marked by its numbers of occurrence of the term “W” in the application. Following Wittgenstein’s advise that the meaning of a term is defined by its *use*, at least 6 different use of the term “W” are to distinguish in Barendregt’s proof.

With Barendregt’s formula for the construction of the *Fixed Point Theorem*, the term “W” is used 6 times and therefore we have to check all its possible ways of use. The comfortable excuse to use the distinction of a syntactic and a semantic or of an object- and meta-language use of the terms, say ‘use’ and ‘mention’, to avoid further analysis, isn’t of leading importance in this case.

There are at least 4 possible types of modeling:

1. identitive *equality *(semiotics),

2. kenomic *equivalence *(kenogrammatics),

3. morphic *similarity *(morphogrammatics),

4. metamorphic *bisimilarity* (metamorphosis).

http://memristors.memristics.com/Church-Rosser%20Morphogrammatics/Church-Rosser%20in%20Morphogrammatics.html

http://www.thinkartlab.com/pkl/lola/poly-Lambda_Calculus.pdf

W1≡ λx.F(xx), X ≡ W2W3, λx.F(xx)W4, F(W5W6).

**Example0:*** Identity* : type[1,1,1,1,1,1]

The most obvious use of “W” is the use in the mode of identity:

Thus, for all i, j, Wi, Wj: Wi ≡ Wj, with i,j∈{1, ...,6} and equal length: length(Wi) = length( Wj), i.e. length(+).

The kenogrammatic equivalence, MG (+), is automatically accepted by the semiotic equality, SEM(+).

Hence,

∀i, j: Wi, Wj: Wi ≡ Wj, with i,j∈{1, ...,6}

=>

X 1 ≡ W1W1 ≡ λx.F(xx)W1 ≡ F(W1W1) ≡ FX1.

That is the classical case of identity:

X ≡ WW ≡ λx.F(xx)W ≡ F(WW) ≡ FX.

=> X ≡ FX.

*Logical interpretation*

X ≡ WW ≡ λx.non(xx)W ≡ non(WW) ≡ nonX.

=> X ≡ nonX.

{X, nonX}∈ Contradiction.

*Morphogrammatic palindromic interpretation*

W1 ≡ [1,2,2,3],

W1W1 = [1,2,2,3,1,2,2,3] = F(W1W1) = F[1,2,2,3,1,2,2,3] : replication.

=> X ∈ palin ≡ F(X) ∈ palin.

F = perm : perm(W1W1) = [3,2,2,1,3,2,2,1]

=> X ≡_{keno} perm(X)

**Scheme: **W1 ≡ λx.F(xx), X ≡ W2W3, λx.F(xx)W4, F(W5W6).

**Example1**: type[1,1,2,4,1,3]: kenomic *equivalence*

W1,2,3,4,5,6

W1,1,2,4,1,3.

λx.F(xx): palindromic replication (retro-grade recursive), i.e.

W2 is retro-recursively depending on W1, (and is thus not just a identive replication of W1) and on the palindromicity of the composition of W1 and W2 to W1W2.

W1≡ λx.F(xx), X1 ≡ W1W2, λx.F(xx)W1, F(W1W3)= F(X3).

W1 ≡ [1,2,2,3],

W2 ≡ [3,2,2,1], reversion of W1,

W3 ≡ [1,4,4,3], accretion of W1,

X1 ≡ [1,2,2,3,3,2,2,1] = W1W2,

X3 ≡ [1,2,2,3,1,4,4,3] = W1W3.

W1 ≡ λx.F(xx), X1 ≡ W1W2, λx.F(xx)W1, F(W1W3):

W1 ≡ λx.F(xx)

X1 ≡ W1W2 ≅_{keno} λF.(xx)W1 ≡ F(W1W3) ≅_{keno} FX3

=> X1 ≅_{keno} FX3,

=> comparison: comp(X1, FX3) = separation, palindromic.

**Comment**

W2 and W3 are morphic ‘replications’ of W1. Hence, they are representing morphogrammatically different ‘quotations’ of W1.

W1, W2 and W3 are semiotically different, SEM (-), but morphogrammatically equivalent:

w_{12}: MG (+): W1 =_{MG} W2,

w_{13}: MG (+): W1 =_{MG} W3,

w_{23}: MG (+): W2 =_{MG} W3.

Semiotic identity, SEM(+), is requiered for identitive equality and identitive symmetric palindromes.

Also W2 and W3 are quotations of W1, the compositions X1 = W1W2 and X2 = W1W3 are morphogrammatically

not equivalent: X1X2: MG(-): X1 !=_{MG}X2.

But both composed morphograms, X1 and X2, are palindromic: X1, X2 ∈ Palin.

Hence, the comparison of X as X1 and X as X3 with FX3, comp(X1, FX3), is not a negation but marks a *separation*.

Because there are more different quotations of W1, the mapping between W1 and its quotations is not one-to-one but one-to-many.

The kenomic equivalence is founded in the structural, i.e. kenomic equivalence of the parts W2 and W3. (This is not anymore the case for the mode of kenomic *similarity.*)

Nevertheless, all the considerations in the mode of kenomic equivalence are based on the *same-length presupposition* of the morphograms: length(X1, X3) = (+). (This is not anymore the case for the mode of the metamorphosis of kenomic *bisimilarity *where the length of X1 and X2 might differ*.*)

Another simple and balanced example is given by:

**Example1’: [1,1,1; 4,4,4]**

W1,2,3,4,5,6

W1,1,1,4,4,4.

W^{1}≡ W^{2} ≡ W^{3}, W^{4} ≡ W^{5} ≡ W^{6}

W^{1} ≡ x. F(xx), X ≡ W^{1}W^{1}, x. F(xx)W^{4} , F(W^{4}W^{4}):

W^{1} ≡ x. F(xx)

X^{1} ≡ W^{1}W^{1} ≅_{keno}x. F(xx)W^{4} ≡ F(W^{4}W^{4}) ≅_{keno} FX^{4}

=> X^{1} ≅_{keno} FX^{4}.

http://memristors.memristics.com/semi-Thue/Notes%20on%20semi-Thue%20systems.pdf

http://memristors.memristics.com/Church-Rosser%20Morphogrammatics/Church-Rosser%20in%20Morphogrammatics.html

**Example2**: type[1,1,2,4,4,5]: palindromic *similarity*

W1,2,3,4,5,6

W1,1,2,4,4,5.

λx.F(xx): palindromic replication (retro-grade recursive)

W1 ≡ λx.F(xx), X1 ≡ W1W2, λx.F(xx)W4, F(W4W5) = F(X3).

W1 ≡ [1,2,2,3],

W2 ≡ [3,2,2,1],

W4 ≡ [1,2,3,1],

W5 ≡ [2,3,1,2],

X1 ≡ [1,2,2,3,3,2,2,1] = W1W2, (inversion),

X3 ≡ [1,2,3,1,2,3,1,2] = W4W5, (accretion).

W1 ≡ λx.F(xx), X1 ≡ W1W2, λx.F(xx)W4, F(W4W5):

W1 ≡ λx.F(xx)

X1 ≡ W1W2 ≅_{keno} λF.(xx)W1 ≡ F(W4W5) ≅_{keno} FX3

=> X1 ≅_{keno} FX3,

=> comparison: comp(X1, FX3) = separation, palindromic.

**Example3**: type[1,1,1;4;5;6;7]: palindromic *bisimilarity*

Morphic bisimilarity abandons the security of the process of substitution/normalization established by the presumption in charge for the identity, the equivalence and the similarity option, of the same “length” of the substituted terms.

Hence, the situation “W^{1} ≡ x. F(xx)" might be replaced by the *bisimilar* term “x. F(xxx)" delivering not WW but WWW with the abstraction W^{1}W^{1} ≅_{bis} W^{5}W.

W^{1}≡ W^{2} ≡ W^{3}, W^{4}, W^{5}, W^{6}, W^{7}

W^{1} ≡ x. F(xx)

X^{1} ≡ W^{1}W^{1} ≅_{bis}x. F(xxx)W^{4} ≅_{sim} F(W^{5}W) ≅_{sim} FX

=> X^{1} ≅_{bis} FX.

**Procedures**

*Search/selection*

*Construction*

**w1∉ palin => {****,** **}:**

- ispalindrome [1,2,2,2,1,2,2,2]; , w!=palin ??

val it = **false** : bool

- ispalindrome[1,2,2,2,2,2,2,1]; : symmetric palindrome

val it = true : bool

- ispalindrome [1,2,2,2,1,1,1,2];

val it = true : bool

- ispalindrome[1,2,2,2, 1,1,1,3]; ?? test=no

val it = **false** : bool

- ispalindrome[1,2,2,2,2,2,2,3];

val it = true : bool

- ispalindrome[1,2,2,2, 3,3,3,2]; ?? test=no

val it = **false** : bool

- ispalindrome[1,2,2,2,3,3,3,1];

val it = true : bool

- ispalindrome[1,2,2,2,3,3,3,4];

val it = true : bool

AG([1,2,2,2])+1 = 4: {1,2,3,4}

iter : [1,2] -> [1,2]

accr_{1}: [1,2] -> [2,1],

accr_{2}: [1,2] -> [1,3], ?

accr_{3}: [1,2] -> [3,1],

accr_{4}: [1,2] -> [3,2], ?

accr_{5}: [1,2] -> [3,4].

**w1∈ palin => {****, ** **}:**

- ispalindrome[1,2,2,1,1,2,2,1]; , symmetric palindrome

val it = true : bool

- ispalindrome [1,2,2,1,2,1,1,2];

val it = true : bool

- ispalindrome[1,2,2,1,1,3,3,1];

val it = true : bool

- ispalindrome [1,2,2,1, 2,3,3,2]; ?

val it = **false** : bool

- ispalindrome[1,2,2,1, 3,1,1,3]; ?

val it = **false** : bool

- ispalindrome [1,2,2,1,3,2,2,3];

val it = true : bool

- ispalindrome [1,2,2,1,3,4,4,3];

val it = true : bool

**- kconcat**[1,2,2,1][1,2,2,1];

val it =

[[1,2,2,1,**1,2,2,1**],

[1,2,2,1,**2,1,1,2**],

[1,2,2,1,**1,3,3,1**],

[1,2,2,1,3,1,1,3], ??

[1,2,2,1,2,3,3,2], ??

[1,2,2,1,**3,2,2,3**],

[1,2,2,1,**3,4,4,3**]] : int list list

In the *additive* setting of iteration, kconcat[1,2,2,1][1,2,2,1], the direct repetition (replication) is guaranteed by the unit element of the ‘addition’, i.e. by the definition of the palindromic construct of replication. Because the concatenation kconcat[1,2,2,1][1,2,2,1] is accretive, not all concatenations are also palindromic. Also the accretion of the palindrome is preserving locally its palindromic structure, the concatenation of palindromes is not generally palindromic.

**- kmul[**1,2,2,1][1,2,2,1];

val it =

[[1,2,2,1,2,1,1,2,2,1,1,2,1,2,2,1],[1,2,2,1,3,1,1,3,3,1,1,3,1,2,2,1],

[1,2,2,1,2,3,3,2,2,3,3,2,1,2,2,1],[1,2,2,1,3,4,4,3,3,4,4,3,1,2,2,1]]

: int list list

ispalindrome?

[[1,2,2,1,**2,1,1,2**,2,1,1,2,**1,2,2,1**],[1,2,2,1,**3,1,1,3**,3,1,1,3,1,2,2,1],

[1,2,2,1,**2,3,3,2**,2,3,3,2,1,2,2,1],[1,2,2,1,**3,4,4,3**,3,4,4,3,1,2,2,1]]

: int list list

In the *multiplicative* setting of iteration, kmul[1,2,2,1][1,2,2,1], the direct repetition (replication) is guaranteed by the unit element of the ‘multiplication’. This replication is located in the context of the complexity of the multiplicand. Hence, the replication is embedded in the general concept of iteration by multiplication.

- ispalindrome[1,2,3,4,1,2,3,4];

val it = true : bool

- ispalindrome[1,1,2,1,1,2,1,1];

val it = true : bool

- ispalindrome [1,1,2,1,2,3,2,2]; ??

val it = **false** : bool

- ispalindrome[1,1,2,1,3,4,3,3];

val it = true : bool

- ispalindrome[1,1,2,1,1,3,1,1];

val it = true : bool

- ispalindrome [1,1,1,2,2,1,1, 1,1,2,2,1,1,1];

val it = true : bool

- ispalindrome [1,1,1,2,2,1,1,3,3,4,4,3,3,3];

val it = true : bool

Iterative replication of the palindrome [1,1,1,2,2,1,1,3,3,4,4,3,3,3]:

- ispalindrome

[1,1,1,2,2,1,1,3,3,4,4,3,3,3,

1,1,1,2,2,1,1,3,3,4,4,3,3,3,

1,1,1,2,2,1,1,3,3,4,4,3,3,3,

1,1,1,2,2,1,1,3,3,4,4,3,3,3,

1,1,1,2,2,1,1,3,3,4,4,3,3,3];

val it = true : bool

**Tim Budd’s symmetric palindromes in C**

bool palindrome_type1 (string & aString)

//* test aString is a type 1 palindrome *

{

string temp; // *declare temporary *

temp = aString; // *duplicate argument *

reverse (temp.begin(), temp.end()); //* reverse *

return temp == aString; // *test for equality *

}

Three step process:

• Duplicate string (uses assignment)

• Reverse duplicate (uses generic algorithm)

• Tests for equality (uses relational operator)

Tim Budd, Data Structures in C++, Chapter 7

http://www.eecis.udel.edu/~saunders/courses/220/04s/buddslides/ch07slide.pdf

Classical or formalistic modeling of the formula follows naturally the *linear* composition of its parts. The composition mode is identity that is enforcing a linear order in the domain of the identity system.

The different modi of similarity and especially the mode of metamorphosis are not anymore organized in a linear order. Because of their ‘discontexturality’, their order is ruled by mediation and formalized by the extended concept of bifunctoriality.

All three levels of the formula correspond to a different process of reflection. The presentation as a bifunctorial complexion of the formula is therefore the result of a *reflectional* or *praxeological* thematization of the different activities that defines the whole of the formula. In this sense it differs conceptually from a mathematical and formalistic approach of thematization (thinking).

**Praxeological analysis**

Contexture Cont1 contains the formulation of path1 with W1, W2 and X1.

Contexture Cont2 contains the formulation of path2 with W4, W5 and X3.

Contexture Cont3 contains the comparison of Cont1 and Cont2 with X1 and X3.

Bifunctoriality for the identity example

Bifunctoriality for example 1:

Bifunctoriality for example 2:

**Discontexturality**

From a polycontextural point of view, complexity, i.e. polyconteturality is first. Simplicity is a late product of simplification. Domains, contextures or fields are at first considered as discontextural. There is at first no common ground or umbrella to collect the differences into one family and home of sameness or identity.

Full discontexturality without any mediation is the other extreme. To develop and understand a living tissue, different interactions of mediation and separation have to be understood.

Hence, the inverse strategy has to be realized: Not from the simplest scenario to the complexion by deconstructive ‘reverse engineering’ but from the complex constellation to the reduced cases of simplification.

Because scientific tradition is not offering a complex start, an establishment of complexity has first to start with the approved approaches of scientific simplicity. This strategy might be called “deconstructive re-engineering".

Thereafter, the journey has to elaborate a *double* move from type[1,1,1,1,1,1] to type[1,2,3,4,5,6] with different length and back from type[1,2,3,4,5,6] to type[1,1,1,1,1,1]:

*Identity*: type[1,1,1,1,1,1]

The most obvious use of “W” is the use in the mode of *identity*:

Thus, for all i, j, Wi, Wj: Wi ≡ Wj, with i,j∈{1, ...,6},

and length(W_{i}) = length(W

to

*Metamorphosis*: type[1,2,3,4,5,6]

The most obvious use of “WW” is the use in the mode of *metamorphosis*:

Thus, for all i, j, Wi, Wj: Wi !≡ Wj, with i,j∈{1, ...,6}.

and length(W_{i})!= length(W

and back from *Metamorphosis*: type[1,2,3,4,5,6] to *Identity*: type[1,1,1,1,1,1].

A similar game to the Lambda Calculus is well prepared with the even more direct formalization of Combinatory Logic.

"Speciﬁcally, we consider various properties that the *quote* ⌈·⌉ must satisfy as a function from Λ to Λ. The most important of these is the existence of a deﬁnable left inverse: a term E, called the *evaluator* for ⌈·⌉, that satisﬁes E⌈M⌉ = M for all M ∈ Λ. Usually the *quote* ⌈M⌉ encodes the syntax of a given term, and the *evaluator* proceeds by analyzing the syntax and reifying all constructors by their actual meaning in the calculus.

"A coding ⌈·⌉ is a map from C into itself. A term ⌈M⌉ is then called *the quote of M*. Since the primary use of coding consists of manipulating the syntax of terms, most of the properties that we investigate will concern existence of combinators relating the structure of a term to that of its quote. Among these, most attention is given to the *Constructor* and *Destructor* axioms. Roughly, the former allows one to obtain the quote of a term from the quotes of its subterms. The latter is dual: it breaks up the term into its subterms (with respect to the quote).”

"Deﬁnition 4. (Coding Axioms) Let ⌈·⌉ : C -> C . We say ⌈·⌉ satisﬁes axiom X from among those below if there exists a combinator X with the stated property.

Andrew Polonsky, Axiomatizing the Quote

http://subs.emis.de/LIPIcs/volltexte/2011/3249/pdf/36_.pdf

ftp://ftp.cs.kun.nl/pub/CompMath.Found/LC1.pdf, ftp://ftp.cs.kun.nl/pub/CompMath.Found/LC3.pdf

The paper *“Gödel Games: Cloning Gödel’s Proofs”* was not considered with *internal* structure of the formulas involved in the process of quotation and interpretation (evaluation).

The difference to this study lies in the morphogrammatic interpretation of the “objects” as morphic palindromes and not (yet) in any syntactic differences of composed formulas like it is presented by the paper* “Axiomatizing the Quote”* of Andrew Polonsky.

Hence, the main constituents of the construction are just the operation of *quotation* and *evaluation*: ⌈·⌉ : C -> C and

The quotation operator ⌈·⌉ shall be replaced by Q, and the evaluator E by the interpreter I, hence “” becomes I(Q(M))= M. And “” is replaced by B(Q(M)) = Q(Q(M)).

Of special interest for the highly reduced approach is also A: A(Q(M)Q(N)) = Q(MN), where the retro-grade concatenation of MN enters the game.

**Polycontexturality**

Q : C --> C

C =

The general model for morphic self-reference, formalized by normation/diagonalization, gets a specification by the categories of

replication,

inversion,

accretion

ruled by morphic palindromicity.

Morphic palindromicity holds for all kinds of kenogrammatic scriptures. Morphic scriptures are the scriptures of trito-, deutero- and proto-structure of kenogrammatics.

Further *graphematical* scriptures are, e.g., the *indicational* (G. Spencer-Brown) and the *Mersenne* differentiational scripture as sketched in previous papers.

N ∈ morphic scripture

N"N” : (replication, inversion, accretion) modulo palindromicity ()

The classical version of self-referentiality is realized as an iterative repetition inscribed in identitive semiotic (symbolic) formal systems (Smullyan).

Indicational writing system:

re-entry as an iteration of the same in the mode of identity.

**kconcat [1,2,2,3][1,2,2,3]**

- length(kconcat [1,2,2,3][1,2,2,3]);

val it = 34 : int

*Morphogram*s

[[1,2,2,3,1,2,2,3],[**1,2,2,3,1,3,3,2**],[1,2,2,3,2,1,1,3],[1,2,2,3,2,3,3,1],

[1,2,2,3,3,1,1,2],[1,2,2,3,3,2,2,1],[1,2,2,3,1,2,2,4],[1,2,2,3,1,4,4,2],

[1,2,2,3,2,1,1,4],[1,2,2,3,2,4,4,1],[1,2,2,3,4,1,1,2],[1,2,2,3,4,2,2,1],

[1,2,2,3,1,3,3,4],[1,2,2,3,1,4,4,3],[1,2,2,3,3,1,1,4],[1,2,2,3,3,4,4,1],

[1,2,2,3,4,1,1,3],[1,2,2,3,4,3,3,1],[1,2,2,3,1,4,4,5],[1,2,2,3,4,1,1,5],

[1,2,2,3,4,5,5,1],[1,2,2,3,2,3,3,4],[1,2,2,3,2,4,4,3],[1,2,2,3,3,2,2,4],

[1,2,2,3,3,4,4,2],[1,2,2,3,4,2,2,3],[1,2,2,3,4,3,3,2],[1,2,2,3,2,4,4,5],

[1,2,2,3,4,2,2,5],[1,2,2,3,4,5,5,2],[1,2,2,3,3,4,4,5],[1,2,2,3,4,3,3,5],

[1,2,2,3,4,5,5,3],[1,2,2,3,4,5,5,6]]

*Non-palindrome, one from 20*

- ispalindrome [1,2,2,3,1,3,3,2];

val it = false : bool

palindromes:

[1,2,2,3,**1,2,2,3**], [1,2,2,3,**3,2,2,1**]

[1,2,2,3,**1,4,4,3**], [1,2,2,3,**3,4,4,1**]

*Palindromes:*

List.filter ispalindrome "kconcat [1,2,2,3][1,2,2,3]":

val it =

[[1,2,2,3,1,2,2,3],[1,2,2,3,2,3,3,1],[1,2,2,3,3,1,1,2],**,**

[1,2,2,3,4,1,1,2],[1,2,2,3,4,2,2,1],[1,2,2,3,1,4,4,3],[1,2,2,3,3,4,4,1],

[1,2,2,3,4,5,5,1],[1,2,2,3,2,3,3,4],[1,2,2,3,3,2,2,4],[1,2,2,3,4,2,2,5],

[1,2,2,3,3,4,4,5],[1,2,2,3,4,5,5,6]] : int list list

- length it;

val it = 14 : int

*Symmetric palindrome*

val it = [[1,2,2,3,3,2,2,1]] : int list list

**reverse tail palindromes: **

[1,2,2,3,**1,2,2,3**], [1,2,2,3,**3,2,2,1**]

[1,2,2,3,**1,4,4,3**], [1,2,2,3,**3,4,4,1**]

**Modi for palindromes with head=[1,2,2,3] out of kconcat [1,2,2,3][1,2,2,3]:***replication*: [1,2,2,3,1,2,2,3], : palin1+palin1*inversion*: [1,2,2,3,3,2,2,1], : palin1+ rev(palin1)*accretion*: [1,2,2,3,2,3,3,1],[1,2,2,3,3,1,1,2], : palin1+accr(palin1)

[1,2,2,3,1,4,4,3],[1,2,2,3,3,4,4,1]

[1,2,2,3,4,1,1,2],[1,2,2,3,4,2,2,1], [1,2,2,3,2,3,3,4],

[1,2,2,3,4,5,5,1],[1,2,2,3,3,2,2,4],[1,2,2,3,4,2,2,5],

[1,2,2,3,4,5,5,6],[1,2,2,3,3,4,4,5].

**kmul[1,2,2,3][1,2,2,3];**

- length it;

val it = 588 : int

List.filter ispalindrome “kmul[1,2,2,3][1,2,2,3]":

val it =

[[1,2,2,3,2,3,3,1,2,3,3,1,3,1,1,2],[1,2,2,3,3,1,1,2,3,1,1,2,2,3,3,1],

[1,2,2,3,2,1,1,4,2,1,1,4,3,4,4,1],[1,2,2,3,2,1,1,4,2,1,1,4,5,4,4,1],

[1,2,2,3,2,4,4,1,2,4,4,1,3,1,1,2],[1,2,2,3,2,4,4,1,2,4,4,1,5,1,1,2],

[1,2,2,3,4,1,1,2,4,1,1,2,3,4,4,1],[1,2,2,3,4,1,1,2,4,1,1,2,5,4,4,1],

[1,2,2,3,3,1,1,4,3,1,1,4,4,5,5,1],[1,2,2,3,4,3,3,1,4,3,3,1,3,5,5,4],

[1,2,2,3,4,1,1,5,4,1,1,5,2,3,3,1],[1,2,2,3,4,1,1,5,4,1,1,5,3,6,6,1],

[1,2,2,3,4,1,1,5,4,1,1,5,6,7,7,1],[1,2,2,3,4,5,5,1,4,5,5,1,2,3,3,4],

[1,2,2,3,4,5,5,1,4,5,5,1,3,6,6,4],[1,2,2,3,4,5,5,1,4,5,5,1,6,7,7,4],

[1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,1],[1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5],

[1,2,2,3,3,4,4,2,3,4,4,2,2,3,3,1],[1,2,2,3,3,4,4,2,3,4,4,2,2,3,3,5],

[1,2,2,3,4,3,3,2,4,3,3,2,3,4,4,1],[1,2,2,3,4,3,3,2,4,3,3,2,3,4,4,5],

[1,2,2,3,2,4,4,5,2,4,4,5,3,5,5,1],[1,2,2,3,2,4,4,5,2,4,4,5,6,5,5,1],

[1,2,2,3,2,4,4,5,2,4,4,5,3,5,5,6],[1,2,2,3,2,4,4,5,2,4,4,5,6,5,5,7],

[1,2,2,3,4,5,5,2,4,5,5,2,3,4,4,1],[1,2,2,3,4,5,5,2,4,5,5,2,6,4,4,1],

[1,2,2,3,4,5,5,2,4,5,5,2,3,4,4,6],[1,2,2,3,4,5,5,2,4,5,5,2,6,4,4,7],

[1,2,2,3,3,4,4,5,3,4,4,5,5,1,1,2],[1,2,2,3,3,4,4,5,3,4,4,5,5,6,6,1],

[1,2,2,3,3,4,4,5,3,4,4,5,5,6,6,7],[1,2,2,3,4,3,3,5,4,3,3,5,3,1,1,2],

[1,2,2,3,4,3,3,5,4,3,3,5,3,6,6,1],[1,2,2,3,4,3,3,5,4,3,3,5,3,6,6,7],

[1,2,2,3,4,5,5,6,4,5,5,6,2,3,3,1],[1,2,2,3,4,5,5,6,4,5,5,6,3,1,1,2],

[1,2,2,3,4,5,5,6,4,5,5,6,7,1,1,2],[1,2,2,3,4,5,5,6,4,5,5,6,3,7,7,1],

[1,2,2,3,4,5,5,6,4,5,5,6,7,8,8,1],[1,2,2,3,4,5,5,6,4,5,5,6,2,3,3,7],

[1,2,2,3,4,5,5,6,4,5,5,6,3,7,7,8],[1,2,2,3,4,5,5,6,4,5,5,6,7,8,8,9]] : int list list

- length it;

val it = 44 : int

**Decomposition example**

[1,2,2,3, 2,3,3,1, 2,3,3,1, 3,1,1,2]:

[1,2,2,3,2,3,3,1],[1,2,2,3,2,3,3,1],[1,2,2,3,3,1,1,2] in Tcontexture 8

** Matrix notation ** (1) (2) (3)

[1,2,2,3] [2,3,3,1] [3,1,1,2]

[2,3,3,1]

**- kmul [1,2][1,2];**

val it = [[1,2,2,1],[1,2,3,1],[1,2,2,3],[1,2,3,4]] : int list list

- List.filter ispalindrome [[1,2,2,1],[1,2,3,1],[1,2,2,3],[1,2,3,4]];

val it = [[1,2,2,1],[1,2,3,1],[1,2,2,3],[1,2,3,4]] : int list list

**Modi for head=[1,2] for palindromes out of “kmul[1,2][1,2]"**

repetition: -

inversion: [1,2,**2,1**],

accretion: [1,2,3,1],[1,2,2,3],[1,2,3,4].

**- kconcat [1,2][1,2];**

val it =

[[1,2,1,2],[1,2,2,1],[1,2,1,3],[1,2,3,1],[1,2,2,3],[1,2,3,2],[1,2,3,4]]: int list list**ispalindrome:**

val it = [[1,2,1,2],[1,2,2,1],[1,2,3,1],[1,2,2,3],[1,2,3,4]] : int list list

repetition: [1,2,1,2],

inversion: [1,2,2,1],

accretion: [1,2,3,1],[1,2,2,3],[1,2,3,4].