DEEN
Download this volume

Volume VIII

Tractatus Principio

—

On Difference

Volume VIII

Book of Application

by

C.H.F. Warnke

Table of Contents

Preface: The folding-back of the seven volumes Chapter I: From difference to Delta Chapter II: From Delta to number Chapter III: From number to fractal number Chapter IV: From number to operation Chapter V: From operation to geometry Chapter VI: From geometry to observer Chapter VII: From observer to trace Chapter VIII: From trace to reading Chapter IX: The isomorphy of reading Chapter X: Rules of application Appendix: The sign evolution and note on use Index: Quick register Index: Basic formulas at a glance Index: Symbol overview of the Tractatus Principio Part II: From the sign to the executable sign (Python as representation of difference) Preface: The second writing Chapter X: Code as inscription Chapter XI: The three layers of code Chapter XII: The stroke in code Chapter XIII: Delta as transition Chapter XIV: Number and mark Chapter XV: Operators as modes of binding Chapter XVI: Variable and opening Chapter XVII: Gate and visibility Chapter XVIII: Path, loop, and trace Chapter XIX: Observer and context in code Chapter XX: Projection, binding, and equality Chapter XXI: Normal form and readout Chapter XXII: Error as relational error Chapter XXIII: A complete double reading Chapter XXIV: Python as second notation Chapter XXV: Basic rules of Delta-constraint coding Conclusion: The executable sign

1Preface

2The folding-back of the seven volumes

3Volume VIII introduces no new theory.

4It folds the seven preceding volumes back into an operative sign sequence.

\[| \rightarrow \Delta \rightarrow 0\text{–}9 \rightarrow Operation \rightarrow Geometry \rightarrow Observer \rightarrow Trace \rightarrow Reading\]

5The signs are not grounded anew.

6They are set in their application.

7The formula is not read as an object.

8It is used as enactment of difference.

9The evolution of signs and the isomorphy of reading

Chapter I

From difference to Delta

\[|\]

1The difference of first order.

\[A|B\]

2The difference of second order.

\[(A|B)|(C|D)\]

3The difference of third order.

\[|(|)\]

4The self-referentiality of difference.

\[\Delta=|(|)\]

5Delta as smallest effective self-referentiality.

6Delta as beat.

7Delta as transition.

8Delta as marking.

9Delta as self-rotation.

10Delta as drift.

11No classes of Delta.

12No separate kinds of difference.

13The multiplicity appears in the third order of the same relation.

Chapter II

From Delta to number

\[\Delta \rightarrow 0|1|2|3|4|5|6|7|8|9\]

1The number as stabilized reading of Delta.

\[n:=read(\Sigma_n)\]

2There are only the numbers:

\[\boxed{ 0,1,2,3,4,5,6,7,8,9 }\]

3The numbers as visible basic marks of a complete shell.

\[0\]

4closed possibility.

\[1\]

5first marking.

\[2\]

6mirror relation.

\[3\]

7orientation.

\[4\]

8context stabilization.

\[5 ] self-similarity. [ 6\]

9division resonance.

\[7\]

10drift.

\[8\]

11double fourfold folding.

\[9\]

12break edge.

\[9:=\kappa\]

Chapter III

From number to fractal number

\[9\rightarrow1|0 ] [ 10:=1|0\]

1Ten is not an eleventh number.

2Ten is the first visible relation of a new reading shell.

3Multi-digit numbers as fractal inscriptions of the same ten marks.

\[125:=1|2|5 ] [ 2026:=2|0|2|6\]

4The place is not a container.

5The place is relational depth.

\[\Delta_2|\Delta_1|\Delta_0\]

6Horizontal effect within a shell.

7Vertical effect between shells.

8Feedback effect of lower shells on higher shells.

9Carry as break-edge feedback effect.

\[199\rightarrow200\]

10Digit sum as basic-shell reading.

11Decimal point as scale flip.

\[|_.\]

12Negative number as reading direction.

\[-\Delta|+\Delta\]

Chapter IV

From number to operation

1The number marks do not act on one another as objects.

2They enter into modes of difference.

3Expansion:

\[|_+\]

4Contraction:

\[|_-\]

5Resonance:

\[|_\times\]

6Disentangling:

\[|_\div\]

7Exponentiation:

\[|^{\phantom{x}}\]

8Rooting:

\[|_{\sqrt{\phantom{x}}}\]

9Equilibrium:

\[|_= ] Non-coincidence: [ |_{\neq}\]

10Differential:

\[|_\Delta\]

11Integral:

\[|\Sigma|\Delta\]

12The operator produces no value.

13It orients the relation.

\[a|_+b ] [ a|_-b ] [ a|_\times b ] [ a|_\div b ] [ a|_=b\]

14Calculation as ordered inscription.

\[I=(m_0,m_1,\dots,m_n)\]

Chapter V

From operation to geometry

1Every operation possesses a geometrical reading.

\[0|1\]

2Radius.

\[0|2\]

3Diameter and axis.

\[0|3\]

4Triangle and orientation.

\[0|4\]

5Square and stable fourfold order.

\[0|5\]

6Pentagon and self-similarity.

\[0|6\]

7Hexagon and division resonance.

\[0|7\]

8Heptagon and drift.

\[0|8\]

9Octagon and double fourfold folding.

\[0|9\]

10Nonagon and break edge.

11The number is geometrical relation.

12Geometry is number reading.

\[Number\cong Geometry ] [ \pi\]

13as relation of closed and linear reading.

\[\varphi\]

14as self-similarity relation.

\[e\]

15as stable self-reference of the rate of change.

\[39{,}19\]

16as self-reference constant of the number relation.

\[i:=R_{90^\circ}\]

17as rotation address.

\[\Delta=2{,}25^\circ\]

18as smallest self-rotation.

Chapter VI

From geometry to observer

1Geometry is not read from outside.

2The reading possesses an orientation.

3Frozen frame:

\[\vert\_\vert\]

4Marked frame:

\[|_\Delta\]

5The Delta states:

\[0\Delta\]

6Frame.

\[1\Delta\]

7Event.

\[2\Delta\]

8Axis.

\[3\Delta\]

9Observer.

\[4\Delta\]

10full context.

\[4\Delta=\Delta^\Delta\]

11The observer as oriented incompleteness of the context.

\[3\Delta=4\Delta-\Delta\]

12Hole direction:

\[h(o)\]

13Orientation space:

\[\mathcal O\]

14Transition space:

\[\mathcal T\]

15Time as sequence of orientation changes.

\[o_0\rightarrow o_1\rightarrow o_2\rightarrow\dots\]

Chapter VII

From observer to trace

1The inscription is read as path.

\[I\rightarrow\gamma_I\]

2The path produces no number.

3It carries a trace.

\[\gamma_I\rightarrow\Sigma(\gamma_I) ] [ \Sigma(\gamma) := \sum_{e\in\gamma}w(e)\]

4Visibility:

\[L_n\]

5Gate:

\[\chi_{\mathrm{vis}} ] [ \chi_{\mathrm{gate}}\]

6Step contribution:

\[H_n := \chi_{\mathrm{vis}}(e_n) \chi_{\mathrm{gate}}(e_n) w(e_n)\]

7Trace accumulation:

\[\Sigma_{n+1} = \Sigma_n+H_n\]

8The trace as memory of the relation.

9Holonomy as difference of the return.

\[\gamma(0)=\gamma(1)\]

10and nevertheless:

\[\Sigma(\gamma)\neq0\]

11Return to the starting place is not return to the starting position.

Chapter VIII

From trace to reading

1The trace is projected.

\[\Pi_i(\Sigma)\]

2The projections are bound.

\[\bowtie\]

3The drift is read.

\[\Delta\varphi\]

4The relation locks in.

\[Lock_{\frac34}\]

5The trace forms a normal form.

\[NF(\Sigma)\]

6The normal form becomes publicly readable.

\[read(NF(\Sigma))\]

7The complete enactment of reading:

\[I \rightarrow \gamma_I \rightarrow \Sigma \rightarrow \Pi \rightarrow \bowtie \rightarrow Lock_{\frac34} \rightarrow NF \rightarrow read\]

8The result is not a produced object.

\[Ergebnis:=read(NF(\Sigma))\]

9Equality is not identity of things.

\[|_=\]

10denotes the locking-in of the same trace under a different reading.

\[A|_=B ] [ \Sigma_A\equiv_\Sigma\Sigma_B\]

Chapter IX

The isomorphy of reading

1The signs do not designate separate worlds.

2They are different readings of the same order of difference.

\[| \cong \Delta \cong Number \cong Geometry \cong Observer \cong Trace \cong Reading\]

3Not as equality of objects.

4Not as interchangeability of the signs.

5But as preservation of the same relational structure.

\[| \rightarrow \Delta \rightarrow 0\text{–}9 \rightarrow I \rightarrow \gamma \rightarrow \Sigma \rightarrow NF \rightarrow read\]

6and backward:

\[read \rightarrow NF \rightarrow \Sigma \rightarrow \gamma \rightarrow I \rightarrow 0\text{–}9 \rightarrow \Delta \rightarrow |\]

7The read-back preserves the trace class.

\[recover(read(\Sigma)) \equiv_\Sigma \Sigma\]

8Validity:

\[valid(L) \iff recover(L)\equiv_\Sigma\Sigma\]

9The forms change.

10The relation remains readable back.

11The signs develop.

12The reading remains isomorphic.

Chapter X

Rules of Application

\[1. \quad No\ sign\ denotes\ a\ thing. ] [ 2. \quad Every\ sign\ is\ a\ reading\ position\ of\ the\ difference. ] [ 3. \quad \Delta\ forms\ no\ classes\ of\ itself. ] [ 4. \quad There\ are\ only\ the\ numbers\ 0\ to\ 9. ] [ 5. \quad Multi-digitness\ is\ fractal\ relation. ] [ 6. \quad 9\ is\ the\ fracture\ edge. ] [ 7. \quad 10=1|0. ] [ 8. \quad Operators\ align\ relations. ] [ 9. \quad Calculation\ is\ inscription. ] [ 10. \quad Inscription\ becomes\ path. ] [ 11. \quad Path\ becomes\ trace. ] [ 12. \quad Trace\ is\ read. ] [ 13. \quad Equality\ is\ locking\text{-}in. ] [ 14. \quad The\ result\ is\ readout. ] [ 15. \quad Every\ readout\ must\ remain\ readable\ back\ to\ its\ trace. ] [ 16. \quad Different\ readings\ of\ the\ same\ trace\ are\ isomorphic.\]

1Appendix

2The Sign Evolution

\[| ] [ \downarrow ] [ A|B ] [ \downarrow ] [ |(|) ] [ \downarrow ] [ \Delta ] [ \downarrow ] [ 0|1|2|3|4|5|6|7|8|9 ] [ \downarrow ] [ 1|0 ] [ \downarrow ] [ I ] [ \downarrow ] [ \gamma ] [ \downarrow ] [ \Sigma ] [ \downarrow ] [ NF ] [ \downarrow ] [ read ] [ \boxed{ | \cong \Delta \cong Number \cong Geometry \cong Observer \cong Trace \cong Reading }\]

3Usage Note

4How this book is to be used

5This book is a formula collection of the Tractatus Principio.

6It introduces no new theory.

7It does not ground the signs anew.

8It gathers the basic forms, operators, transitions, and reading rules of the seven preceding volumes in a common operative order.

