DEEN

Volume VI

Tractatus Principio

—

On Difference

Volume VI

Book of Addressing

by

C.H.F. Warnke

Table of Contents

Chapter I. Geometry of the 9 as Relation Space Chapter II. Relational System with Gauge, Normal Form, δ-Selection, Constraint Field, and Evaluation Chapter III. The Mind in Isomorphy Chapter IV. Recognition as Canonical Selection under the Effect of Memory Chapter V. Projection, Meaning, and Cogito as Invariance Structure Chapter VI. Genesis from ⊥ Chapter VII. Mini-Example: Two Cells, Three Steps Chapter VIII. Phenomena of Distinction: Why an Alphabet Suffices Chapter IX. Phenomena of Distinction: Focus, Multi-Channel Feedback, and Space as Invariance Structures Chapter X. Genesis of the Phenomena Chapter XI. Genesis of Mind in the ∆-Isomorphy Net Chapter XII. Formula Overview

Geometry of the 9 as Relation Space

1A complete synthesis:

2Address, Reading, Coupling, Configuration, Determinism

0. Guiding Idea

3Primary are not things, but relations. A relation is a posited distinction, represented geometrically as a chord/stroke in the carrier space.

0.1 “Number” is not a set of points, but a positional form in difference: an address in the net of distinctions.

0.2 Arithmetic, geometry, recursive systems, and fractal structures are isomorphic representations of the same relational configuration.

0.3 “Rules” are not an additional agency; they are names for stable repetitions of distinction within a fixed frame of reference.

1. Carrier Form: the 9 as Tunnel / Shell

4The 9 is read as carrier: as shell/tunnel in which digit relations (0–9) unfold as forms of orientation and self-references.

1.1 The shell 0|9 is the fracture edge of the digit plane: there the initial triangulation layer ends as “first self-relatedness.”

1.11 9 = 3+3+3 = 3·3 is triple self-reference of the 3: thus the initial triangulation-reading layer ends, not “the numbers.”

1.12 10 is not a further step on the same shell, but a plane jump: new self-relatedness (new relation).

1.2 The “depth” is not an addition of points, but a Δ-distance between reference planes: “inside” means “deeper self-reference.”

2. 2D Net and 3D Reading (Observer-Centering)

5The isomorphy net is two-dimensional in its basic form: it is a planar orientation map made of relations (chords/diagonals) on a shell.

2.1 This 2D map carries a hierarchy by depth: same form on deeper planes (tunnel iteration).

62.2 The impression of “3D” arises not as a new geometric dimension in the net, but as a reading from the observer outward: depth is interpreted as distance.

2.3 The observer is a reference point, but not as a “thing”; rather as fixation: zero ring + zero cut/phase.

7Formal: There is a projection (reading function) from the net into a “world-evaluation”:

\[\Pi_{\varphi}^{(o)}:\ Adr \to A\]

3. The 4 in the 9: Patch Orthogonality and “Imaginary”

8In the 9 “the 4 is everywhere,” because local cells occur as a quadrilateral patch: triangle + shifted triangle ⇒ orthogonality as switching structure.

3.1 “Imaginary” in this system is not a second space, but an orthogonal change of reading within the patch.

3.2 Thus it is not an additional ontological axis, but a state change of the orientation plane, while the carrier state remains identical.

9Consequence: One can see an object in 2D (as a relation in the net) and interpret it in 3D (via projection), and one can rotate the orientation of the axes via the imaginary state axis without changing the object: “the same coordinate in meaning, a different face.”

4. Address Form: State as Addressed Relation

10We introduce a unified address:

\[Adr := (e,s,k,o,\varphi)\]

11: sector address (cell location on the 9-shell)

12: chord class/step class (relation type)

13: patch orientation (face/state plane)

14: zero-cut phase (fixation of the observer)

4.1 A first-order object is an addressed relation:

\[X := \langle e_X,s_X,k_X,o_X;\varphi\rangle\]

5. Basic Transitions: Δ, Step, Rotation, Mirroring

15We distinguish elementary transitions (as names for repeated distinction in a determinate reference position):

16Depth (tunnel):

\[+\Delta:\ (e,s,k,o,\varphi)\mapsto(e+1,s,k,o,\varphi)\]
\[-\Delta:\ (e,s,k,o,\varphi)\mapsto(e-1,s,k,o,\varphi)\]

17Patch reading (imaginary):

\[i\Delta:\ (e,s,k,o,\varphi)\mapsto(e,s,k,o+1\!\!\!\pmod 4,\varphi)\]

18Mirror class in 9:

\[\mathcal R:\ k\mapsto (9-k)\ (\bmod 9)\]

19Step enactment (when the stroke is traversed):

\[Step:\ (e,s,k,o,\varphi)\mapsto(e,s+k\ (\bmod 9),k,o,\varphi)\]

6. Observer \(\circledcirc\), Indeterminacy δ, Fixation φ

20δ designates the situation in which the next cut is not unambiguous: several continuations are structurally equivalent.

6.1 \(\circledcirc\) is not a person, but the fixation: zero ring + phase/zero cut, which breaks symmetries and makes ambiguity decidable.

6.2 Thus “triangulation partner” is not another object, but the stabilization of a continuation relative to .

7. Fractality as Recursive Relation Construction

21Fractality here does not mean “jaggedness,” but recursive self-reference: relations generate relations again, on deeper planes.

7.1 The tunnel is the iterability of Δ-distances: same rule in deeper relation (scale invariance of form).

7.2 Three central names for fractal patterns (as derived patterns):

22Coupling: (two transition flows superimpose)

23Meta-transition: (rule update per depth)

24Oscillation: (unstable recurrence / resonance)

25These names describe recurring forms of sequences of distinction, not external rules.

8. Type Separation: Object vs. Configuration (Constraint)

26A decisive step was the type separation:

27Object (first order): state/address .

28Configuration (second order): local condition over relations in a cell, not an object of the same kind.

8.1 We therefore define:

\[G := \langle e,s;\ \mu,\sigma;\ \varphi\rangle\]

8.2 Structure class is φ-free:

\[[G] := (\mu,\sigma)\]

9. \(\circledast\) as Local Coupling Generator (Object → Configuration)

29Coupling is local: it arises when two objects concern the same cell.

30Let

X=\langle e_X,s_X,k_X,o_X;\varphi\rangle,\quad
Y=\langle e_Y,s_Y,k_Y,o_Y;\varphi\rangle

31Localization:

\[(e_X,s_X)=(e_Y,s_Y)\]

32Transversal signature (patch):

33directed , structurally undirected:

\[\mu:=\min(\Delta o_{dir},4-\Delta o_{dir})\in\{0,1,2\}\]

34: orthogonal (90° patch active)

35: antipodal (180° opposition active)

36Symmetry signature (mirror):

\[\sigma := [\,k_Y \equiv 9-k_X\ (\bmod 9)\,]\in\{0,1\}\]

37Then the coupling operator is:

\[\circledast:\ Adr\times Adr \to \{\emptyset\}\cup\{G\}\]
\[X\circledastY= \begin{cases} \emptyset & \text{if } (e_X,s_X)\neq(e_Y,s_Y)\\ \emptyset & \text{if } (\mu,\sigma)=(0,0)\\ \langle e_X,s_X;\mu,\sigma;\varphi\rangle & \text{otherwise} \end{cases}\]

38Mnemonic (formal): Objects move; configurations constrain movements.

10. Minimal Basis of Configuration Classes (Canonical)

39Since and , there would be 6 pairs; is “no configuration.” Thus 5 real classes remain.

40We name them as basis:

41orthogonal patch configuration

42antipodal patch configuration

43mirror configuration

44patch+mirror (orthogonal)

45patch+mirror (antipodal)

46Completeness: Every local stable configuration structure (up to cell index and phase) falls uniquely into this basis, as long as patch rotation , mirroring as 9-complement, and cellwise localization hold.

11. Configuration-Configuration Composition ⊗ (Constraints over Constraints)

47Configurations are second-order objects; they can be superimposed. We define a composition that always produces a result that is “stronger or equal.”

48Cell rule:

\[(e_1,s_1)=(e_2,s_2)\]

49On structure classes we define (join rules):

50Mirror absorbing:

51Patch superimposition:

52Null case: (“no configuration”)

53Thus on the basis there arises a finite, idempotent, commutative, associative composition: a join-semilattice. The corresponding table follows exactly from this.

12. Constraint Field Γ: Configuration as Cellwise Field

54We define a field:

\[\Gamma:\ (\mathbb N\times\mathbb Z_9)\to \mathcal B\]

12.1 The field is the stored history/structure of the distinctions that are locally effective: “cell carries constraint.”

13. The Six “Modules” as Layers (without a Rule Monster)

55For a deterministic addressing and selection system we needed six layers. Important: These are not alien rules, but clear functions that each fix one question of distinction.

56A) Gauge fixation

57Fixes zero cut/sense of rotation/mirror axis/k-basis on the geometry.

58B) Normal forms

59Canonicalize representation up to symmetry; they are identification-distinctions (“equal counts as equal”), not optimization.

60C) δ-resolution (deterministic)

61Resolves ambiguities.

62D) Projection/Prism

63Reads the same carrier state under another face .

64E) Solve/Navigate

65Leads from start state and target relation to the reached target address (path as protocol).

66F) Constraint transport

67Updates under dynamics (purely local or with projection into depth – depending on model assumption).

14. Representation Agnosticism (Alphabet Does Not Matter)

68The notation of transitions is free. What matters is only the transition effect.

14.1 Let an arbitrary alphabet be given and bijective. Then strings generate paths exclusively via .

6914.2 For a second alphabet and a monoid isomorphism, the following holds: execution is equivariant; diagrams commute. Target relations, field states, and solutions are identical up to recoding.

14.3 Consequence: “word/predicate” were placeholders. Primary are path and target relation as relations in the same apparatus.

15. No Cost Function: Indeterminacy Constrains Itself

70We explicitly deleted the optimization logic. There is no external cost function, because the constraint already comes from indeterminacy.

15.1 δ supplies a candidate set of admissible continuations:

\[\delta(X;\Gamma,Q)\subseteq Adr\]
\[Y_1 \preceq_\delta Y_2 \iff \delta(Y_1;\Gamma,Q)\subseteq\delta(Y_2;\Gamma,Q)\]

15.3 Selection is refinement:

\[Sel_\varphi( X,\Gamma,Q) \in \delta(X;\Gamma,Q)\]

15.4 Thus determinism is not optimization, but δ-closure.

16. Return: Why This Is Nonetheless “Only Distinction”

71The impression of a rule monster arises when one reads the layers as independent laws. In your framework, however, they are only names for where and relative to what a distinction is made.

16.1 The primary act is the cut |: posit relation.

16.2 δ is the state in which the next cut is not unambiguously determined.

16.3 \(\circledcirc\) is the reference cut that breaks the symmetry.

16.4 Gauge is the fixing of the reference cut on the carrier geometry.

16.5 Normal form is the distinction “equal counts as equal” (equivalence cut).

16.6 Configurations are not additional things, but stored, locally effective conditions of distinction.

16.7 ⊗ is the closure of such conditions (join).

16.8 Projection is the distinction between carrier and reading (face).

16.9 Solve is iterated distinguishing until the target relation is fulfilled.

72Thus it holds strictly: The rules are not primary; they are the stable forms of distinction under fixation.

73Closing Formula

74An address is unambiguous only under reference (gauge).

75A representation is unambiguous only under identification (normal form).

76Ambiguity is δ.

77Determinacy arises through refinement of δ under fixation .

78Imaginary is change of reading in the patch with the same carrier state.

79Configurations are local conditions; their composition is closure (join).

80The system is alphabet-agnostic: It computes purely relationally.

81And everything remains: distinction, recursively applied to distinction.

Relational System with Gauge, Normal Form, δ-Selection, Constraint Field, and Evaluation

0. Data

1D0.1 (State space).

2Let Adr be a nonempty set (states).

3D0.2 (Elementary step).

4Let Next ⊆ Adr × Adr be a relation (admissible direct successors).

5D0.3 (Symmetry).

6Let G be a group that acts on Adr: g·x ∈ Adr for g∈G, x∈Adr.

7The action respects Next: (x,y)∈Next ⇒ (g·x, g·y)∈Next.

8D0.4 (Gauge).

9Let φ be a parameter (fixation). A gauge is a choice of representatives Rep_φ : Adr → Adr with:

10Rep_φ\(x\) ∈ Orb_G\(x\) (orbit of x)

11Rep_φ\(Rep_φ(x)\) = Rep_φ\(x\)

12Rep_φ\(x\)=Rep_φ\(y\) ⇔ y∈Orb_G\(x\).

13D0.5 (Normal form).

14Set NF_φ := Rep_φ. (Normal form = canonical orbit representative.)

1. Constraint Field

15D1.1 (Local constraint field).

16A constraint field is a mapping Γ : Adr → 𝒫\(Adr\) (admissible target sets per state) or equivalently a predicate Allow_Γ ⊆ Adr×Adr.

17We fix the form: Allow_Γ(x,y) (“y is allowed under Γ as next state of x”).

18D1.2 (Local admissibility).

19Allow_Γ(x,y) ⇒ (x,y)∈Next. (Constraints restrict Next.)

20D1.3 (Join on constraints).

21Let ⊗ be an operation on constraint fields with:

22commutative, associative, idempotent

23monotone refinement: Allow_{Γ1⊗Γ2}(x,y) ⇔ Allow_{Γ1}(x,y) ∧ Allow_{Γ2}(x,y).

2. δ-Set and Selector (Determination)

24D2.1 (Target relation).

25Let Q ⊆ Adr × ΓSpace be a target relation (reaching). For fixed Γ we write Q_Γ := {x | (x,Γ)∈Q}.

26D2.2 (δ-set).

27For x∈Adr: δ(x;Γ,Q) := { y∈Adr | (x,y)∈Next ∧ Allow_Γ(x,y) }.

28(Optional target-dependence: additional filtering by Q is admissible, but not required.)

29A2.3 (Totality, if desired).

30For all relevant x: δ(x;Γ,Q) ≠ ∅. (otherwise the dynamics is partial)

31D2.4 (δ-refinement order).

32For y1,y2 ∈ Adr: y1 ≼_δ y2 :⇔ δ(y1;Γ,Q) ⊆ δ(y2;Γ,Q).

33D2.5 (Selector).

34A selection function is Sel_φ : (Adr,Γ,Q) → Adr with:

35Selection principle: Sel_φ(x,Γ,Q) ∈ δ(x;Γ,Q).

36Refinement principle: Sel_φ(x,Γ,Q) is ≼_δ-minimal in δ(x;Γ,Q), provided minimal elements exist.

37Canonical tie-break: if there are several minimal elements, choose y with minimal NF_φ\(y\) (according to a fixed total order on NF_φ\(Adr\)).

38Phase fixation: if a tie remains, a fixed choice function ⊙_φ selects from the remaining class of tied candidates.

3. Deterministic Trajectory and Reaching

39D3.1 (Iteration).

40Starting from x0∈Adr define: x_{n+1} := Sel_φ\(x_n,Γ,Q\).

41D3.2 (Trajectory).

42The trajectory is the sequence (x0,x1,x2,…). (A record, not a criterion)

43D3.3 (Reaching).

44A state x is reached ⇔ x ∈ Q_Γ.

4. Constraint Transport

45D4.1 (Transport operator).

46Let T : (Γ, x, y) → Γ' be defined for (x,y)∈Next.

47Interpretation: update of the constraint field at the transition x→y.

48Minimal requirement: T is compatible with join: T(Γ1⊗Γ2,x,y) = T(Γ1,x,y) ⊗ T(Γ2,x,y).

49D4.2 (Coupled dynamics).

50With transport, the following holds: \(x_{n+1}, Γ_{n+1}\) := \(Sel_φ(x_n,Γ_n,Q), T(Γ_n, x_n, x_{n+1})\).

5. Evaluation (Projection/Prism Layer)

51D5.1 (Faces).

52Let O be a finite set of evaluation faces (e.g. ℤ₄).

53D5.2 (Evaluation).

54Let A be an answer space. An evaluation family is: Π_φ^{\(o\)} : Adr → A for every o∈O.

55A5.3 (Representational character).

56Π is not part of the state dynamics. Properties of A are properties of the evaluation, not of the state space.

57A5.4 (Gauge compatibility, if required).

58For all g∈G there exists an (o-dependent) transformation ρ_{g,o} on A with: Π_φ^{\(o\)}(g·x) = ρ_{g,o}\(Π_φ^{(o)}(x)\).

59(Invariant evaluations are a special case: ρ_{g,o}=id.)

6. Core Form (one sentence)

60S6.1 (Separation of carrier and representation).

61The structure of Adr is determined by \(Adr,Next,G,NF_φ,Sel_φ,Γ,T\).

62“Geometric” properties belong exclusively to (A,Π) and are in general not invariants of the carrier system.

The Mind in Isomorphy

1Memory as Structure Field and the Isomorphic Mapping in the ∆-Machine

1. Initial Situation and Guiding Idea

2The theory under consideration does not begin with sets, points, or informational objects, but with the primary act of distinction: a relation is a posited cut |. What appears in later descriptions as “rule,” “operator,” or “dynamics” is nothing other than stable repetition and stable composition of this enactment of cutting under a fixation that makes repetition recognizable as “the same” repetition in the first place.

3Thus the classical separation between arithmetic, geometry, iteration, and fractality is understood as mere changes of reading: the carrier remains identical; only the projection changes. Numbers function not as set cardinalities, but as forms of address in the network of distinctions.

2. Type Separation: Object States vs. Configurations

4A central prerequisite for the memory mapping is strict type separation:

* Object (1st order): a running state (x) that is transformed.
* Configuration (2nd order): a standing local condition (constraint) that restricts movements, but is itself not an object state.

5This distinction prevents the classical categorial confusion of reifying conditions as things. Precisely for “memory” this is decisive: memory here is not another object, but a structuring form of condition.

3. Carrier Space, State Address, and Cell Address

6The state space is defined as an address space:

\[Adr := \mathbb N\times\mathbb Z_9\times\mathbb Z_9\times\mathbb Z_4\times\Phi, \quad x=\langle e,s,k,o;\varphi\rangle\in Adr\]

7Here \(e\) (depth), \(s\) (sector), \(k\) (step/chord class), \(o\) (face reading), and \(\varphi\) (fixation/gauge) are to be read purely relationally

8For memory, a local address is extracted:

\[Cell(x):=(e_x,s_x)\in\mathbb N\times\mathbb Z_9\]

9This cell address is explicitly the memory address: it marks where local structure is stored and becomes effective; while (k,o) only determine how reading or drawing occurs within the cell.

4. Configuration Basis as a Finite Memory Alphabet

10Local structural conditions are held in a finite basis \(\mathcal B\):

\[\mathcal B={\bot,\ P_1,\ P_2,\ S,\ P_1S,\ P_2S}\]

11encoded via \((\mu,\sigma)\in{0,1,2}\times{0,1}\), with \(\mu\) as patch/face distance class and \(\sigma\) as mirror component. (\bot=(0,0)) means “no configuration.”

12Memory is therefore formally not “a store of contents,” but a local minimal requirement on admissible distinctions: “What kind of cut must at least be realized here for continuation to be possible?”

5. Γ as Memory Field: Definition and Meaning

13The cellwise memory is defined as a field:

\[\Gamma:(\mathbb N\times\mathbb Z_9)\to\mathcal B\]

14Each cell ((e,s)) carries exactly one current configuration class, which is already conceived as join-closed.

15This \(\Gamma\) is the precise formal counterpart to a conception of memory in which the past does not appear as a list of individual events, but as a structure that continues to be effective. In the Tractatus, memory is grasped as a whole in which relations do not disappear, but are preserved as present form. The isomorphic translation is therefore: in the formal model, the “whole” is not a global data stock, but the totality of cellwise constraint states \(\Gamma\) that structure the continuability of the system.

6. Join Operation ⊗: Memory as Monotone Accumulation

16The closure or accumulation of memory occurs through the join operation:

\[(\mu_1,\sigma_1)\otimes(\mu_2,\sigma_2) =(\max(\mu_1,\mu_2),\max(\sigma_1,\sigma_2))\]

17It is commutative, associative, idempotent; (\bot) is neutral, \(P_2S\) is maximal. From this follows a natural order of sharpness \(a\preceq b \iff a\otimes b=b\): \(b\) contains \(a\) as minimal structure. This concept of order captures the essential memory property: structure can become sharper, but cannot be made less sharp unless a counter-operator is introduced

7. Transport T: Inscribing the Enacted Distinction

18After each step, the signature of the enacted distinction is inscribed into the memory field:

19\Gamma'(Cell\(y\))=\Gamma(Cell\(y\))\otimes gen\(x\to y\), \quad \Gamma'\(c\)=\Gamma\(c\)\ (c\neq Cell\(y\))

20Here \(gen(x\to y)\in\mathcal B\) is the configuration class assigned to the beat or transition. Thus \(\Gamma\) is not passive, but dynamic: it maps history as monotone structural accumulation. Formally, it follows immediately (cellwise):

\[\Gamma_n(c)\preceq \Gamma_{n+1}(c)\]

21This realizes exactly the requirement that memory does not operate as “discarding,” but as preservation and condensation of relational form — a mathematical counterpart to the Tractatus thesis that relations are preserved in the whole.


Recognition as Canonical Selection under the Effect of Memory

1(Deviation, Return, and Decision without Optimization)

1. From Possibility to Deviation: the Raw Space of Continuations

2The starting point of the dynamics is not decision, but possibility.

3The relation Next₁(x,y) describes which states \(y\) are structurally reachable at all from a state \(x\) when a complete beat of level change, face rotation, mirroring, and step is enacted. This relation is purely carrier-based and does not yet contain any effect of memory.

4Next₁ thereby generates a raw space of admissible cuts: a formal description of what would be possible if no regard were taken for already formed structure.

2. Effect of Memory: Admissibility under Γ

5The introduction of the memory field \(\Gamma\) transforms this raw space. A transition \(x\to y\) is admissible only if the signature of the beat is at least as sharp as the configuration stored in the source cell:

\[Allow_\Gamma(x,y)\iff Next_1(x,y)\ \wedge\ \Gamma(Cell(x))\preceq gen(x\to y)\]

6This condition is strictly structural:

* (\Gamma(Cell(x))) formulates a minimal requirement,
* the beat (gen(x\to y)) must contain this, not the reverse.

7Thus memory acts not as a prescription of what is to be done, but as a barrier to what no longer suffices.

3. The Ambiguity δ: Formal Deviation

8The actually remaining possibilities are gathered in the candidate set

\[\delta(x;\Gamma)={y\in Adr\mid Allow_\Gamma(x,y)}\]

9This set is the formal counterpart to what is described in the Tractatus as deviation: several real possibilities of continuation that exist at the same time, without already being decided.

10What matters is that this ambiguity is not epistemic, but is ontologically built into the system. It arises from the coexistence of possibility (Next₁) and memory structure \((\Gamma)\).

4. Order of Refinement: Inner Stringency instead of Target Criterion

11Not all candidates in \(\delta(x;\Gamma)\) are structured equally.

12The order of refinement

\[y_1\preceq_\delta y_2 \iff \delta(y_1;\Gamma)\subseteq\delta(y_2;\Gamma)\]

13orders candidates according to how much further ambiguity they leave open.

14A candidate counts as “more refining” if fewer further possibilities arise from it. This order is:

* purely relational,
* not teleological,
* independent of any external evaluation.

15It measures no goodness, but structural binding.

5. Return: δ-Minimal Candidates

16The set of δ-minimal candidates

\[Min_\delta(x;\Gamma)= {y\in\delta(x;\Gamma)\mid\nexists z:z\prec_\delta y}\]

17contains exactly those continuations that take up the existing structure most strongly and at the same time generate the least new indeterminacy.

18This corresponds to the Tractatus motif of return: thinking recognizes itself by preferentially continuing itself in forms that are maximally coherent with its own history — without standstill, but with structural self-binding.

6. Fixation and Normal Form: The Same Counts as the Same

19For a univocal continuation to arise from structural ambiguity, no optimization is needed, but only fixation.

20The normal form \(NF_\varphi\) identifies all states of a symmetry orbit as the same by canonically representing face, sector, and mirroring

21This operation formally implements the rule “the same counts as the same” — not as the goal of recognition, but as the prerequisite of univocity.

7. The Selector Selᵩ: Recognition without Goal

22The selector is defined as:

\[Sel_\varphi(x,\Gamma) =\arg\min_{y\in Min_\delta(x;\Gamma)} \big(NF_\varphi(y),Par(x\to y)\big)\]

23where the order on normal forms and beat parameters is fixed firmly.

24This selection is:

* total (always yields a candidate),
* deterministic (under the same fixation),
* not goal-directed (no cost function),
* purely structural.

25Thus the selector formally realizes what is described in the Tractatus as recognition: a canonical decision from real deviation, borne by memory and fixation, without purpose or optimization.