9The entries are not to be read as definitions separated from one another.

10Every sign receives its meaning from its position in the complete enactment:

\[| \rightarrow \Delta \rightarrow 0\text{–}9 \rightarrow Operation \rightarrow Geometry \rightarrow Observer \rightarrow Trace \rightarrow Reading\]

11The formulas denote no objects.

12They set reading positions of the difference.

13A formula is used by reading its signs as relational positions, transferring them into a path, integrating them as a trace, and bringing them into a read-back capable normal form.

14The basic enactment is:

\[\boxed{ I \rightarrow \gamma_I \rightarrow \Sigma(\gamma_I) \rightarrow \Pi_i(\Sigma) \rightarrow \bowtie \rightarrow Lock_{\frac34} \rightarrow NF(\Sigma) \rightarrow read }\]

15Here the following holds:

\[\boxed{ \text{It is not things that are processed.} } ] [ \boxed{ \text{Differences are set, enacted, bound, and read.} }\]

16Quick Index

17By Basic Concepts

18Sought

	Sign
	Section

19Difference

\[|\]

20Poles of a relation

\[A|B\]
\[Self-referentiality [ |(|) ]\]
	Delta
	\Delta
	Basic Formulas I
	Possibility
	\odot
	Basic Formulas II
	Null
	0
	Basic Formulas II
	Impossibility
	\boxdot
	Basic Formulas II
	Drift
	\Delta\varphi
	Basic Formulas II
	Number
	n:=read(\Sigma_n)
	Basic Formulas III
	Fracture edge
	9:=\kappa
	Basic Formulas III

21new reading shell

\[10:=1|0\]
	multi-digit number
	a
	b

22negative number

\[-\Delta|+\Delta\]

23Addition

\[|_+\]

24Subtraction

\[|_-\]

25Multiplication

\[|_\times\]

26Division

\[|_\div\]

27Equality

\[|_=\]
\[Non-coincidence [ |_{\neq} ]\]

28Differential

\[|_\Delta\]

29Integral

\[|\Sigma|_\Delta\]

30Frame

\[\vert\_\vert\]
	Observer
	3\Delta
	Observer
	Context
	4\Delta
	Observer
	Hole direction
	h(o)
	Observer
	Inscription
	I
	Reading enactment
	Path
	\gamma_I
	Reading enactment
	Edge
	e_n
	Reading enactment
	Gate
	\chi_{\mathrm{gate}}
	Trace
	Visibility
	\chi_{\mathrm{vis}}
	Trace
	Step contribution
	H_n
	Trace
	Trace
	\Sigma(\gamma)
	Trace
	Holonomy
	\Omega(n)
	Holonomy
	Projection
	\Pi_i
	Projection
	Binding
	\bowtie
	Projection
	Shaking space
	\mathcal L_{\frac34}
	¾-corner
	Locking-in
	Lock_{\frac34}
	¾-corner
	Normal form
	NF(\Sigma)
	Reading
	Readout
	read(\Sigma)
	Reading
	Reading back
	recover
	Reading
	Validity
	valid(L)
	Reading
	Trace-class equality
	\equiv_\Sigma
	Reading

31By Application

32Application

	Basic form

33Set relation

\[x|y\]

34Extend relation

\[x|_+y\]

35Contract relation

\[x|_-y\]

36Couple rhythms

\[x|_\times y\]

37Unfold total figure

\[x|_\div y\]

38Iterate repetition

\[x|^{y}\]

39Read iteration back

\[|_{\sqrt{\phantom{x}}}\]

40Check locking-in

\[x|_=y\]

41Mark non-coincidence

\[x|_{\neq}y\]

42Read local change

\[|_\Delta\]

43Accumulate change

\[|\Sigma|_\Delta\]

44Change scale

\[|_.\]
	Reverse reading direction
	-\Delta
	Form inscription
	I=(m_0,\dots,m_n)
	Clock inscription
	I\rightarrow\gamma_I
	Integrate trace
	\Sigma(\gamma)
	Bind projections
	\Pi_i\bowtie\Pi_j
	Read minimal drift position
	L^*
	Form normal form
	NF(\Sigma)
	Display result
	read(NF(\Sigma))
	Check result
	recover(read(\Sigma))\equiv_\Sigma\Sigma

45Basic Formulas at a Glance

46I. Difference and Self-Referentiality

47Difference of the first order

\[\boxed{|}\]

48Pure difference.

49No executed poles yet.

50The difference separates no already existing objects.

51It opens the possibility of relational position.

52Difference of the second order

\[\boxed{A|B}\]

53The difference appears in two relational poles.

54A and B do not exist before their relation.

55They are positions of the same difference.

56Difference of the third order

\[\boxed{(A|B)|(C|D)}\]

57or:

\[\boxed{|(|)}\]

58The difference differentiates its own differences.

59Relational depth arises.

60Delta

\[\boxed{\Delta=|(|)}\]

61Delta is the smallest effective self-referentiality of the difference.

62Delta appears as:

\[\Delta \cong Beat \cong Transition \cong Marking \cong Rotation \cong Drift\]

63These expressions denote no different kinds of Delta.

64They are different operative readings of the same smallest referentiality.

65II. Possibility, Mirroring, and Impossibility

66Possible Geometry

\[\boxed{\odot}\]

67Closed possibility.

68Read-back capable unfolding of a relation.

69Null

\[\boxed{0}\]

70Null is not nothingness.

71Null is the closed cutting, mirroring, and equilibrium position of the difference.

\[\boxed{0\cong|}\]

72Not as interchangeability of the signs, but as isomorphic reading of the same relational basic structure.

73Impossible Geometry

\[\boxed{\boxdot}\]

74Open, drifting, or not yet locked-in relation.

75The impossible denotes no second object.

76It denotes the not-yet-closed position of a relation.

77Complete Process

\[\boxed{ \odot \rightarrow 0 \rightarrow \boxdot }\]

78Unfolding, mirroring, and testing.

79Locking-in does not lead back to the old possibility.