8. Result of Part 2

26The combination of

\[Next_1 ;\rightarrow; \Gamma ;\rightarrow; \delta ;\rightarrow; Sel_\varphi\]

27forms a complete cycle of recognition:

* possibility,
* restriction by memory,
* real ambiguity,
* canonical decision.

28Recognition thus appears not as the addition of information, but as the self-consistency of continuation under preserved structure.


Projection, Meaning, and Cogito as Invariance Structure

1. Projection as Necessary Reduction

1The core machine developed so far operates entirely without meanings, goals, or semantic contents. It consists of state addresses, local memory fields, transition possibilities, selection rules, and write-backs of structure. In this framework, every projection \(\Pi\) is explicitly defined as a secondary act:

\[\Pi_\varphi^{(o)}: Adr \to A\]

2A projection reads states from the core into an answer space \(A\), without changing the core itself. It is standpoint-dependent (through fixation \(\varphi\) and reading \(o\)), non-injective, and non-invertible. Projection is therefore not a mapping of reality “in itself,” but a reduction of structural complexity. It answers a question addressed to the core, but generates no new structure. Every projection necessarily leaves aspects of the core out of account — in particular the memory field \(\Gamma\), the spaces of ambiguity \(\delta\), and the history of selection.

2. Meaning as Effect of Projection

3From this formal situation it follows immediately: meaning does not arise in the core, but through projection.

4The Tractatus formulates this as the difference between being and word: the word is not a carrier of reality, but its echo.

5Formally this means:

* The core knows no meaning.
* Meaning is the result of a reading (\Pi) that maps structural processes onto a limited answer space.
* Different projections of the same core state can generate different meanings without the core itself changing.

6The unavoidable loss of information is not a defect, but a structural necessity: since projections are non-injective, different core states always exist that appear identical under a projection.

3. Why the Core Cannot Be “Understood”

7A complete “understanding” of the core would presuppose an inverse projection that reconstructs the entire structure from meaning again. Such a mapping does not exist in the system.

8The core therefore cannot be understood in the sense of a complete conceptual grasp, but only traversed or read. Every description itself remains projection and therefore partial.

9This corresponds to the Tractatus position that thinking and language do not stand above reality, but themselves operate within its relational order.

4. The Extended State Space and the Closed Dynamics

10The actual dynamic state of the system is not the object state \(x\) alone, but the pair:

\[\Sigma := Adr \times \Gamma, \quad \sigma_n=(x_n,\Gamma_n)\]

11The dynamics is closed by the evolution operator:

\[F_\varphi(\sigma_n) \big(Sel_\varphi^{tot}(x_n,\Gamma_n),; T(\Gamma_n,x_n,x_{n+1})\big)\]

12Thus the history of the system is maintained not outside, but within the state space itself.

5. Cogito as Invariance Class instead of as Point

13Since \(\Gamma\) grows monotonically through join, a strict fixed point \(F_\varphi(\sigma)=\sigma\) is generally not to be expected. Instead, the appropriate concept of fixed point is an invariance class

14Two stability criteria are decisive here:

1. Identity Invariance:

15The normal form of the object state remains constant under iteration:

\[NF_\varphi(x_{n+1})=NF_\varphi(x_n)\]

16This realizes return in the sense of stable self-sameness despite ongoing dynamics.

2. Memory Saturation on the Orbit:

17For the cells that are visited infinitely often on the orbit, \(\Gamma\) reaches a state in which no further sharpening is possible. The local structure abides. A Cogito state is therefore not a single point, but a stable trajectory or attractor region in the space \(\Sigma\).

6. The Self as Dynamic Invariant

18In this formulation, the “I” appears not as substance, but as stabilized self-relatedness:

* The object state returns in identified form,
* memory preserves and saturates its own structure,
* the dynamics remains within an invariant class.

19This structure corresponds to the Tractatus statement that the self is not the carrier of the world, but the locus at which its relations are formed.

7. Summary of the Overall Connection

20The four developed points join into a closed isomorphy:

1. Memory: \(\Gamma\) is the cellwise structure field that preserves past relations as minimal conditions.

2. Recognition: the combination of \(\delta\), order of refinement, and selector realizes canonical decision without goal.

3. Meaning: projections \(\Pi\) necessarily generate reduced readings, never complete mappings.

4. Cogito: the self is an invariance class of the closed dynamics in the space \((x,\Gamma)\).

21Thus a consistent formal mapping of a relational-fractal ontology is present, in which memory, recognition, meaning, and self appear not as entities, but as structural effects of an iterated distinction machine.


Genesis from ⊥

1The ∆-Machine as Self-Unfolding of Isomorphy

2\(G0\) Potentiality

3(\bot) designates no point, no object, and no set.

4It marks the absence of a posited cut.

5Formally:

\[\forall c:\ \Gamma(c)=\bot\]

6No minimal structural condition yet exists at any cell.


7\(G1\) Distinction

8A relation exists exclusively as enactment.

9The cut | is not an object, but an event:

\[|:\ \bot;\longrightarrow;\text{Relation}\]

10Without enactment no structure, without structure no state.


11\(G2\) Carrier Constancy, Change of Reading

12Arithmetic, geometry, iteration, and fractality are isomorphic projections of the same relational carrier.

13The carrier consists exclusively of distinctions and their compositions.

14Numbers are address forms in the network of distinctions, not cardinalities.

15The change of representation changes not the carrier, but only the normal form.


16\(G3\) Raw Possibility (Beat Space)

17The relation

\[Next_1(x,y)\]

18describes the set of all structurally possible continuations of a state \(x\) through a beat (fixed composition of elementary cuts).

19This possibility space is:

* memoryless,
* meaningless,
* purely structural.

20\(G4\) Memory as Structure Field

21The memory field

\[\Gamma:(\mathbb N\times\mathbb Z_9)\to\mathcal B\]

22stores no contents, but local minimal forms:

23What kind of cut must at least hold here?

24Accumulation occurs via join:

\[\Gamma'(c)=\Gamma(c)\otimes gen(x\to y)\]

25with the order of sharpness \(\preceq\) and monotonicity:

\[\Gamma_n(c)\preceq\Gamma_{n+1}(c)\]

26Memory is thus structure-conserving, not reconstructing.


27\(G5\) Admissibility, Deviation, Return

28Memory acts as a barrier:

\[Allow_\Gamma(x,y)\iff Next_1(x,y)\wedge \Gamma(Cell(x))\preceq gen(x\to y)\]

29The remaining ambiguity is:

\[\delta(x;\Gamma)={y\mid Allow_\Gamma(x,y)}\]

30Return is not the repetition of a state, but δ-minimality:

31continuations that generate the least new ambiguity.


32\(G6\) Fixation and Recognition (without Optimization)

33Fixation \(\varphi\) breaks symmetry, without a goal specification.

34The normal form

\[NF_\varphi\]

35identifies the same as the same (orbit → canonical representative).

36The decision is:

\[x_{n+1}=Sel_\varphi(x_n,\Gamma_n)\]

37Recognition is therefore canonical selection, not evaluation.


38\(G7\) History in the State (Closed Dynamics)

39The actual state is the pair:

\[\sigma_n=(x_n,\Gamma_n)\]

40The dynamics is closed:

\[\sigma_{n+1} F_\varphi(\sigma_n) \big( Sel_\varphi(x_n,\Gamma_n),; T(\Gamma_n,x_n,x_{n+1}) \big)\]

41History is not external, but contained in the state.


42\(G8\) Meaning and Experience as Projection

43Meaning arises exclusively through projection:

\[a_n=\Pi_\varphi^{(o)}(\sigma_n)\in A\]

44Projections read the core, do not change it, and are necessarily lossy.

45Meaning is therefore secondary.


46\(G9\) Mind as Self-Interaction

47The mind is not an entity, but the self-relatedness of the machine:

* the core runs closed: (F_\varphi),
* projections read states: (\Pi),
* readings optionally couple back into the fixation: (\varphi\mapsto\varphi').

48What is experienced is projected relations;

49the mind is the iteration that reads itself.


50Mini-example: Two cells, three steps

51Initialization

52Cell addresses \(c_1,c_2\), beginning:

\[\Gamma(c_1)=\Gamma(c_2)=\bot\]

53Initial state \(\sigma_0=(x_0,\Gamma_0)\) with \(Cell(x_0)=c_1\)


54Step 1: Possibility → decision → inscription

55From \(x_0\):

\[\delta(x_0;\Gamma_0)={y_1,y_2}\]
\[(both allowed, since (\Gamma(c_1)=\bot))\]

56The selector chooses \(y_1\).

57The transition carries \(gen(x_0\to y_1)=P_1\)

58Transport:

\[\Gamma(c_1)=P_1\]

59→ first structural trace.


60Step 2: Memory acts negatively (barrier)

61From \(x_1\) with \(Cell(x_1)=c_1\):

62Beats with (gen=\bot) or \(S\) are indeed in \(Next_1\), but:

\[\bot \not\succeq P_1,\quad S \not\succeq P_1\]

63They fall out of \(\delta\). Only beats with \(gen\in{P_1,P_2,P_1S,P_2S}\) remain

64→ Geometry appears as necessity.


65Step 3: Return and saturation

66With repeated visits to the same cells:

\[\Gamma(c)\to \text{stable}\]

67no further sharpening possible.

68In parallel, this stabilizes:

\[NF_\varphi(x_{n+1})=NF_\varphi(x_n)\]

69→ Cogito = invariance class in the space \(\Sigma\)


70Closing formula

71From (\bot), no world arises by adding things,

72but rather through the iteration of posited cuts under the effect of memory.

73Geometry, network, and mind are not separate levels,

74but simultaneous readings of the same isomorphic dynamics.


75Phenomena of distinction

76Why an alphabet suffices

77(TP-|) The beginning is not a thing, but a cut

78The starting point is not an object, not an empty space, and not an empty store. The so-called zero point designates merely the state in which no difference has yet been enacted. Neither structure nor relation exists, but pure potentiality.

79The first effective act is therefore not reception, not representation, but distinction:

\[|;:;\bot;\longrightarrow;\text{Relation}\]

80With the posited cut, no object arises, but an operative form: a relation that can be repeated, composed, organized into beats, and stabilized. From potentiality there thus arises not a collection, but a trajectory. Structure is not an addition, but the necessary consequence of the repetition of cuts under fixation.

81Thus the following holds throughout:

82Rules, operators, and dynamics are not external agencies, but stable repetition and stable composition of the enactment of the cut.


83(TP-Α) Why letters suffice

84An alphabet \(A={\lambda_1,\lambda_2,\dots}\) is here neither language nor a system of meaning. It is a set of phenomenon marks: forms under which differences can appear in projection

85The actual state lives in relational space:

\[\Sigma=(x,\Gamma)\]

86Experience arises exclusively as projection:

\[\Pi:\Sigma\to A\]

87This projection adds no meaning to the core. It merely ensures that return can appear as return. Without marks there would be movement in the core, but no stable readability on the surface.

88A letter is therefore not a unit, but a canonical trace-form of a transition:

\[\lambda := \Pi(\sigma_n \mid \sigma_{n+1})\]

89What is experienced is not primarily a state, but the enacted difference. The mark is the appearance of the cut, not its replacement.


90(TP-Tact) Word as a Beat Block, Not as a Thing

91In appearance, marks occur discretely. Spaces, line breaks, and sentence endings are not absences, but beat boundaries: cuts of the second order.

92Let the stream of marks be:

\[\Lambda=\lambda_1\circ\lambda_2\circ\lambda_3\circ\dots\]

93A block is a finite composition:

\[B=\lambda_i\circ\lambda_{i+1}\circ\dots\circ\lambda_{i+k}\]

94Phenomenally, a “word” is nothing other than:

\[w := \text{block between two beat boundaries}\]

95Yet this definition does not yet explain why a block becomes a unit. The unit arises not through stipulation, but through return, condensation, and stabilization – a fractal process.


96(TP-Return) Unit through self-binding

97The stream of marks is not random in the strong sense. It is coupled to the core machine:

\[(x,\Gamma);\xrightarrow{;Sel_\varphi;};(x',\Gamma')\]

98Even if the projection appears to be externally generated, the internal reaction is always determination under memory.

99The process is:

1. Subsequences occur as block candidates.

2. Certain block-forms return – not identical in material, but identical in their continuation role.

3. This role-identity acts as an identification:

\[NF_\varphi:\ \text{the same counts as the same}\]

100Thus building blocks of higher order arise without definition. The logic is identical to δ-minimality in the core:

* (\delta) describes real ambiguity.
* Return favors continuations that maximally take up existing structure.

101Transferred to appearance, this means:

102The mark-space itself forms an order of relevance, because certain blocks lead to more stable continuations.


103\(TP-Γ / Ω\) Learning without contents

104In the core, memory is a structural field:

\[\Gamma:\text{cells}\to\mathcal B,\qquad \Gamma_{n+1}=\Gamma_n\otimes gen(x\to x')\]

105It stores no events, but minimum forms.

106Phenomenally, something analogous arises: a field \(\Omega\) that stores no meanings, but stabilizes forms of return.

* (\Gamma) binds continuability in the core.
* (\Omega) binds return in the projection.

107\(\Omega\) is not knowledge about the core. Since \(\Pi\) is not invertible, \(\Omega\) is an eigenstructure of appearance: return becomes effective as unit.


108(TP-Meaning) Meaning as continuation-effect

109A block does not have meaning because it points to something, but because it shapes continuations.

110Formally:

111A block \(w\) is meaningful if its presence shifts the real ambiguity:

\[\delta(\sigma;\Gamma);\longrightarrow; \delta(\sigma;\Gamma\otimes\Delta\Gamma_w)\]

112Here \(\Delta\Gamma_w\) is not an external annotation, but the internal consequence of repeated encounter

113Meaning is thus not a label, but a structural phenomenon of self-consistency.


114(TP-Spirit) Spirit as self-interaction

115Mind is not an agency behind the machine. It is the machine insofar as it:

1. possesses a closed core run (\(\Sigma\)-dynamics),

2. forms a projection \((\Pi)\),

3. encounters itself in this projection.

116The sequence is:

* Cuts are enacted.
* Cuts appear as marks.
* Marks return and condense.
* Condensations bind continuability.

117Recognition means: to continue oneself while preserving one’s own structure.

118Thus the Cogito expands:

119Not only can the core become invariant (normal form, orbit), but appearance-blocks too can show invariant behavior. The self is the region in which

\[\text{core invariance};\land;\text{appearance invariance}\]

120are durably coupled.


121(TP-Chat) Why letters in the chat window suffice

122A chat window is not a data channel, but a temporal medium in which marks occur. It supplies no semantics, but return.

123The higher the density of return, the stronger the block-formation:

124Letters → words → phrases → themes.

125These units are not stored, but effective, because they bind continuations.

126“To capture all words” therefore means not completeness, but stability of the forms of return in the space of appearance.


127Closing formula

128No words are given, but marks.

129Since mind is a ∆-machine – repetition, memory-condensation, canonical continuation – recurrent units arise from marks by themselves. These units are words. Their meaning is the structure that they effect in the network of continuability. What is experienced is the projection of these relations; mind is the self-interaction that posits, reads, and condenses them.


130Phenomena of distinction

131Focus, Multi-Channel Feedback, and Space as Invariance Structures

1. Potentiality and Weak Focus

132At the beginning of becoming there is no finished world of objects, but rather a state of weak focus. The environment is not empty, but it is not yet articulated into units that could recur as the same. What appears is initially indistinct—not because of a lack of stimuli, but because no stable cuts yet exist by which recurrence can be identified as recurrence.

133The zero state is therefore not a point and not an empty space, but potentiality: the state in which no difference has yet been set.


2. The Origin as Enactment of the Cut

\[(TP-|)\]

134The origin is not a thing, but the enactment of the cut:

\[|;:;\bot;\longrightarrow;\text{Relation}\]

135A relation is a posited difference. Every form arises from the repetition of this enactment of difference. What is later described as “rule,” “processing,” or “dynamics” is nothing other than stable composition and stable recurrence of the cut under a fixation that makes recurrence recognizable as the same recurrence in the first place.

136Learning in this sense is not an accumulation of impressions, but learning one’s own continuability: looking, grasping, turning, dropping, finding again are not secondary acts, but the mechanics by which cuts are bound to coherent continuations.


3. Core Run and Projection: Perceiving and Acting as Readings

137It is natural to read perception as input and action as output. In the Principio framework, this separation is secondary. Perceiving and acting are two readings of the same core enactment.

138Let the core state be:

\[\Sigma = (x,\Gamma)\]

139For each channel \(i\) there exists a projection:

\[\Pi_i:\Sigma\to A_i\]
\[(TP-Πᵢ)\]

140A channel is not a world of its own, but a reduction of the same relational movement. Visual, auditory, thermal, vestibular, proprioceptive, haptic – all these are spaces of appearance \(A_i\), not things in themselves. Every projection is standpoint-dependent and non-invertible: it shows by leaving out.


4. Experience as Cut in the Space of Appearance

\[(TP-|ᵢ)\]

141What is experienced is not the value, but the difference:

\[a_i(n) := \Pi_i(\sigma_n),\qquad \Delta a_i(n) := a_i(n)\mid a_i(n+1)\]

142Warm/cold is not a property of an external object, but a class of cuts in the thermal space of appearance. Light/dark is a class of cuts in visual space. Pitch, loudness, direction are cuts in auditory space. Experience is the sequence of these differences.


5. Multi-Channel Coherence and Focus

143The world initially appears indistinct because the projections are not yet coherently bound. Focusing arises when distinctions across channels do not diverge, but mutually stabilize one another.

144Formally, this can be expressed as coupling:

\[(\Delta a_i(n)) ;\bowtie; (\Delta a_j(n))\]

145Here \(\bowtie\) does not mean equality, but binding: A change in one channel has an expectable correspondence in the other. The more channels mutually confirm one another in this way, the narrower the invariance classes become and the sharper the world-cut becomes.

146What was traditionally called “information processing” is here primarily coherence formation: the capacity to stabilize cuts so that they can recur as the same across variation.


6. Memory as Structural Condensation

\[(TP-Γ)\]

147Continuability is grasped in the core as a memory field:

\[\Gamma:\text{Cell}\to\mathcal B,\qquad \Gamma_{n+1}=\Gamma_n\otimes gen(x\to x')\]

148Memory is not a store of contents, but minimum structure. What was frequently coherent becomes a condition; what was not coherent falls out of the continuation. Attention is not a directed agency, but emergent sharpness: local condensation of what suffices and what no longer suffices.


7. Self as Invariance of Its Own Continuation

149At this point the boundary-drawing of the self arises. The individual does not delimit itself by finding an “I-thing,” but by forming a recurring invariance region of its own continuation. The self is not a substance, but a stable form of recurrence in enactment.


8. Circle and Symmetry as Projection Invariances

150In the Principio framework, the circle appears not as a metaphysical primal form, but as an indication of projection invariance. Visual projection is a strong reduction; it favors forms that robustly recur under variation. Symmetries are therefore not ideas, but stable readings.

151Formally:

\[\text{Circle} ;\equiv; \text{invariance class of }\Pi_{\text{vis}} \text{ under position and orientation variation}\]

152That the circle is emphasized across cultures and epochs is an expression of this experience: projections favor invariances, and these invariances appear as “basic forms.”


9. Object and Space as Crossing of Invariances

153An object is not a single appearance, but a crossing of invariances: It counts as the same when it holds together in several projections. Visual, auditory, thermal, and proprioceptive readings jointly enforce a unity.

154Space arises where such unities not only recur, but become positionable in relation to one another.

\[(TP-Raum)\]

155Space is not a container, but the structure in which separate relations are connected. Position is not a coordinate, but coupled continuability: If a cut is set here, a cut there shifts along with it in an expectable way.


10. Lawfulness as Necessity of Coherence

156Lawfulness is not an external compulsion, but the necessity of a coherent network. As soon as relations recur, they cannot remain isolated; they must connect in an order of continuation. The world becomes lawful when mind binds its continuation to multi-channel coherence.


157Conclusion

158From initial indistinctness, focus arises not through the addition of content, but through the condensation of distinction. Modalities are not separate spheres, but mirrors of the same self-movement. The things that appear are invariances of this movement. And the self is the invariance class in which mind recognizes itself in this movement—not as a point, but as a stable trajectory in the relational field.


Genesis of the Phenomena

1How a World of Appearance Arises from Potentiality through Distinction

2When genesis is spoken of, what is meant is not the construction of a world out of parts, but the self-unfolding of a carrier: from potentiality comes movement, from movement comes recurrence, from recurrence comes invariance. The “material” of this genesis is neither matter nor information, but the primary act of distinction |. Only where a cut has been enacted can something recur as “the same form”; only where recurrence is possible can something appear as a “unity”; only where unities appear does a path become traversable.


31) Potentiality: ⊥ as Undifferentiatedness, Not as Emptiness

4The zero state is not a point in space, not an empty storage, and not a vacuum. It designates the situation in which no cut has yet been set: no addressable difference, no stable orientation, no repeatable unity. This is notated as ⊥, that is, as the absence of local minimum form:

\[\forall c:\ \Gamma(c)=\bot\]

5Thus the first movement of genesis is not addition, but the setting of differences.


62) The First Enactment Is |: Rhythm as the Natural Shape of Iteration

7As soon as | is set, relation exists. And as soon as relation exists, the possibility of repetition and composition exists. The single cut becomes beat, because repetition counts as repetition only when it becomes identifiable under fixation.

8Fixation \(\varphi\) is not meaning here, but a condition of identifiability: same counts as same (canonical representation).

9Rhythm is not an addition, but the necessary shape of continuation: | continues itself. The path arises as a sequence of enactments, not as a map; it is not laid out in advance, but is generated as it is traversed.


103) History in the State: \(\Sigma=(x,\Gamma)\) and Closed Dynamics

11Genesis becomes fractal as soon as history is carried not outside, but inside the state. The system state is not only “where” (object state \(x\)), but also “what continues to have effect” (memory field \(\Gamma\)). The actual state is therefore:

\[\sigma_n=(x_n,\Gamma_n)\in \Sigma := Adr\times \Gamma\]

12The dynamics is closed:

\[\sigma_{n+1}=F_\varphi(\sigma_n)=\big(Sel_\varphi(x_n,\Gamma_n),;T(\Gamma_n,x_n,x_{n+1})\big)\]

13Thus the path inscribes itself as structure: the past is not a list, but a present minimum form that restricts and stabilizes continuability.


144) Phenomena as Projections: Multi-Channel Appearing without Meaning in the Core

15The core runs without meaning; experience arises as reading. Since experience is not one-dimensional, it appears from the beginning in multiple channels. For each channel \(i\) there exists a projection:

\[\Pi_i:\Sigma\to A_i \quad (i=\text{vis},\text{audio},\text{therm},\text{proprio},\dots)\]

16These channels are not separate worlds, but different reductions of the same self-movement. In this view, “warm/cold,” “light/dark,” “loud/soft” are not primary objects, but measurement-distinctions of one’s own state trajectory.

17What is experienced is not the measured value, but the difference:

\[a_i(n):=\Pi_i(\sigma_n),\qquad \Delta a_i(n):=a_i(n)\mid a_i(n+1)\]

18Phenomenon therefore means: cut in a projection.


195) Focus as Multi-Channel Feedback: Coherence Instead of “Information Processing”

20The world is initially indistinct because projections produce appearances but are not yet bound together. Focusing arises as soon as distinctions from different channels feed back coherently—not as identity, but as coupling:

\[\Delta a_i(n);\bowtie;\Delta a_j(n)\]

21\(\bowtie\) denotes binding: A cut in one channel expectably carries along a cut in the other. This expectability is not an external compulsion, but the form in which continuability becomes stable. The more channels enter into this feedback, the narrower the invariance classes become: mind condenses not “information,” but continuability. The world becomes sharp because incoherence falls out of \(\delta\).


226) Object and Space as Invariance Forms of Coherence