\[\boxed{ \boxdot \rightarrow |_= \rightarrow \odot' }\]

80The new closed possibility carries the trace of the enactment it has undergone.

81Drift

\[\boxed{\Delta\varphi\neq0}\]

82Difference movement not yet locked in.

83Drift is not a deviation from an externally given norm.

84It is the still open difference between possible relational positions.

85III. Number and Reading Shell

86Number

\[\boxed{n:=read(\Sigma_n)}\]

87A number is the visible reading of a stabilized trace.

88The number is not an original object.

89It is a public readout.

90Complete mark space

\[\boxed{ M:={0,1,2,3,4,5,6,7,8,9} }\]

91There are only the ten visible basic marks:

\[\boxed{0,1,2,3,4,5,6,7,8,9}\]

92All multi-digit numbers are relational inscriptions of the same marks.

93Number constitution

\[0\]

94Closed possibility.

\[1\]

95First marking.

\[2\]

96Mirror relation.

\[3\]

97Orientation.

\[4\]

98Context stabilization.

\[5\]

99Self-similarity opening.

\[6\]

100Division resonance.

\[7\]

101Drifting closure.

\[8\]

102Double fourfold folding.

\[9\]

103Break edge and cycle closure.

104Break edge

\[\boxed{9:=\kappa}\]

105The nine closes the visible basic shell.

106It is at the same time the edge at which the reading passes into a new shell.

107New reading shell

\[\boxed{9\rightarrow1|0} ] [ \boxed{10:=1|0}\]

108Ten is not an eleventh basic mark.

109Ten is the first visible relation of a new reading shell.

110Multi-digit number

\[\boxed{125:=1|2|5} ] [ \boxed{2026:=2|0|2|6}\]

111A multi-digit number is an ordered fractal inscription.

112The place is not a container.

113It is relational depth.

114Levels of a number

\[\boxed{\Delta_2|\Delta_1|\Delta_0} ] [ \Delta_0\]

115immediate beat and ones shell.

\[\Delta_1\]

116first mirroring and tens shell.

\[\Delta_2\]

117meta-relation and hundreds shell.

118The levels do not designate different kinds of numbers.

119They designate different relational positions of the same marks.

120Carry

\[\boxed{199\rightarrow200}\]

121Carry is break-edge retroaction.

122A closed lower shell changes the position of the higher shell.

123Decimal point

\[\boxed{|_.}\]

124The decimal point is a scale flip.

125It does not separate two number worlds.

126It changes the direction in which relational depth is read.

127Negative number

\[\boxed{-\Delta|+\Delta}\]

128Negative and positive designate reading directions.

129Negative numbers do not form a second number world.

\[\boxed{-1|0|1}\]

130is the complete axis relation of negative reading direction, zero, and positive reading direction.

131Operators

132Basic rule

\[\boxed{ \text{The operator does not generate a value.} } ] [ \boxed{ \text{The operator aligns the relation.} }\]

133The visible kind of calculation designates the mode in which number marks are related to one another.

134Expansion

\[\boxed{x|_+y}\]

135x expands by y.

136A relation is opened by a further relation.

137Public reading:

\[x+y\]

138Contraction

\[\boxed{x|_-y}\]

139x contracts by y.

140A relation is led back to a narrower position.

141Public reading:

\[x-y\]

142Resonance

\[\boxed{x|_\times y}\]

143x resonates with y.

144Relations couple their levels, repetitions, or rhythms.

145Multiplication is not merely repeated addition.

146Public reading:

\[x\times y\]

147Disentanglement

\[\boxed{x|_\div y}\]

148x is disentangled by y.

149An overall figure is read into recurring or supporting relations.

150Public reading:

\[x\div y\]

151Exponentiation

\[\boxed{x|^{y}}\]

152A relational effect itself becomes the carrier of its repetition.

153Exponentiation is iterated iteration.

154Rooting

\[\boxed{|_{\sqrt{\phantom{x}}}}\]

155Back-reading of an iterated relation onto its supporting repetition figure.

156Equilibrium

\[\boxed{x|_=y}\]

157The relation between x and y reaches a stable position under a certain reading.

158Equality is not an absolute identity of things.

159It is the locking-in of the same trace under different readings.

\[Non-coincidence [ \boxed{x|_{\neq}y} ]\]

160The two readings do not lock in under the given position.

161Non-coincidence does not generate a positive object.

162It keeps the open or impossible relation space visible.

163Impossible distinction

\[\boxed{x|_{\triangledown}y}\]

164The relation remains unstable, open, or drifting under the current reading.

165\triangledown does not designate a second kind of Delta.

166It designates Delta in a position not yet locked in.

167Differential

\[\boxed{|_\Delta}\]

168Smallest self-movement.

169Local change in the immediate beat.

170Integral

\[\boxed{|\Sigma|_\Delta}\]

171Accumulated self-movement.

172Integrated difference along a path.

173Geometric basic readings

174Basic rule

\[\boxed{\text{Number}\cong\text{Geometry}}\]

175Not as equality of two objects.

176Number and geometry are different readings of the same relational order.

\[\boxed{0|1}\]

177Radius relation.

\[\boxed{0|2}\]

178Diameter and axis.

\[\boxed{0|3}\]

179Triangle and orientation.

\[\boxed{0|4}\]

180Square and stable fourfold order.

\[\boxed{0|5}\]

181Pentagon and self-similarity relation.

\[\boxed{0|6}\]

182Hexagon and closed division resonance.

\[\boxed{0|7}\]

183Heptagon and drifting division relation.

\[\boxed{0|8}\]

184Octagon and double fourfold folding.

\[\boxed{0|9}\]

185Nonagon and break edge of the current shell.

186Rotation address

\[\boxed{i:=R_{90^\circ}} ] [ \boxed{-i:=R_{-90^\circ}}\]

187i is not an additional kind of number.

188i is the address of a quarter rotation of the same relational figure.

\[i^2:=R_{180^\circ} ] [ i^3:=R_{270^\circ} ] [ i^4:=id\]

189Frame, observer, and context

190Frozen frame

\[\boxed{F:=\vert\_\vert}\]

191Closed local possibility.

192Marked frame

\[\boxed{|_\Delta}\]

193Frame with set Delta marking.

194Direction set

\[\boxed{D:={N,E,S,W}}\]

195Delta configuration

\[\boxed{o:D\rightarrow{0,1}}\]

196o designates the set and open Delta positions around a frame.

197Number of set positions

\[\boxed{k(o):=\sum_{d\in D}o(d)}\]

198Delta states

\[0\Delta\]

199Pure frame.

200No set Delta position.

\[1\Delta\]

201Event.

202One set position.

\[2\Delta\]

203Axis.

204Two set positions.

\[3\Delta\]

205Observer orientation.

206Three set positions and one open direction.

\[4\Delta\]

207Full context space.

208Four set positions.

209Context

\[\boxed{4\Delta=\Delta^\Delta}\]

210The full context is the saturated Delta configuration.

211Observer

\[\boxed{3\Delta=4\Delta-\Delta}\]

212The observer is the oriented incompleteness of the context.

213It is not a position outside the relation.

214It is a relational position with an open direction.

215Hole direction

\[\boxed{h(o)}\]

216Open direction of a three-Delta state.

217Epistemic outside of the observer.

218Orientation space

\[\boxed{ \mathcal O={o_N,o_E,o_S,o_W} }\]

219Transition space

\[\boxed{|\mathcal T|=12}\]

220Twelve directed transitions between four observer orientations.

221Time

\[\boxed{ o_0\rightarrow o_1\rightarrow o_2\rightarrow\dots }\]

222Time is the readable sequence of orientation changes.

223Inscription, path, and beat

224Inscription

\[\boxed{ I=(m_0,m_1,\dots,m_{N-1}) }\]

225Ordered sequence of visible marks and operator edges.

226A calculation is an inscription.

227Path of the inscription

\[\boxed{ \gamma_I=(e_0,e_1,\dots,e_{N-1}) }\]

228Clocked sequence of the operative transitions of an inscription.

229Edge

\[\boxed{ e_n:x_n\rightarrow x_{n+1} }\]

230An operative step within a path.

231Clocked reading operation

\[\boxed{ T_n:=Step\circ O_n }\]
\[Non-commutativity [ \boxed{ Step\circ O\neq O\circ Step } ]\]

232The order of step and reading operation carries meaning.

233A changed order is a changed inscription of the enactment.

234Trace and visibility

235Difference reading of an edge

\[\boxed{w(e)}\]

236Relational contribution of an edge to the trace.

237Visibility

\[\boxed{ \chi_{\mathrm{vis}}(e)\in{0,1} }\]

238Determines whether an edge is visible under the present reading.

239Gate

\[\boxed{ \chi_{\mathrm{gate}}(e)\in{0,1} }\]

240Determines whether a visible edge is admitted to the present enactment.

241Step contribution

\[\boxed{ H_n := \chi_{\mathrm{vis}}(e_n) \cdot \chi_{\mathrm{gate}}(e_n) \cdot w(e_n) }\]

242An edge contributes to the trace only when it is visible and admitted.

243Trace

\[\boxed{ \Sigma(\gamma) := \sum_{e\in\gamma}w(e) }\]

244Integrated difference of a path.

245The trace is the memory of the enacted relation.

246Trace accumulation

\[\boxed{ \Sigma_{n+1} = \Sigma_n+H_n }\]

247Every admitted step changes the readable history of the path.

248Readable edges

\[\boxed{L_n}\]

249Set of the edges visible and admitted in beat n.

250Holonomy

251Accumulated holonomy

\[\boxed{ \Omega(n) := \sum_{t=0}^{n-1}H(t) }\]

252Phase position

\[\boxed{ \phi(n) := \Omega(n)\bmod 2\pi }\]

253Non-vanishing return difference

\[\boxed{\gamma(0)=\gamma(1)}\]

254and at the same time:

\[\boxed{\Sigma(\gamma)\neq0}\]

255Return to the starting place is not necessarily return to the starting position.

256The closed path can carry a non-vanishing trace.

257Projection and binding

258Projection

\[\boxed{ \Pi_i:\Sigma\rightarrow A_i }\]

259A reading channel of a trace.

260Projected readout

\[\boxed{ a_i:=\Pi_i(\Sigma) }\]

261Difference of a reading channel

\[\boxed{ \Delta a_i(n) := a_i(n)|a_i(n+1) }\]

262Binding gate

\[\boxed{ \Delta a_i\bowtie\Delta a_j }\]

263The binding gate checks the compatibility of different trace readings.

264Binding does not mean fusion.

265It denotes the ability of different projections to lock in together.

266The ¾-corner

267¾-corner

\[\boxed{ \Theta_{\frac34} := (e_1,e_2,e_3;D) }\]

268Three set hinge edges and one open drift edge.

269Jostling space

\[\boxed{ \mathcal L_{\frac34} }\]

270Finite space of possible locking-in positions.

271Minimal drift position

\[\boxed{ L^* := \operatorname*{arg\,min}_{L\in\mathcal L_{\frac34}} drift(L) }\]

272Equality snap

\[\boxed{ Lock_{\frac34} }\]

273Finite locking-in of a relation in its minimal drift position.

274The ¾-corner does not generate the result.

275It determines the position in which the bound projections become readable as a common normal form.

Normal form and readout

1Normal form

\[\boxed{ NF(\Sigma) }\]

2Self-resonance reading of a trace.

3Stably positioned readable-back state.

4Public reading

\[\boxed{ read(\Sigma) }\]

5Visible readout of a trace.

6Result

\[\boxed{ Ergebnis:=read(NF(\Sigma)) }\]

7The result is not a newly generated object.

8It is the public reading of a locked-in trace.

9Trace-class equality

\[\boxed{ G\equiv_\Sigma I }\]

10G and I carry the same back-addressable trace class.

11Resonance comparison

\[\boxed{\sim}\]

12Resonance similarity without trace-class equality.

13Reading transition

\[\boxed{\rightsquigarrow}\]

14A form falls under a particular reading onto another visible form.

\[Back-reading [ \boxed{recover} ]\]

15Reconstruction of a trace from its readout.

16Validity

\[\boxed{ valid(L) \iff recover(L)\equiv_\Sigma\Sigma }\]

17A visible label is valid if it remains back-readable onto its trace class.

18Application templates

19Basic schema of an application

\[\boxed{ \text{form inscription} \rightarrow \text{read path} \rightarrow \text{integrate trace} \rightarrow \text{bind projections} \rightarrow \text{minimize drift} \rightarrow \text{read normal form} }\]

20Formal:

\[\boxed{ I \rightarrow \gamma_I \rightarrow \Sigma \rightarrow \Pi \rightarrow \bowtie \rightarrow Lock_{\frac34} \rightarrow NF \rightarrow read }\]

21Addition

22Public inscription

\[a+b\]

23Operative inscription

\[\boxed{a|_+b}\]

24Reading schema

\[a|+b \rightarrow I \rightarrow \gamma_I \rightarrow \Sigma \rightarrow Lock{\frac34} \rightarrow NF \rightarrow read\]

25Mnemonic sentence

26Addition is expansion of a relation.

27Subtraction

28Public inscription

\[a-b\]

29Operative inscription

\[\boxed{a|_-b}\]

30Reading schema

\[a|_-b \rightarrow \text{contraction} \rightarrow \Sigma \rightarrow NF \rightarrow read\]

31Mnemonic sentence

32Subtraction is contraction or reversal of a reading direction.

33Multiplication

34Public inscription

\[a\times b\]

35Operative inscription

\[\boxed{a|_\times b}\]

36Reading schema

\[a|\times b \rightarrow \text{rhythm coupling} \rightarrow \Sigma \rightarrow Lock{\frac34} \rightarrow read\]

37Mnemonic sentence

38Multiplication is resonance of different relational rhythms.

39Division

40Public inscription

\[a\div b\]

41Operative inscription

\[\boxed{a|_\div b}\]

42Reading schema

\[a|_\div b \rightarrow \text{disentanglement} \rightarrow \Pi_i(\Sigma) \rightarrow NF \rightarrow read\]

43Mnemonic sentence

44Division reads a total figure back to its supporting repetition relations.

45Equation

46Public inscription

\[A=B\]

47Operative inscription

\[\boxed{A|_=B}\]

48Condition

\[\boxed{ \Sigma_A\equiv_\Sigma\Sigma_B }\]

49Enactment

\[read_L \rightarrow \Sigma_L ] [ read_R \rightarrow \Sigma_R ] [ \Sigma_L\bowtie\Sigma_R ] [ Lock_{\frac34} ] [ NF\]

50Mnemonic sentence

51Equality is the locking-in of different readings of the same trace class.

52Multi-digit number

53Inscription

\[\boxed{a|b|c}\]

54Layer reading

\[\boxed{\Delta_2|\Delta_1|\Delta_0}\]

55Mnemonic sentence

56Multi-digitness is not a collection of number objects.

57It is relational depth of the same ten basic marks.

58Negative number

59Inscription

\[\boxed{-\Delta|+\Delta}\]

60Mnemonic sentence

61The sign denotes the direction of the reading.

62It generates no second kind of number.

63Geometric reading

64Inscription

\[\boxed{0|n}\]

65Assignment

\[0|1\rightarrow radius ] [ 0|2\rightarrow axis ] [ 0|3\rightarrow orientation ] [ 0|4\rightarrow fourfold order ] [ 0|5\rightarrow self-similarity ] [ 0|6\rightarrow division resonance ] [ 0|7\rightarrow drift ] [ 0|8\rightarrow double fourfold folding ] [ 0|9\rightarrow break edge\]

66Observer change

67Starting position

\[o_n\in\mathcal O\]

68Transition

\[\boxed{o_n\rightarrow o_{n+1}}\]

69Sequence

\[o_0\rightarrow o_1\rightarrow o_2\rightarrow\dots\]

70Mnemonic sentence

71An observer change changes the orientation of the reading.

72It generates no observer outside the relation.

73Holonomic reading

74Closed path

\[\gamma(0)=\gamma(1)\]

75Trace check

\[\Sigma(\gamma)\neq0\]

76Mnemonic sentence

77A closed path can carry an open return difference.

78Back-readability check

79Public form

\[L:=read(\Sigma) ] Back-reading [ recover(L)\]

80Check

\[\boxed{ recover(L)\equiv_\Sigma\Sigma }\]

81Result

\[valid(L)\]

82Mnemonic sentence

83A result is valid if its visible form can be traced back to the enacted difference.

84Entry form for further formulas

85Every new entry of this handbook follows the same order.

86Sign

\[\boxed{\text{Formula}}\]

87Name

88Brief designation of the formula or operation.

89Reading

90What is read relationally in this formula?

91Function

92What change, binding, orientation, or closure is enacted?

93Public form

94How does the formula appear in ordinary mathematical or linguistic notation?

\[Back-reference\]

95From which volume and which conceptual context does the formula arise?

96Hierarchy of Formulas

97A. Basic formulas

98Basic formulas belong to the architecture of the Tractatus Principio itself.

\[| ] [ A|B ] [ |(|) ] [ \Delta=|(|) ] [ 0\cong| ] [ n:=read(\Sigma_n) ] [ \Sigma(\gamma) ] [ recover(read(\Sigma))\equiv_\Sigma\Sigma\]

99They are not bound to a single model.

100B. Transition formulas

101Transition formulas describe the enactment between different forms of reading.

\[I\rightarrow\gamma_I ] [ \gamma_I\rightarrow\Sigma ] [ \Sigma\rightarrow\Pi_i ] [ \Pi_i\rightarrow\bowtie ] [ \bowtie\rightarrow Lock_{\frac34} ] [ Lock_{\frac34}\rightarrow NF ] [ NF\rightarrow read\]

102C. Model formulas

103Model formulas concretize the basic architecture in a specific operative representation.

104These include in particular:

\[D={N,E,S,W} ] [ o:D\rightarrow{0,1} ] [ k(o)=\sum_{d\in D}o(d) ] [ \mathcal O={o_N,o_E,o_S,o_W} ] [ |\mathcal T|=12 ] [ \Theta_{\frac34}=(e_1,e_2,e_3;D) ] [ L^* := \operatorname*{arg\,min}_{L\in\mathcal L_{\frac34}} drift(L)\]

105Model formulas are reading tools that have emerged from the basic architecture.

106They do not replace the basic formulas.

107Back-references into Volumes I to VII

108Volume I – Book of Mathematics

109Look up under:

110Basic references:

\[n:=read(\Sigma_n) ] [ -\Delta|+\Delta ] [ |_\Delta ] [ |\Sigma|_\Delta\]

111Volume II – Book of Physics

112Look up under:

113Basic references:

\[\vert\_\vert ] [ \Delta\varphi ] [ 39{,}19\]

114Volume III – Book of Self-Knowledge

115Look up under:

116Basic references:

\[3\Delta=4\Delta-\Delta ] [ h(o) ] [ \Sigma\]

117Volume IV – Book of Self-Referentiality

118Look up under:

119Basic references:

\[|(|) ] [ \Delta=|(|) ] [ \ominus ] [ \circledast ] [ \mathcal R\]

120Volume V – Book of the Smallest Relationality of Delta

121Look up under:

122Basic references:

\[F:=\vert\_\vert ] [ o:D\rightarrow{0,1} ] [ 3\Delta=4\Delta-\Delta ] [ 4\Delta=\Delta^\Delta\]

123Volume VI – Book of Holonomy

124Look up under:

125Basic references:

\[\gamma_I ] [ H_n ] [ \Sigma(\gamma) ] [ \Omega(n) ] [ \gamma(0)=\gamma(1), \qquad \Sigma(\gamma)\neq0\]

126Volume VII – Book of Reading

127Look up under:

128Basic references:

\[9:=\kappa ] [ 10:=1|0 ] [ I \rightarrow \gamma_I \rightarrow \Sigma \rightarrow \Pi \rightarrow \bowtie \rightarrow Lock_{\frac34} \rightarrow NF \rightarrow read\]

129Rules of Application

\[\boxed{1}\]

130No sign designates a thing.

\[\boxed{2}\]

131Every sign is a reading-position of difference.

\[\boxed{3}\]

132The poles of a relation do not exist before their distinction.

\[\boxed{4}\]

133Delta forms no classes of itself.

\[\boxed{5}\]

134Multiplicity appears in the orders of the same relation.

\[\boxed{6}\]

135There are only the number marks 0 to 9.

\[\boxed{7}\]

136Multi-digitness is fractal relation.

\[\boxed{8}\]

137Nine is the fracture-edge of the visible basic shell.

\[\boxed{9}\]

138Ten is 1|0, not an eleventh basic mark.

\[\boxed{10}\]

139An operator produces no value.

140It orients a relation.

\[\boxed{11}\]

141A calculation is an ordered inscription.

\[\boxed{12}\]

142An inscription is read as a path.

\[\boxed{13}\]

143A path carries a trace.

\[\boxed{14}\]

144The trace is the memory of the enactment.

\[\boxed{15}\]

145Visibility and gate determine which edges contribute to the trace.

\[\boxed{16}\]

146A closed movement can carry a non-vanishing return difference.

\[\boxed{17}\]

147A trace can appear in different projections.

\[\boxed{18}\]

148Binding checks whether different projections can lock in together.

\[\boxed{19}\]

149Equality is not identity of objects.

150Equality is locking-in.

\[\boxed{20}\]

151The result is the public readout of a normal form.

\[\boxed{21}\]

152Every valid readout must remain read-backable to its trace class.

\[\boxed{22}\]

153Different readings of the same trace are isomorphic.

154Closing Sheet

155The Evolution of Signs

\[| ] [ \downarrow ] [ A|B ] [ \downarrow ] [ |(|) ] [ \downarrow ] [ \Delta ] [ \downarrow ] [ 0|1|2|3|4|5|6|7|8|9 ] [ \downarrow ] [ 1|0 ] [ \downarrow ] [ I ] [ \downarrow ] [ \gamma_I ] [ \downarrow ] [ \Sigma ] [ \downarrow ] [ NF ] [ \downarrow ] [ read\]

156The Isomorphy of Reading

\[\boxed{ | \cong 0 \cong \Delta \cong number \cong geometry \cong observer \cong trace \cong reading }\]

157Not as equality of objects.

158Not as interchangeability of signs.

159But as preservation of the same relational structure under different readings.

160The Complete Outward Path

\[\boxed{ | \rightarrow \Delta \rightarrow 0\text{–}9 \rightarrow I \rightarrow \gamma_I \rightarrow \Sigma \rightarrow NF \rightarrow read }\]

161The Complete Return Path

\[\boxed{ read \rightarrow NF \rightarrow \Sigma \rightarrow \gamma_I \rightarrow I \rightarrow 0\text{–}9 \rightarrow \Delta \rightarrow | }\]
\[Read-backability [ \boxed{ recover(read(\Sigma)) \equiv_\Sigma \Sigma } ]\]

162The signs change.

163The trace remains read-backable.

164The readings differ.

165The relational order remains isomorphic.

166Principle of Application

\[\boxed{ \text{Do not calculate in order to produce an object.} } ] [ \boxed{ \text{Distinguish, sequence into beats, bind, and read.} }\]

167Principle of the Handbook

\[\boxed{ \text{As little repetition as possible.} } ] [ \boxed{ \text{As much orientation as necessary.} } ] [ \boxed{ \text{As much read-backability as required.} }\]

168Symbol Overview of the Tractatus Principio

169A reference of the introduced notations

170I. Basic Symbols

171| – The difference

172Fundamental operation from which everything arises.

\[|\]

173The difference in open positing.

174It does not subsequently separate already existing things.

175Through it the poles of a relation arise.

\[|\rightarrow A|B\]

1760 – Zero / Potential

177The difference itself as closed cut, mirror, and equilibrium position between possible and impossible geometry.

\[\odot|0|\boxdot\]

178Zero is not nothing.

179Zero is the closed possibility of difference.

\[0\cong|\]

180Not as interchangeability of signs, but as isomorphic reading of the same difference.

\[\Delta – Delta\]

181Smallest self-referentiality and smallest self-rotation of difference.

\[\Delta=|(|) ] [ \Delta=2{,}25^\circ\]

182Delta appears as:

183These appearances are not different Delta kinds.

184They are relational readings of the same \Delta.

\[\Delta\varphi – Delta-Phi\]

185Free difference energy.

186Drift between relational positions.

\[\Delta\varphi\neq0\]

187designates a difference movement not yet locked in.

188II. The Three Orders of Difference

189First order

\[|\]

190Pure difference.

191As yet no executed poles.

192Second order

\[A|B\]

193Polarity.

194Dichotomy.

195Two relational positions of the same difference.

\[A\neq B\]

196The poles do not exist before their relation.

197Third order

\[(A|B)|(C|D)\]

198or:

\[|(|)\]

199The difference distinguishes its own differences.

200The third order does not produce mere multiplication of elements.

201It produces relational depth.

\[A|B|C|\dots\]

202is a possible unfolded notation, insofar as differences act on differences.

203III. Three Phases of Self-Referentiality

\[\odot – Unfolding\]

204Possible geometry.

205Space of the possible.

206Stable, closed possibility.

207Relation arises from potential.

2080 – Boundary / Mirroring

209The difference encounters itself.

210It becomes measurable.

211It forms a cut and mirror axis.

\[\boxdot – Complementarity\]

212Impossible geometry.

213Space of the impossible.

214Unstable, drifting, or not-yet-locked relation.

215Complete Process

\[\odot\rightarrow0\rightarrow\boxdot\]

216Spiral-shaped movement through unfolding, mirroring, and testing.

\[Locking-in: [ \boxdot\rightarrow|_=\rightarrow\odot' ]\]

217The new closed possibility carries the traversed trace.

218IV. Modes of Difference

219|_+ – Expansion

220Addition.

\[x|_+y\]

221x expands by y.

222A relation is opened by a further relation.

223|_- – Contraction

224Subtraction.

\[x|_-y\]

225x contracts by y.

226A relation is led back to a narrower position.

\[|_\times – Resonance\]

227Multiplication.

\[x|_\times y\]

228x resonates with y.

229Relations cross planes or rhythms.

230Multiplication is not merely repeated addition.

\[|_\div – Disentanglement\]

231Division.

\[x|_\div y\]

232x is disentangled by y.

233A total figure is read in recurring relations.

234|^ – Exponentiation

235Iterated iteration.

\[x|^{y}\]

236A relational effect itself becomes the carrier of its repetition.

\[|_{\sqrt{\phantom{x}}} – Rooting\]

237Inversion or read-back of exponentiation.

\[|_{\sqrt{\phantom{x}}}\]

238reads an iterated relation back to its supporting repetition figure.

239|_= – Equilibrium

\[Locking-in.\]

240Stabilization.

\[x|_=y\]

241The relation of x and y reaches a stable position under a certain reading.

242Equality is not an absolute identity of things.

\[|_{\neq} – Distinction / Non-coincidence [ x|_{\neq}y ]\]

243x and y do not lock in under the given reading.

244Non-coincidence opens the space of impossibility.

245It generates no positive object.

246|_. – Scale flip

247Decimal point.

248Change of level or shell.

\[x|_.y\]

249The reading tilts into another scale direction.

\[|_\Delta – Differential\]

250Smallest self-movement.

251Local change.

\[|_\Delta\]

252reads the difference of the change in the immediate beat.

\[|\Sigma|_\Delta – Integral\]

253Accumulated self-movement.

\[|\Sigma|_\Delta\]

254reads the integrated difference along a path.

255V. Spaces and Geometries

\[\odot – Possible Geometry\]

256Stable and closed possibility space.

257Readable-back closure.

\[\boxdot – Impossible Geometry\]

258Unstable or drifting impossibility space.

259Relations that do not yet stabilize.

\[\triangledown – Impossible Delta\]

260A delta that cannot stabilize under the current reading.

\[\triangledown\]

261designates no second kind of delta.

262It designates \Delta in an impossible or non-locked-in position.

\[|_{\triangledown} – Impossible Distinction\]

263Distinction in the mode of impossibility.

\[x|_{\triangledown}y\]

264The relation remains unstable, open, or drifting.

265VI. Levels of Distinction

\[\Delta_0 – Zeroth Level\]

266Immediate beat.

267Ones shell.

\[\Delta_1 – First Level\]

268First mirroring.

269Tens shell.

270\Delta_2 – Second Level Meta-relation

271Hundreds shell.

\[\Delta_x – X-th Level\]

272Any further reading depth.

273Three-level structure of a number

\[\Delta_2|\Delta_1|\Delta_0\]

274The levels are not different kinds of numbers.

275They are relational positions of the same number marks.

276VII. The Constitution of Numbers

277The complete mark space

\[M:={0,1,2,3,4,5,6,7,8,9}\]

278There are only the number marks 0 through 9.

279All multi-digit numbers are fractal relations of the same ten marks.

2800

281Closed possibility.

282Cutting and mirror axis.

2831

284First marking.

285First directed relation.

2862

287Mirror relation.

288Axis and polarity.

2893

290Orientation.

291First directed closure.

2924

293Context stabilization.

294Order of four.

2955

296Self-similarity opening.

297Pentagon relation.

2986

299Closed division resonance.

300Hexagon relation.

3017

302Drifting closure.

303Heptagon relation.

3048

305Double folding of four.

306Octagon relation.

3079

308Fracture edge.

309Cycle closure.

310Transition to the next reading shell.

\[9:=\kappa\]

31110

312New reading shell.

\[10:=1|0\]

313Ten is not an eleventh basic number.

314Multi-digit numbers

\[125:=1|2|5 ] [ 2026:=2|0|2|6\]

315A multi-digit number is an ordered fractal inscription.

316The place is not a container.

317It is relational depth.

318VIII. Relation Notations

319Basic relation

\[x|y\]

320x and y in relation.

321Expansion

\[x|_+y\]

322x expands by y.

323Contraction

\[x|_-y\]

324x contracts by y.

325Resonance

\[x|_\times y\]

326x resonates with y.

327Disentanglement

\[x|_\div y\]

328x is disentangled by y.

329Equilibrium

\[x|_=y\]

330x locks in at y.

\[Non-coincidence [ x|_{\neq}y ]\]

331x differs from y.

332The relation remains open or impossible.

333Relation triple

\[(a|b|c)\]

334Nested relation or delta addressing.

335b designates the relational transfer between a and c.

336Directions of view

\[-\Delta|+\Delta\]

337Negative and positive reading direction.

338Number axis

\[(-1|0|1)\]

339Complete axial relation of negative direction of view, zero, and positive direction of view.

340Negative numbers do not form a second number world.

341IX. Geometric Notations

342Radius

\[0|1\]

343Radius relation in the circle.

344Diameter

\[0|2\]

345Diameter and axis.

346Triangle

\[0|3\]

347Triangle in the circle.

348Orientation.

349Square

\[0|4\]

350Square in the circle.

351Stable order of four.

352\pi becomes readable as a circle-polygon relation.

353Pentagon

\[0|5\]

354Pentagon in the circle.

355\varphi becomes readable as a self-similarity relation.

356Hexagon

\[0|6\]

357Closed division resonance.

358Heptagon

\[0|7\]

359Drifting division relation.

360Octagon

\[0|8\]

361Double folding of four.

362Nonagon

\[0|9\]

363Fracture edge of the current shell.

364X. Special Constants

\[\Delta=2{,}25^\circ\]

365Delta angle.

366Minimal self-rotation.

\[\varphi=1{,}618\dots\]

367Golden ratio.

368Self-similarity ratio.

369Becomes readable in the pentagon relation.

\[\pi=3{,}14159\dots\]

370Pi.

371Relation of circle and polygon or of closed and linear reading.

372Becomes operatively visible in the order of four.

37339{,}19

374Self-reference constant.

375Self-referential constant of the number relation.

\[137{,}5^\circ\]

376Golden angle.

377Rotational relation of the Fibonacci spiral.

378e

379Euler constant.

380Stable self-reference of the rate of change.

\[|_\Delta e^x=e^x\]

381XI. Rotation

382i

383Positive quarter-rotation.

\[i:=R_{90^\circ}\]

384-i

385Inverse quarter-rotation.

\[-i:=R_{-90^\circ}\]

386Rotation cycle

\[i^2:=R_{180^\circ} ] [ i^3:=R_{270^\circ} ] [ i^4:=id\]

387i is not an additional kind of number.

388i is a rotation address of the same relational figure.

389XII. Frame and Delta Configuration

390|_| – Frozen Frame

391Closed local possibility.

\[F:=\vert\_\vert\]
\[|_\Delta – Marked Frame\]

392Frame with set Delta marking.

393Direction set

\[D:={N,E,S,W}\]

394Delta configuration

\[o:D\rightarrow{0,1}\]

395o designates the set and open Delta positions around the frame.

396Number of set positions

\[k(o):=\sum_{d\in D}o(d)\]
\[0\Delta\]

397Pure frame.

398No set Delta position.

\[1\Delta\]

399Event.

400One set Delta position.

\[2\Delta\]

401Axis.

402Two set Delta positions.

\[3\Delta\]

403Observer orientation.

404Three set positions and one open direction.

\[4\Delta\]

405Full context space.

406Four set positions.

\[4\Delta=\Delta^\Delta\]

407h\(o\) – Hole direction

408Open direction of a three-Delta state.

409Epistemic outside of the observer.

\[\operatorname{ori}(o)\]

410Orientation reading of a three-Delta state.

\[\mathcal O\]

411Set of all orientations.

\[\mathcal O={o_N,o_E,o_S,o_W}\]
\[\mathcal T\]

412Transition space of the orientations.

\[|\mathcal T|=12\]

413Twelve directed paths between the four observer positions.

\[o_{\mathrm{sat}}\]

414Saturated four-Delta configuration.

415Full context space.

416XIII. Observer Notations

\[\circledcirc_B\]

417Closed observer reading of B.

\[\mathcal O_B\]

418Orientation state of observer B.

\[(\circledcirc_B|P)\]

419Relation between observer B and phenomenon P.

420Observer and phenomenon arise within their relation.

421XIV. Fractal Operators

\[\ominus – Fractal Difference\]

422Difference between orders of difference.

\[\circledast – Fractal Linkage\]

423Binding of recursive orders of difference.

\[\mathcal R – Rotation\]

424Rotation of an orientation or reading position.

\[\widetilde{\mathcal O} – Orientation Oscillator\]

425Recurring change of orientation states.

\[\mathcal F – Phase Feedback\]

426A reading changes the condition of its next reading.

\[\zeta_\Delta(s) – Zeta-Delta Condensation\]

427Condensation of Delta traces under the reading position s.

428Scale-spanning read-back of orders of repetition.

429XV. Inscription and Path

430I – Inscription

\[I=(m_0,m_1,\dots,m_{N-1})\]

431Ordered sequence of visible marks and operator edges.

\[\gamma_I – Path of the inscription [ \gamma_I=(e_0,e_1,\dots,e_{N-1}) ]\]

432Clocked sequence of the operative transitions of an inscription.

433e_n – Edge

\[e_n:x_n\rightarrow x_{n+1}\]

434An operative step within the path.

435T_n – Clocked reading operation

\[T_n:=Step\circ O_n\]

436Non-commutativity [ Step\circ O\neq O\circ Step ]

437The order of step and reading carries meaning.

438XVI. Trace and Visibility

439w\(e\) – Difference reading of an edge

440Relational contribution of an edge to the trace.

\[\chi_{\mathrm{vis}} – Visibility rejector [ \chi_{\mathrm{vis}}\in{0,1} ]\]

441Determines whether an edge is visible under the current reading.

\[\chi_{\mathrm{gate}} – Gate rejector [ \chi_{\mathrm{gate}}\in{0,1} ]\]

442Determines whether an edge is admitted to the current enactment.

443H_n – Step contribution

\[H_n := \chi_{\mathrm{vis}}(e_n) \cdot \chi_{\mathrm{gate}}(e_n) \cdot w(e_n)\]
\[\Sigma(\gamma) – Trace [ \Sigma(\gamma) := \sum_{e\in\gamma}w(e) ]\]

444Integrated difference of a path.

445Trace accumulation

\[\Sigma_{n+1} = \Sigma_n+H_n\]

446L_n – Readable edges

447Set of the edges visible or admitted, as applicable, at beat n.

448XVII. Holonomy

\[\Omega(n) – Accumulated holonomy [ \Omega(n) := \sum_{t=0}^{n-1}H(t) ]\]
\[\phi(n) – Phase position [ \phi(n) := \Omega(n)\bmod 2\pi ]\]

449Non-vanishing return difference

\[\gamma(0)=\gamma(1)\]

450and:

\[\Sigma(\gamma)\neq0\]

451Return to the starting place without return to the starting position.

\[\gamma_\infty – Infinity loop\]

452Closed register form in which drift remains bound in circulation.

453XVIII. Projection and Binding

\[\Pi_i – Projection [ \Pi_i:\Sigma\rightarrow A_i ]\]

454Reading channel of a trace.

455a_i – Projected readout

\[a_i:=\Pi_i(\Sigma)\]
\[\Delta a_i – Difference of a reading channel [ \Delta a_i(n) := a_i(n)|a_i(n+1) ]\]
\[\bowtie – Binding gate\]

456Checks the compatibility of different trace readings.

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

457XIX. The ¾Corner

\[\Theta_{\frac34} – ¾Corner [ \Theta_{\frac34} := (e_1,e_2,e_3;D) ]\]

458Three set hinge edges and one open drift edge.

\[\mathcal L_{\frac34} – Rattle space\]

459Finite space of possible snapping positions.

460L^* – Minimal drift position

\[L^* := \operatorname*{arg\,min}_{L\in\mathcal L_{\frac34}} drift(L)\]
\[Lock_{\frac34} – Equality snap\]

461Finite snapping-in of a relation in its minimal drift position.

462XX. Normal Form and Reading

\[NF(\Sigma) – Normal form\]

463Self-resonance reading of a trace.

464Stable position that can be read back.

\[read(\Sigma) – Public reading\]

465Visible readout of a trace.

\[read_L\]

466Left-side reading of an equation inscription.

\[read_R\]

467Right-side reading of an equation inscription.

\[\equiv_\Sigma – Trace-class equality\]

468Back-addressable equality of different readings.

\[G\equiv_\Sigma I\]

469G and I carry the same trace class.

\[\sim – Resonance comparison\]

470Resonance similarity without classical equality.

\[\rightsquigarrow – Reading transition\]

471A form falls under a reading onto another visible form.

472recover – Read-back

473Reconstruction of a trace from its readout.

474Validity

\[valid(L) \iff recover(L)\equiv_\Sigma\Sigma\]

475A label is valid if it remains readable back to its trace class.

476XXI. Complete Enactment of Reading

\[I \rightarrow \gamma_I \rightarrow \Sigma(\gamma_I) \rightarrow \Pi_i(\Sigma) \rightarrow \bowtie \rightarrow Lock_{\frac34} \rightarrow NF \rightarrow read\]

477The inscription is read as a path.

478The path carries a trace.

479The trace is projected.

480The projections are bound.

481The drift snaps in.

482The trace forms a normal form.

483The normal form is read publicly.

484XXII.

485Isomorphy of Reading

486In the Tractatus Principio, isomorphy designates neither the equality of different signs nor their free interchangeability. It designates the preservation of the same relational order in the transition from one reading form into another. Difference, Delta, number, geometry, observer, and trace are therefore not identical; they form different operative modes of appearance of a structure whose transitions, orientations, and back-references remain mappable onto one another. Two readings are isomorphic if one can be translated into the other and then read back to the same trace order, without the supporting difference structure being lost. Isomorphy thus means: The visible form changes, while the order of its relations is preserved.

\[\boxed{ L_1\cong L_2 \iff recover(L_1)\equiv_\Sigma recover(L_2) }\]

487The isomorphy therefore lies not in the signs themselves, but in the read-back capability of their relational constitution.

488Part II

489From the Sign to the Executable Sign

490Python as Representation of Difference

491Foreword

492The second writing

493The first part of this book has brought the signs of the Tractatus into an operative sequence:

\[| \rightarrow \Delta \rightarrow Number \rightarrow Operation \rightarrow Geometry \rightarrow Observer \rightarrow Trace \rightarrow Reading\]

494This sequence does not end with a formula.

495It can be executed.

496For this, no new theory has to be introduced. It only has to be shown how the same order of difference appears in a programming language.

497The Tractatus notation writes the relation in condensed form.

498Python unfolds the same relation as an ordered enactment.

\[\boxed{ \text{Tractatus notation} \cong \text{Python code} }\]

499This isomorphy does not mean equality of the signs.

500The stroke

\[|\]

501is not a Python object.

502Delta

\[\Delta\]

503is not a function.

504The trace

\[\Sigma\]

505is not an ordinary list.

506The readout

\[read(\Sigma)\]

507is not an arbitrary output.

508Python represents these forms by arranging their relations, transitions, and reading conditions in executable writing.

509The code therefore does not deal with objects.

510It writes conditions of distinguishability.

511It writes what may be bound.

512It writes what becomes visible in a beat.

513It writes which trace an enactment leaves behind.

514It writes how an address becomes readable.

515It writes under which conditions an opening can be closed.

516The code does not produce the result as a finished object.

517It makes the difference readable.

Chapter X

Code as Inscription

10.1 Code is not the difference

1The difference is primitive:

\[|\]

2Python is not primitive.

3Python is a public script in which relations can be marked, ordered, and executed.

4Therefore:

\[\text{Python code}\neq|\]

5and at the same time:

\[\text{Python code} \text{executable inscription of }|\]

6A program does not contain the difference like an object.

7It establishes an order in which differences can become visible.

10.2 The ordinary reading of code

8An ordinary program is often read in the form:

\[Input \rightarrow Algorithm \rightarrow Output\]

9For example:

def add(a, b):
    return a + b

10This reading presupposes:

11The difference appears in this only as the already presupposed separation of values and operations.

12It is not itself written.

10.3 The Tractatus reading of code

13Delta-constraint code reads the same process differently:

\[Input \rightarrow question figure \rightarrow Gate \rightarrow trace \rightarrow holonomy \rightarrow address \rightarrow Label\]

14The code does not first ask:

\[\text{What value should I generate?}\]

15It asks:

\[\text{Which relation is present?} ] [ \text{Which opening does this relation carry?} ] [ \text{Which transitions become visible?} ] [ \text{Which trace remains behind?} ] [ \text{Which address closes the opening?} ] [ \text{Which label is read at this address?}\]

16The elementary sequence is therefore:

\[a|_{\mu}b \rightarrow \Sigma \rightarrow Addr \rightarrow read(Addr)\]

17In Python:

binding = bind(a, b, mode)
trace = integrate(binding)
address = locate(trace)
label = read(address)

18These four lines do not designate four mutually independent machines.

19They unfold a single relation in four reading positions:

\[\text{Binding} \rightarrow \text{trace} \rightarrow \text{address} \rightarrow \text{public reading}\]

10.4 Code as ordered inscription

20A line of code is not a mere instruction.

21It is a marked position within a sequence.

binding = bind(a, b, mode)

22This line marks a binding.

trace = integrate(binding)

23This line marks the inscription of the enactment.

label = read(trace)

24This line marks the public reading.

25The meaning does not lie in the lines by themselves.

26It arises from their order.

\[Step\circ O\neq O\circ Step\]

27Correspondingly, these two programs are also not necessarily the same:

trace = integrate(binding)
label = read(trace)

28and:

label = read(binding)
trace = integrate(label)

29The second program changes the order of the reading.

30It reads before a trace has arisen.

31The order is not only technical syntax.

32It is memory.

Chapter XI

The three layers of code

11.1 The necessity of separation

1The code of difference must keep three layers apart:

\[\mathcal C\neq\mathcal I\neq\mathcal L\]

2Here:

\[\mathcal C \text{Carrier layer} ] [ \mathcal I \text{inscription layer} ] [ \mathcal L \text{interpretation layer}\]

3The separation prevents a visible mark from being confused with its trace, or a trace with its binding structure.

11.2 Carrier layer

4The carrier layer carries the binding:

\[a|_{\mu}b\]

5Here lie:

6In Python, such a binding can be represented as:

binding = Binding(
    left=a,
    mode=mode,
    right=b,
)

7This form does not say that a and b are two finished things.

8It marks two positions within a binding.

9mode, too, is not an object between them.

10mode designates how the binding is read.

11.3 Inscription layer

11The inscription layer carries the enactment:

\[\gamma,\quad H_n,\quad \Sigma,\quad \Omega,\quad Addr\]

12In Python:

path = trace_path(binding)
trace = integrate(path)
address = locate(trace)

13No number object arises here.

14Here the order of transitions is inscribed.

15The trace is the memory of this order.

11.4 Interpretation layer

16The interpretation layer carries visible labels:

\[0,1,2,\dots,9,\quad x,\quad +,\quad =,\quad Ans\]

17In Python:

label = read(address)

18The label is not the address.

\[Label\neq Addr\]

19It is the public reading of the address:

\[Label:=read(Addr)\]

20A digit is therefore not a kernel value.

21An operator sign is not a kernel operation.

22A variable is not a container.

23A display is not the enactment.

11.5 The forbidden mixing

24Invalid is:

digit = address

25For:

\[digit\neq address\]

26Valid is:

digit = read(address)

27Invalid is:

operator = numeric_function

28Valid is:

operator = binding_mode

29Invalid is:

answer = trace

30Valid is:

answer = read(trace)

31The difference between the two forms is not stylistic.

32It preserves the layers of the reading.

Chapter XII

The stroke in code

12.1 Difference of the first order

1Tractatus:

\[|\]

2The difference of the first order does not yet possess determinate poles.

3It is the condition for poles to be able to appear.

4Python cannot contain this condition as a finished object.

5It can only mark a place at which a distinction may be enacted.

6For example:

def distinguish(left, right):
    return left, right

7This function is not yet a sufficient representation.

8It merely returns two elements.

9But the difference does not lie in the elements.

10It lies in their binding.

11Therefore the relation itself must be marked:

def distinguish(left, right):
    return Binding(left=left, right=right)

12The class Binding is still not the difference itself.

13It is its Python inscription.

12.2 Difference of the second order

14Tractatus:

\[A|B\]

15Python:

relation = Binding(
    left=A,
    right=B,
)

16A and B receive their position only through the binding.

17Without the binding they are not poles of this relation.

18Therefore the ordinary reading:

A = object()
B = object()

19is not fundamental for the kernel.

20Fundamental is:

relation = distinguish(A, B)

21The poles do not generate the relation.

22The relation distinguishes the poles.

12.3 Difference of the third order

23Tractatus:

\[(A|B)|(C|D)\]

24Python:

left_relation = distinguish(A, B)
right_relation = distinguish(C, D)

relation = distinguish(
    left_relation,
    right_relation,
)

25Here, four objects are not being collected.

26Two distinctions already enacted are distinguished again.

27The relational depth increases.

12.4 Self-referentiality

28Tractatus:

\[|(|)\]

29Python:

first_difference = distinguish(A, B)

self_related_difference = distinguish(
    first_difference,
    first_difference,
)

30This representation is self-referential only if the earlier relation remains part of the new relation.

31A mere repetition is not enough:

32distinguish(A, B)

33distinguish(A, B)

34Here there are only two identical calls one after the other.

35Self-referentiality arises only when a relation acts back upon its own relational form.

\[\Delta=|(|)\]

36Python:

delta = relate(
    relation,
    to=relation,
)

37delta is thereby not a thing named Delta.

38It designates the marked efficacy of self-relation.

Chapter XIII

Delta as transition

13.1 Delta is not a value

1Tractatus:

\[A|B ;\Delta; C|D\]

2Delta designates the transition of one difference position into another.

3It is not the initial state.

4It is not the final state.

5It is also not a third object between the two.

6Python:

next_relation = transition(current_relation)

7The function transition represents the transition.

8It is not Delta itself.

9Delta lies in the effective relation of initial position, transition, and subsequent position.

13.2 Delta as beat

10Tractatus:

\[o_n\rightarrow o_{n+1}\]

11Python:

for tick in transitions:
    orientation = tick.apply(orientation)

12The beat is not only a counting variable.

13It designates the ordered place of the transition.

for tick_index, transition in enumerate(path):
    state = transition.apply(state)

14tick_index is the visible marking of the beat.

15The beat itself lies in the enactment:

\[state_n \rightarrow state_{n+1}\]

13.3 Delta as drift

16Tractatus:

\[\Delta\varphi\]

17Python:

drift = read_drift(
    before=orientation_a,
    after=orientation_b,
)

18The drift is not read as a property of an individual state.

19It appears between two reading positions.

20Therefore this would be imprecise:

21state.drift

22Stricter is:

drift = difference_between(
    state_a,
    state_b,
)

23The drift belongs to the relation.

13.4 Delta as self-rotation

24Tractatus:

\[\Delta=2{,}25^\circ\]

25Python can mark this self-rotation as the smallest permitted rotation interval:

DELTA_ROTATION = RotationStep(
    numerator=225,
    denominator=100,
)

26What is decisive is not the data type.

27What is decisive is that the rotation is read as a transition between orientations:

next_orientation = rotate(
    orientation,
    by=DELTA_ROTATION,
)

28The number 2.25 alone is not yet a self-rotation.

29Only its position in the enactment of rotation makes it a Delta address.

Chapter XIV

Number and mark

14.1 Number as readout

1Tractatus:

\[n:=read(\Sigma_n)\]

2Python:

digit = read(trace)

3The visible mark appears at the end of the reading.

4Not:

trace = digit

5but:

digit = read(trace)

6Thus the number is not an original unit in the kernel.

7It is the public reading of a trace.

14.2 The marks from zero to nine

8Tractatus:

\[M={0,1,2,3,4,5,6,7,8,9}\]

9Python:

MARKS = ("0", "1", "2", "3", "4",
         "5", "6", "7", "8", "9")

10The quotation marks are important.

11They show that the visible digits are initially marks.

12"5"

13is a visible inscription.

145

15is already a numerical value in Python.

16For the interpretation layer, the mark is therefore initially more precise:

mark = "5"

17Only an explicit reading rule may connect it with an address:

mark = read(address)

14.3 Multi-digitness

18Tractatus:

\[125:=1|2|5\]

19Python:

inscription = ("1", "2", "5")

20The sequence is initially not a number entity.

21It is an ordered inscription.

for mark in inscription:
    trace = trace_mark(mark, trace)

22Thus:

23[ 125

\[read(1\rightarrow2\rightarrow5) ]\]

24Multi-digitness arises through relational depth.

14.4 The place

25Tractatus:

\[\Delta_2|\Delta_1|\Delta_0\]

26Python:

positions = (
    Position(depth=2, mark="1"),
    Position(depth=1, mark="2"),
    Position(depth=0, mark="5"),
)

27The position is not a container in which the digit lies.

28It designates the reading depth of the mark within the inscription.

14.5 The nine as fracture edge

29Tractatus:

\[9:=\kappa\]

30Python:

KAPPA = Mark(
    label="9",
    role="shell_break",
)

31The mark 9 is not read merely as another entry in a series.

32Its role marks the closure and transition of the basic shell.

14.6 Ten as new shell

33Tractatus:

\[10:=1|0\]

34Python:

ten_inscription = (
    Mark("1"),
    Mark("0"),
)

35Not:

NEW_DIGIT = "10"

36For ten is not an eleventh basic mark.

37It is the first visible relation of a new reading shell.

Chapter XV

Operators as binding modes

15.1 Operators do not generate values

1Tractatus:

\[a|_+b\]

2Python:

binding = bind(a, b, mode=EXPANSION)

3The operator + is read as a mode of expansion.

4Not:

result = a + b

5In ordinary Python, this line immediately generates a value.

6The difference-logical representation keeps the relation open:

binding = Binding(left=a, mode=EXPANSION, right=b)

15.2 Expansion

7Tractatus:

\[|_+\]

8Python:

EXPANSION = Mode("expansion")

9Application:

relation = bind(
    left=a,
    right=b,
    mode=EXPANSION,
)

10Expansion does not automatically mean numerical addition.

11It designates the direction in which two reading positions enter into an expanded relation.

15.3 Contraction

12Tractatus:

\[|_-\]

13Python:

CONTRACTION = Mode("contraction")

14Application:

relation = bind(
    left=a,
    right=b,
    mode=CONTRACTION,
)

15Contraction does not simply delete a value.

16It orients the relation toward withdrawal, retraction, or diminution of its visible binding.

15.4 Resonance

17Tractatus:

\[|_\times\]

18Python:

RESONANCE = Mode("resonance")

19Application:

relation = bind(
    left=a,
    right=b,
    mode=RESONANCE,
)

20Multiplication thereby appears as a coupling of rhythms or recurring bindings.

21It is not originally the product of two number objects.

15.5 Disentanglement

22Tractatus:

\[|_\div\]

23Python:

DISENTANGLEMENT = Mode("disentanglement")

24Application:

relation = bind(
    left=a,
    right=b,
    mode=DISENTANGLEMENT,
)

25Division appears as the question of how a bound relation can be read into distinguishable partial relations.

15.6 Equilibrium

26Tractatus:

\[|_=\]

27Python:

EQUILIBRIUM = Mode("equilibrium")

28The equality sign does not compare two finished objects.

29It activates the test of whether different readings lock onto the same trace class.

equation = bind(
    left=left_inscription,
    right=right_inscription,
    mode=EQUILIBRIUM,
)

30After that:

valid = same_trace_class(
    read_left(equation),
    read_right(equation),
)

31Equality is read as trace equivalence:

\[\Sigma_A\equiv_\Sigma\Sigma_B\]

15.7 Lowering

32An ordinary expression:

33a + b

34is lowered into the carrier layer:

\[a+b \mapsto a|{\mu+}b\]

35Python:

binding = lower(
    left=a,
    operator="+",
    right=b,
)

36Result of the lowering:

37Binding(

    left=a,
    mode=EXPANSION,
    right=b,
)

38Lowering does not calculate.

39It translates a visible operator sign into a binding mode.

Chapter XVI

Variable and Opening

16.1 The variable is not a container

1Ordinary reading:

x = 5

2x contains the value 5.

3Difference-logical reading:

4x marks an addressed place at which the mark 5 is readable under a certain relation.

5The assignment is thus a binding:

\[x|_=!5\]

6Python:

assignment = bind(
    left=Opening("x"),
    right=Mark("5"),
    mode=EQUILIBRIUM,
)

16.2 The opening

7Tractatus:

\[u_j:=0_{R_Q}\]

8The opening is not an absolute emptiness.

9It is a relative zero in the relation of the question.

10Python:

opening = Opening(
    name="u1",
    relative_to=question_relation,
)

11The opening contains no missing value.

12It marks a role not yet closed.

16.3 The question figure

13Tractatus:

\[F_Q=(G_Q,U_Q,R_Q)\]

14Python:

question = QuestionFigure(
    graph=binding_graph,
    openings=(opening,),
    relation=question_relation,
)

15Here:

16question.graph

17is the binding structure,

18question.openings

19is the set of openings,

20and:

21question.relation

22is the relation under which the openings must be closed.

16.4 Implicit opening

23The visible inscription:

\[2+2\]

24becomes:

\[2|{\mu+}2|{\mu=}u_1\]

25Python:

expression = bind(
    Mark("2"),
    Mark("2"),
    mode=EXPANSION,
)

question = bind(
    expression,
    Opening("u1"),
    mode=EQUILIBRIUM,
)

26The question is not:

27What numerical value does the addition produce?

28It is:

29Which address closes the opening of this expansive equilibrium figure?

16.5 Explicit opening

30The inscription:

\[x+3=7\]

31is read as:

\[u_1|{\mu+}3|{\mu=}7\]

32Python:

opening = Opening("u1")

left_side = bind(
    opening,
    Mark("3"),
    mode=EXPANSION,
)

question = bind(
    left_side,
    Mark("7"),
    mode=EQUILIBRIUM,
)

33x is not an unknown number.

34x is the visible label of an open relational place.

16.6 Closure

35Tractatus:

\[close(u_j,Addr_j)=1\]

36Python:

closed = opening.close_with(address)

37The address is not inserted into a container.

38It snaps into the relation of the opening.

39Validity:

closed = compatible(
    opening,
    address,
    question_relation,
)

Chapter XVII

Gate and Visibility

17.1 The gate does not decide truth

1Tractatus:

\[\chi_{\mathrm{vis}}(e_n)\]

2Python:

3if visible(edge, tick):

trace.append(edge)

4The gate does not say:

5The edge is true.

6It says:

7The edge contributes to the visible trace in this tick.

17.2 Visibility

8Tractatus:

\[L_n\]

9Python:

visible_edges = visibility_mask(
    path,
    tick=n,
)

10L_n is the reading mask of the tick.

11It determines which transitions are read effectively in this tick.

17.3 Gate and contribution

12Tractatus:

\[H_n := \chi_{\mathrm{vis}}(e_n) \chi_{\mathrm{gate}}(e_n) w(e_n)\]

13Python:

14if visible(edge, tick) and allowed(edge, tick):

    contribution = read_difference(edge)
else:
    contribution = no_contribution()

15The two conditions are rejectors.

16They do not generate any additional value.

17They allow a difference to contribute to the trace or not.

17.4 Condition in Python code

18Ordinarily:

19if condition:

do_something()
\[Difference-logically:\]

20if gate.is_open(relation, tick):

trace.inscribe(relation)

21The if becomes the gate.

22It does not separate two finished worlds into true and false.

23It marks the visibility of a relation in the current tick.

17.5 The closed gate

24Tractatus:

\[\chi_{\mathrm{gate}}=0 \Rightarrow H_n=0\]

25Python:

26if not gate.is_open(edge, tick):

return no_contribution()

27No trace does not mean that the relation has ontologically disappeared.

28Under this reading condition, it does not contribute to the visible inscription.

Chapter XVIII

Path, Loop, and Trace

18.1 The inscription as path

1Tractatus:

\[I\rightarrow\gamma_I\]

2Python:

path = trace_path(inscription)

3An inscription is not treated as a static syntax tree.

4It is read as an ordered sequence of transitions.

18.2 The loop

5Ordinarily:

for edge in path:
    process(edge)
\[Difference-logically:\]
for tick, edge in enumerate(path):
    contribution = read_step(edge, tick)
    trace.inscribe(contribution)

6The loop does not merely repeat a command.

7It carries the relation through a sequence of ticks.

8Each pass has a different position in the overall enactment.

18.3 The trace

9Tractatus:

\[\Sigma_{n+1} = \Sigma_n+H_n\]

10Python:

11trace.append(contribution)

12The method append is not merely a technical list operation here.

13It shows:

14The new contribution does not replace the earlier trace.

15It inscribes itself into it.

18.4 Trace as the only memory

16A state machine asks:

\[current_state\]

17The delta-constraint code asks:

\[trace_so_far\]

18For the meaning lies not only in the present state.

19It lies in the path by which this state was reached.

20Two equal states can carry different traces.

same_state = state_a == state_b
different_trace = trace_a != trace_b

21Both can hold at the same time.

18.5 Holonomy

22Tractatus:

\[\gamma(0)=\gamma(1)\]

23and yet:

\[\Sigma(\gamma)\neq0\]

24Python:

same_position = path.start == path.end
remaining_trace = trace.is_nonzero()

25Complete:

26if same_position and remaining_trace:

holonomy = read_return_difference(trace)

27The return to the same place is not a return to the same situation.

18.6 Non-commutativity

28Tractatus:

\[(a|\mu b)|\nu c \neq a|\mu(b|\nu c)\]

29Python:

first = bind(
    bind(a, b, mode=mu),
    c,
    mode=nu,
)

second = bind(
    a,
    bind(b, c, mode=nu),
    mode=mu,
)

30first and second carry different paths.

31An optimization must not exchange them without an explicit rule.

32Invalid:

expression = optimizer.reassociate(expression)

33Valid only with an indicated rule:

34if rules.allow_association(mu, nu):

expression = reassociate(expression)

35The order is trace.

Chapter XIX

Observer and Context in Code

19.1 The frame

1Tractatus:

\[F:=\vert\_\vert\]

2Python:

frame = Frame()

3Frame() is not an empty container.

4It denotes the closed reading frame within which markings can occur.

19.2 Delta configuration

5Tractatus:

\[o:D\rightarrow{0,1}\]

6Python:

orientation = {
    "N": 1,
    "E": 1,
    "S": 1,
    "W": 0,
}

7The entries denote visible or unoccupied directional places.

19.3 Observer

8Tractatus:

\[3\Delta=4\Delta-\Delta\]

9Python:

observer = context.with_missing(
    direction="W",
)

10The observer is not inserted into the context as an additional object.

11It appears as a full context with directed incompleteness.

19.4 Hole direction

12Tractatus:

\[h(o)\]

13Python:

hole_direction = observer.missing_direction()

14The hole direction is not a defect of the program.

15It is the orientation of the observer.

19.5 Full context

16Tractatus:

\[4\Delta=\Delta^\Delta\]

17Python:

context = DeltaContext(
    north=True,
    east=True,
    south=True,
    west=True,
)

18The full context contains no preferred reading direction.

19Only the removal of a marking generates orientation:

observer = context.with_missing("N")

19.6 Observation as projection

20The observer does not necessarily change the carrier.

21It reads it under an orientation.

22Tractatus:

\[\Pi_o(\Sigma)\]

23Python:

observed_trace = project(
    trace,
    orientation=observer,
)

24The projection should remain read-only.

25Invalid:

26observer.project(trace).mutate_kernel()

27Valid:

view = observer.read(trace)

28The observer does not generate the trace.

29It makes one of its readings visible.

Chapter XX

Projection, Binding, and Equality

20.1 One trace, several readings

1Tractatus:

\[a_i=\Pi_i(\Sigma)\]

2Python:

visible_view = project_visible(trace)
rotation_view = project_rotation(trace)
operator_view = project_operator(trace)
drift_view = project_drift(trace)

3These projections are not separate states.

4They are different reading channels of the same trace.

20.2 Read-only projection

5Python:

class Projection:
    def read(self, trace):
        return view_of(trace)

6Not:

class Projection:
    def transform_kernel(self, trace):
        ...

7The projection reads.

8It does not rewrite the kernel.

20.3 Binding gate

9Tractatus:

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

10Python:

compatible = bindable(
    projection_a,
    projection_b,
)

11The projections do not have to be identical.

12They must fit together under the question relation.

20.4 Validity

13Tractatus:

\[valid(I) \iff \forall i,j: \Pi_i(\Sigma(I)) \bowtie \Pi_j(\Sigma(I))\]

14Python:

valid = all(
    bindable(left, right)
    for left in projections
    for right in projections
)

15An invalid inscription does not necessarily have an empty value.

16It has no bindable commit form.

20.5 Equality as measuring point

17Tractatus:

\[{=} := \Pi+\bowtie+Lock_{\frac34}+NF\]

18Python:

def equality_reading(inscription):
    trace = integrate(inscription)
    projections = project(trace)
    bound = bind_projections(projections)
    locked = lock_three_quarters(bound)
    return normal_form(locked)

19The equality sign thereby does not become:

left == right

20but rather a sequence of readings, bindings, and lockings.

Chapter XXI

Normal Form and Readout

21.1 Normal form is not simplification

1Tractatus:

\[B\rightarrow B_{NF}\]

2Python:

normal = recognize_form(binding)

3Not:

normal = calculate_value(binding)

4The normal form recognizes the type of the binding structure.

21.2 Self-binding

5Tractatus:

\[a|\mu b|\nu a \rightarrow \Delta_{\mu,\nu}(a,b)\]

6Python:

7if pattern.is_self_binding(binding):

normal = DeltaPattern.from_binding(binding)

8This transformation calculates no value.

9It recognizes a recurring relational form.

21.3 No hidden simplification

10A repetition must not automatically disappear:

11bind(a, a, mode)

12may collapse to a only if the mode is explicitly stabilizing:

13if rules.is_stabilizing(mode):

return a

14Without a rule, the repetition remains part of the trace.

21.4 Address

15Tractatus:

\[Addr_i := read(\Omega_i|D_i^{out}|R_Q)\]

16Python:

address = read_address(
    holonomy=omega,
    outer_direction=outer_direction,
    question_relation=question_relation,
)

17The address is not a visible number.

18It designates a position under which a trace can be read.

21.5 Readout

19Tractatus:

\[Ans:=read(Addr)\]

20Python:

answer = read(address)

21The answer is not generated.

22It becomes publicly readable at the address.

21.6 Read-back capability

23Tractatus:

\[valid(L) \iff recover(L)\equiv_\Sigma\Sigma\]

24Python:

recovered_trace = recover(label)

valid = same_trace_class(
    recovered_trace,
    original_trace,
)

25A label is grounded only if it can be traced back to its trace class.

26Invalid:

return "5"

27without an address.

28Valid:

return read(address)

29with a read-back-capable trace.

Chapter XXII

Error as relational error

22.1 Error is not necessarily falsehood

1In Delta-Constraint-Code, an error does not designate a merely false number.

2It designates a disturbance of the reading architecture.

22.2 No question figure

3Tractatus:

\[|U_Q|=0\]

4Python:

5if not question.openings:

raise NotAQuestionError()

6A closed inscription is not a task.

22.3 Unbound opening

7Tractatus:

\[u_j\not\bowtie R_Q\]

8Python:

9if not bindable(opening, question_relation):

raise UnboundOpeningError()

22.4 Ungrounded label

10Tractatus:

\[\neg\exists Addr: L=read(Addr)\]

11Python:

12if label.address is None:

raise UngroundedLabelError()

13A visible result without an address is not readable back.

22.5 Hidden calculation

14Invalid:

result = a + b

if this calculation is presented as a primitive operation in the kernel.

15Valid:

edge = bind(
    a,
    b,
    mode=EXPANSION,
)

16The classical calculation may appear as a public projection.

17It must not become the ontological core unnoticed.

22.6 Constructed holonomy

18Invalid:

trace = construct_trace_for(
    desired_answer,
)

19For here the trace is generated from a previously posited result.

20Valid:

trace = integrate(question_figure)
answer = read(locate(trace))

21The trace precedes the readout.

22.7 Covert reordering

22Invalid:

23optimizer.reorder(binding)

24without an explicitly indicated relational rule.

25Valid:

26if rules.allow_reordering(binding):

binding = reorder(binding)

27The order belongs to the enactment.

Chapter XXIII

A complete double reading

23.1 The inscription

1We consider:

\[2+2\]

2The visible inscription is not yet a finished calculation.

3It carries an implicit opening.

23.2 Tractatus notation

\[2|{\mu+}2|{\mu=}u_1\]

4From this the question figure arises:

\[F_Q=(G_Q,{u_1},R_Q)\]

5The figure is read as a path:

\[F_Q\rightarrow\gamma_Q\]

6The visible contributions are integrated:

\[\Omega_{n+1} := \Omega_n+H_n\]

7The address is read:

8[ Addr :=

\[read(\Omega|D^{out}|R_Q) ]\]

9The opening is closed:

\[close(u_1,Addr)=1\]

10The public label appears:

\[Ans=read(Addr)\]

23.3 Python inscription

left_mark = Mark("2")
right_mark = Mark("2")

expansion = bind(
    left_mark,
    right_mark,
    mode=EXPANSION,
)

opening = Opening(
    name="u1",
)

question = bind(
    expansion,
    opening,
    mode=EQUILIBRIUM,
)

path = trace_path(question)

trace = Trace()

for tick, edge in enumerate(path):
    if visible(edge, tick) and allowed(edge, tick):
        contribution = read_difference(
            edge,
            tick,
        )
        trace.append(contribution)

address = read_address(
    trace=trace,
    question=question,
)

answer = read(address)

23.4 Reading

11Mark("2")

12designates a visible mark.

13bind(..., mode=EXPANSION)

14lowers the plus sign into a binding mode.

15Opening("u1")

16sets the relative zero of the question.

17trace_path(question)

18reads the question figure as an ordered path.

19visible(...)

20and:

21allowed(...)

22form the gates.

23trace.append(contribution)

24writes the visible difference into the trace.

25read_address(...)

26reads the position under which the opening can be closed.

27read(address)

28projects the public label.

29At no point has the code posited a result as an original value.

30It has written conditions under which a trace becomes readable as an answer.

Chapter XXIV

Python as second notation

24.1 No competition between the scripts

1Tractatus notation and Python do not stand opposed to one another.

2The formula condenses.

3The code unfolds.

4Tractatus:

\[a|_{\mu}b \rightarrow \Sigma \rightarrow Addr \rightarrow read(Addr)\]

5Python:

binding = bind(a, b, mode)
trace = integrate(binding)
address = locate(trace)
label = read(address)

6Both inscriptions carry the same order of movement.

24.2 The formula shows the relation

7Tractatus notation lets the overall form become visible at a glance.

\[F_Q \rightarrow \gamma_Q \rightarrow \Omega \rightarrow Addr \rightarrow Ans\]

8It shows the position of the concepts within the whole.

24.3 The code shows the enactment

9Python unfolds the same overall form into a temporal sequence:

question = form_question(inscription)
path = trace_path(question)
trace = integrate(path)
address = locate(trace)
answer = read(address)

10The code makes visible which operation must happen before which other one.

24.4 Translation without loss

11A valid translation must preserve the order of difference.

12It must preserve:

13Formal:

\[T: \text{Tractatus} \rightarrow \text{Python}\]

14is valid if:

\[recover(T(I)) \equiv_\Sigma I\]

15The Python inscription must be able to be traced back to the same trace class.

24.5 The code as application

16Application here does not mean that an abstract theory is subsequently transferred onto an external object.

17Application means:

\[\text{The relation becomes executable.}\]

18The difference is not transformed into Python.

19Python is ordered so that it can represent the difference.

Chapter XXV

Basic rules of Delta-Constraint-Coding

1Rule 1

\[\boxed{ | \text{ is primitive.} }\]

2No numerical value, no object, and no function precedes the distinction.

3Rule 2

\[\boxed{ L:=read(\Sigma) }\]

4Every visible label is a reading.

5Rule 3

\[\boxed{ op\rightsquigarrow|{\mu{op}} }\]

6Every operator is read as a binding mode.

7Rule 4

\[\boxed{ F_Q=(G_Q,U_Q,R_Q) }\]

8A task is a question figure.

9Rule 5

\[\boxed{ |U_Q|\geq1 }\]

10Every question possesses at least one opening.

11Rule 6

\[\boxed{ u_j:=0_{R_Q} }\]

12The opening is relative zero in the relation of the question.

13Rule 7

\[\boxed{ a\ op\ b \mapsto a|{\mu{op}}b }\]

14Visible operators are lowered into binding modes.

15Rule 8

\[\boxed{ \Omega_{n+1} := \Omega_n+H_n }\]

16The trace arises through ordered accumulation.

17Rule 9

\[\boxed{ Addr := read(\Omega|D^{out}|R_Q) }\]

18The address is a reading of the holonomy under the question relation.

19Rule 10

\[\boxed{ Ans := read(Addr) }\]

20The answer is the public readout of the closing address.

21Rule 11

\[\boxed{ recover(Ans) \equiv_\Sigma \Sigma }\]

22Every valid answer remains readable back to its trace class.

23Rule 12

\[\boxed{ \text{Do not calculate values. Make difference readable.} }\]

24Conclusion

25The executable sign

26Tractatus notation begins with:

\[|\]

27Python begins with signs, names, parentheses, functions, and lines.

28Yet these forms too receive their meaning only through differences.

29A name distinguishes a place.

30A parenthesis binds an order.

31A function marks a transition.

32A condition opens or closes a gate.

33A loop clocks a path.

34A list carries a trace.

35A return makes a reading public.

36Thus Python does not become the origin of the difference.

37It becomes a medium of its representation.

38The complete connection is:

\[| \rightarrow \Delta \rightarrow I \rightarrow F_Q \rightarrow \gamma \rightarrow H_n \rightarrow \Omega \rightarrow Addr \rightarrow read\]

39In Python:

relation = distinguish(left, right)

question = form_question(
    relation,
)

path = trace_path(
    question,
)

trace = integrate(
    path,
    through=gates,
)

address = locate(
    trace,
    relative_to=question,
)

label = read(
    address,
)

40The code writes no finished object.

41It holds the opening of the relation.

42It orders the transitions.

43It limits visibility.

44It preserves the trace.

45It reads the address.

46It releases the label.

47Thus the sign becomes an executable sign.

48Thus the formula becomes an enactment.

49Thus the difference becomes code without the difference becoming a thing in the code.

\[\boxed{ \text{The formula shows the relation.} } ] [ \boxed{ \text{The code unfolds its reading.} } ] [ \boxed{ \text{Both write the same difference.} }\]