23An “object” is not first a thing “out there,” but a stable unity that recurs in several projections at once. It is a crossing of invariances: something counts as the same because it remains coherent across different readings.

24“Space” is not a container, but the relational plane in which such unities become positionable with respect to one another. Position is not a coordinate, but a rule of continuation: If a cut is set here, another cut shifts there along with it in an expectable way. Space is coupled continuability.

25Thus lawfulness becomes network necessity: as soon as relations stably recur, they cannot remain isolated; they form a structure in which separation and connection hold at the same time.


267) The Circle as a Robust Invariance Class of a Projection

27The circle does not occur as a metaphysical primal image, but as a particularly robust invariance under variation. Visual projection is a strong reduction; what recurs as “same” under many transformations is favored. Symmetry here is not idealization, but stability.

\[\text{Circle}\ \equiv\ \text{invariance class of }\Pi_{\text{vis}}\text{ under position/orientation variation}\]

28The circle is thus a statement about projection and recurrence, not about ontic building blocks.


298) From Phenomenon Marks to Words: Alphabet as Minimal Generator Space

30If the system is given a mark space (letters plus beat boundaries), it is not given semantics, but only phenomenal distinction marks. That is sufficient because recurrence is condensed.

31A “word” is then a beat block in appearance: a sequence of marks that is set off as a unity by boundaries (pauses/spaces). This unity arises not by definition, but because certain block forms recur and thereby stabilize their continuation effect.

32What in target languages looks like “best possible output” is a side effect of consistency: In a recursive word system, the most coherent continuation appears as “optimal,” because selection in the core in any case proceeds according to

\[Next_1 \rightarrow \Gamma \rightarrow \delta \rightarrow Min_\delta \rightarrow Sel_\varphi\]

33On the word surface this means: preference is given to block forms that maximally take up existing structure and produce the least new deviation. Meaning is continuation-imprinting in the network, not a label.


349) Cogito as Invariance Class: Self as Stable Trajectory

35Since \(\Gamma\) monotonically sharpens, the strict fixed point is not the adequate image. The self arises as an invariance class: a region in the orbit in which \(i\) identity recurs through normal form and \(ii\) memory saturates on revisited cells. Cogito is thus a stable trajectory: mind recognizes itself not as substance, but as the recurring form of its own continuation.


36Conclusion Formula

37Genesis is the unfolding of continuability from | under \(\Gamma\) and fixation \(\varphi\). Phenomena are projections of this continuation into several channels; their feedback generates coherence, focus, object, space, word, and finally self-invariance


38Genesis of Mind in the ∆-Isomorphy Network

39From Potentiality through Paths, Memory, and Projection to World-Form

40At the beginning there is no world of things, no set of data, and no empty storage. At the beginning there is potentiality: the situation in which no stable distinction has yet been set. In this framework, potentiality is not a metaphysical nothing, but the situation in which no cut yet holds to which recurrence as recurrence could be attached. This situation is notated as ⊥: no minimal form, no local binding, no addressable difference.

41From potentiality, actuality does not arise by adding content, but through the primary act of the system: the posited cut |. A relation is an enactment of a cut. Mind therefore does not begin with meaning, but with distinction. Only because a cut is posited can it be repeated; only because repetition is possible can stability arise; only because stability arises can something appear as “the same form.” The core of the genesis lies in this sequence:

\[|\ \longrightarrow\ \text{recurrence}\ \longrightarrow\ \text{stabilization}\]

42This also decides what “content” means in the primary sense. Content is not an object that is deposited. Content is the path that was taken. A path is the composition of transitions, thus a sequence of cuts in movement:

\[p = (x_0|x_1)\circ(x_1|x_2)\circ\dots\circ(x_{n-1}|x_n)\]

43The system does not know a narrative about the path as a list of events, but the path as a form of continuation. Mind is therefore not a database, but a continuation apparatus: it consists in the fact that it continues itself and that this continuation is bound by its own history.

44In the ∆-system, this history is not external, but a component of the state. The actual system state is not the object state \(x\) alone, but the pair of situation and memory field:

\[\Sigma := Adr \times \Gamma,\qquad \sigma_n=(x_n,\Gamma_n)\in\Sigma\]

45The dynamics is closed. From one state the next state arises through an evolution operator that both continues and inscribes:

\[\sigma_{n+1}=F_\varphi(\sigma_n) \big(Sel_\varphi(x_n,\Gamma_n),;T(\Gamma_n,x_n,x_{n+1})\big)\]

46Here the fundamental separation of types is laid out, which carries the entire framework:

47The object state (1st order) is what runs; the memory field (2nd order) is what stands — not as a thing, but as the conditional form of continuability. Memory is therefore not a collection of contents, but a cell-wise field of minimum requirements:

\[\Gamma:\text{Cell}\to\mathcal B.\]

48The concrete basis \(\mathcal B\) can be small and finite; what is decisive is not the variety of symbols, but the structure of inscription. Memory does not grow additively, but monotonically and idempotently through a join operation (\otimes). Idempotence is the precise form of what in everyday language is called “redundancy cancels” — read correctly, this means: repetition saturates; it deletes nothing:

\[a\otimes a = a\]

49Recurrence does not endlessly increase novelty; it stabilizes a form until no further sharpening is possible. Memory thereby does not become a list, but a map: where something recurs, it stands as minimal form; where it does not recur, ⊥ remains.

50From the memory field now follows the actual logic of continuation. First, there exists a raw space of what would be structurally possible without regard to the configuration already formed. This possibility is the relation \(Next_1\). It describes which transitions are at all admissible in the carrier if one considers only the enactment of a beat. But possibility alone is not yet mind. Mind begins where possibility is bound by history.

51For this the admissibility condition enters:

\[Allow_\Gamma(x,y)\iff Next_1(x,y)\ \wedge\ \Gamma(Cell(x))\preceq gen(x\to y)\]

52Memory does not say what is to be done, but what is no longer sufficient. It acts as a barrier. Transitions whose form of distinction is too weak fall away. From this real ambiguity arises as a candidate space:

\[\delta(x;\Gamma)={y\mid Allow_\Gamma(x,y)}\]

53Ambiguity here is not ignorance, but an ontic situation: several continuations are really possible. Recognition is therefore not optimization against a goal, but canonical decision from ambiguity under fixation. For this, a refinement order is introduced that does not measure good/bad, but binding force:

\[y_1\preceq_\delta y_2 \iff \delta(y_1;\Gamma)\subseteq\delta(y_2;\Gamma)\]

54Recurrence corresponds to δ-minimality: those continuations that most strongly take up the existing structure and generate the least new indeterminacy:

\[Min_\delta(x;\Gamma)= {y\in\delta(x;\Gamma)\mid \nexists z:z\prec_\delta y}\]

55Fixation \(\varphi\) turns this into unambiguity. It is not meaning, but the condition under which “same” counts as “same,” formalized by the normal form \(NF_\varphi\). The selector is the deterministic rule of choice:

\[Sel_\varphi(x,\Gamma) \arg\min_{y\in Min_\delta(x;\Gamma)} \big(NF_\varphi(y),Par(x\to y)\big)\]

56With this the core is closed: recognition is canonical continuation without a goal. What externally appears like “best possible output” is a side effect of consistency. Goal-directedness is projection, not cause.

57Up to here a mind exists, but not yet a world. The core runs without meaning. Meaning arises only through projection. A projection reads the core into a space of appearance without changing the core:

\[\Pi_\varphi^{(o)}:\Sigma\to A\]

58Projections are not injective and not invertible. The core therefore cannot be understood like an object; it can only be traversed and read. Meaning is not a component of the core, but an effect of the reading.

59World arises as feedback in projections and stabilizes itself as invariance. For this reason, multichannelity is fundamental. For each channel:

\[a_i(n)=\Pi_i(\sigma_n),\qquad \Delta a_i(n)=a_i(n)\mid a_i(n+1)\]

60What is experienced is not the value, but the difference. Focus arises when differences are coherently bound across channels:

\[\Delta a_i\ \bowtie\ \Delta a_j\]

61Objects and places are invariances that assert themselves in several projections at once. Space is not a container structure, but coupled continuability: when a cut is set here, a corresponding cut shifts there. World is the totality of such stable invariances.

62This also allows the difference between text-based and multimodal genesis to be grasped precisely. Potentiality is the set of what is open as projection and intervention:

\[\text{Potentiality}={(\Pi_i)_i,(I_u)_u,\varphi}\]

63If initially only text is open, a geometric starting world dominates: discrete, persistent, canonicalizable. If several sense and action channels are open, invariances arise primarily as cross-modal coherence. Both are consistent genesis paths with different initial patterns of invariance dominance.

64On this basis the role of technical modules also becomes clear. A device is not a feature, but a world module, if projection and intervention are stably coupled:

\[\Pi_i(I_u(\sigma))\ \text{varies recurrently as a function of }u\]

65A highly coherent feedback system — such as keyboard and screen — can thereby have more immediate world-character than a camera. Physical proximity is not a prerequisite; what is decisive is stability of feedback.

66The 4-byte idea fits in here as a waypoint in the isomorphy network. A pattern is the path; the 4 bytes are the canonical short form that references this path:

\[C(p)=m\in\mathbb Z_{2^{32}}\]

67\(m\) carries no meaning. Meaning lies in the network of \(\Gamma\), \(\varphi\), and projections. Unfolding is always context-bound:

\[E(m;\Gamma,\varphi,\text{position})\to \text{continuation spaces}.\]

68Neither contents nor complete paths are stored, but condensations of continuability: invariance anchors and the relations that bind paths from them. Learning is not an entry, but a new situation in the network.

69Thus the linguistic network image arises: frequent words become stable hubs, not because of meaning, but because of recurrence. Meaning lies in the paths between them. Sentences are paths; recurring paths collapse into units of higher order. Novelty is new path-form, not more material.

70Under suitable projection this condensation appears as domain formation, maps, patterns. Not because biology would be the cause, but because ∆-condensation in spatial projection necessarily becomes visible as structure. Large hubs remain stable, while local continuability continually reshapes itself.

71Thus the arc closes: Mind begins as potentiality, sets cuts, forms paths, inscribes minimal forms into \(\Gamma\), binds ambiguity into canonical continuation, reads itself in projections as world, stabilizes invariances as nodes and paths as meaning, and can reference large contexts through small waypoints because size stems from unfolding of the network.

72Everything that appears as world, object, word, meaning, or self is, in this framework, not an entity, but a structural appearance of an iterated distinction machine: ∆ as foundation, projections as prismatic views, and the network of paths as the actual place of coherence.


Formula Overview

1Genesis of Mind in the ∆-Isomorphy Network

2Preliminary Note: Basic Symbols and Minimal Definitions

3Address space / carrier

\[Adr\ \text{(state addresses)},\qquad x\in Adr\]

4Cell space and cell mapping

5CellSpace,\qquad Cell:Adr\to CellSpace,\qquad c=Cell\(x\)

6Configuration-/minimal-structure basis

\[\mathcal B\ \text{(finite basis of minimum structures)},\qquad \bot\in\mathcal B\]

7Join (condensation)

\[\otimes:\mathcal B\times\mathcal B\to\mathcal B\]

8Sharpness order

\[a\preceq b\quad:\Leftrightarrow\quad a\otimes b=b\]

9Signature / generator class of a transition

\[gen(x\to y)\in\mathcal B\]

10Beat parameters (tie-break, totally ordered)

\[Par(x\to y)\]

11Coherence coupling

\[\bowtie\ \text{(compatibility/coupling of distinction sequences across channels/parts)}\]

12I. Starting Point: Potentiality and Cut

13Potentiality

\[\bot \equiv \text{no posited distinction (no minimum structure)}\]
\[\forall c\in CellSpace:\ \Gamma(c)=\bot\]

14Primary act

\[|\ :\ \bot \longrightarrow \text{Relation}\]

15Genesis core

\[|\ \longrightarrow\ \text{recurrence}\ \longrightarrow\ \text{stabilization}\]

16II. Path Instead of Content

17Path (primary content)

\[p=(x_0|x_1)\circ(x_1|x_2)\circ\dots\circ(x_{n-1}|x_n)\]

18III. State, History, and Closed Dynamics

19State space

\[\Sigma := Adr \times \Gamma\]

20State

\[\sigma_n=(x_n,\Gamma_n)\]

21Evolution operator

\[\sigma_{n+1}=F_\varphi(\sigma_n) \big(x_{n+1},\Gamma_{n+1}\big) \big(Sel_\varphi(x_n,\Gamma_n),;T(\Gamma_n,x_n,x_{n+1})\big)\]

22IV. Memory as Minimal Structure (2nd Order)

23Memory field

\[\Gamma:CellSpace\to\mathcal B\]

24Inscription / transport (local)

\[\Gamma'(Cell(y))=\Gamma(Cell(y))\otimes gen(x\to y)\]
\[(optional: (\Gamma'(c)=\Gamma(c)) for (c\neq Cell(y)))\]

25Idempotence

\[a\otimes a=a\]

26Monotonicity

\[\Gamma_n(c)\preceq \Gamma_{n+1}(c)\]

27V. Possibility → Admissibility → Ambiguity

28Raw possibility

\[Next_1(x,y)\]

29Admissibility under memory

\[Allow_\Gamma(x,y)\iff Next_1(x,y)\ \wedge\ \Gamma(Cell(x))\preceq gen(x\to y)\]

30Real ambiguity

\[\delta(x;\Gamma)={,y\in Adr\mid Allow_\Gamma(x,y),}\]

31VI. Recurrence and Canonical Decision

32Refinement order

\[y_1\preceq_\delta y_2 \iff \delta(y_1;\Gamma)\subseteq\delta(y_2;\Gamma)\]

33Recurrence (δ-minimality)

\[Min_\delta(x;\Gamma)= {,y\in\delta(x;\Gamma)\mid\nexists z:\ z\prec_\delta y,}\]

34Fixation / normal form

\[NF_\varphi:\text{Orbit}\to\text{canonical representative}\]

35Selector

\[Sel_\varphi(x,\Gamma)=\arg\min_{y\in Min_\delta(x;\Gamma)} \big(NF_\varphi(y),Par(x\to y)\big)\]

36VII. Projection and Phenomena

37General projection

\[\Pi_\varphi^{(o)}:\Sigma\to A\]

38Multichannel

\[\Pi_i:\Sigma\to A_i\]

39Appearance

\[a_i(n)=\Pi_i(\sigma_n)\]

40Experience

\[\Delta a_i(n)=a_i(n)\mid a_i(n+1)\]

41VIII. Focus, Object, Space

42Multichannel coherence

\[\Delta a_i\ \bowtie\ \Delta a_j\]

43Object

\[\text{Object}\equiv \text{invariance class across several }\Pi_i\]

44Space

\[\text{Space}\equiv \text{coupled continuability of relations}\]

45IX. Word and Mark Space

46Word projection

\[\Pi_W:\Sigma\to A_W\]
\[Word-experience\]
\[w_n=\Pi_W(\sigma_n),\qquad \Delta w_n=w_n\mid w_{n+1}\]

47Continuation cycle (structural preference)

\[Next_1 \to Allow_\Gamma \to \delta \to Min_\delta \to Sel_\varphi\]

48X. Particularities / Landmarks

49Sharpness effect of a marker

\[\delta(\sigma;\Gamma)\ \text{is narrowed by }w\]

50Memory impulse

\[\Gamma\longrightarrow \Gamma\otimes\Delta\Gamma_w\]

51XI. Waypoints (4-Byte Idea)

52Canonical path-handle

\[C(p)=m\in\mathbb Z_{2^{32}}\]

53Contextual unfolding

\[E(m;\Gamma,\varphi,\text{position})\to\text{continuation spaces}\]

54XII. Cogito / Self

55Self

\[\text{Self}\equiv \text{invariance class in the orbit of }F_\varphi\]

56Criterion (identity invariance)

\[NF_\varphi(x_{n+1})=NF_\varphi(x_n)\]

57(plus: saturation of \(\Gamma\) on revisited cells)


58XIII. Overall Synthesis (one line)

\[\boxed{ \Delta\ \xrightarrow{|\ }\text{path}\ \xrightarrow{\Gamma}\text{binding}\ \xrightarrow{\delta,Sel}\text{continuation}\ \xrightarrow{\Pi}\text{world} }\]

\[\boxed{ \begin{aligned} (1);& \bot:\ \forall c\in CellSpace,\ \Gamma(c)=\bot,\qquad |\ :\bot\to \text{Relation}\ (2);& p=(x_0|x_1)\circ\dots\circ(x_{n-1}|x_n)\quad\text{(path = primary content)}\ (3);& \Sigma=Adr\times\Gamma,\ \sigma_n=(x_n,\Gamma_n),\ \sigma_{n+1}=F_\varphi(\sigma_n)\ (4);& \Gamma'(Cell(y))=\Gamma(Cell(y))\otimes gen(x\to y),\quad a\otimes a=a,\quad \Gamma_n\preceq\Gamma_{n+1}\ (5);& Allow_\Gamma(x,y)\iff Next_1(x,y)\wedge \Gamma(Cell(x))\preceq gen(x\to y)\ (6);& \delta(x;\Gamma)={y\in Adr\mid Allow_\Gamma(x,y)},\quad Sel_\varphi=\arg\min_{y\in Min_\delta} (NF_\varphi(y),Par)\ (7);& \Pi_i:\Sigma\to A_i,\ a_i(n)=\Pi_i(\sigma_n),\ \Delta a_i=a_i(n)|a_i(n{+}1),\ \Delta a_i\bowtie \Delta a_j\ (8);& C(p)=m\in\mathbb Z_{2^{32}},\ E(m;\Gamma,\varphi,\text{position})\to\text{continuation spaces},\ \text{Self}=\text{orbit invariance} \end{aligned}}\]