PKL Rev9
EN · DE · Repository

Polycontextural logic in Lean 4 and Mathlib — Edition PKL Rev9, in three parts

The Mathematical Shape of the Architecture — Part A: The Shape

About this edition

This paper posits that the world it deals with has more than one contexture. It does not prove this: its theorems hold without the posit; only their reading as limits between contextures depends on it. Günther named the opposite position. That the universe we live in is mono-contextural he calls "a dogma proven by nothing, which admittedly follows necessarily from classical ontology" (our translation) (source-verified, tml 1971 p. 8, on the page image). In the same sentence he concedes what an opponent would rightly say: from classical ontology the single contexture follows necessarily. What is disputed is only that it is proven. The opposite position therefore rests on a posit as well, and neither of the two is the neutral default. This paper names its posit first; of a reader who disagrees it asks only that he name his in the same way.

This paper has three parts. Part A shows the shape of the architecture in words: what is built, ordered by Günther's two plans. Where a theorem of the corpus carries a statement, its name stands in code type and its number in square brackets; a reader who skips both loses nothing of the course of the text. The few computations Part A shows are elementary. Part B is the apparatus: for every number the theorem, its module and its axiom profile, at a named state. Part C brings together the measured limits of the build. Whoever wants to know whether anything here is overstated will find in Part B, for every number, the theorem, its axiom profile and its range, together with the counting routes, the apparatus of checks and the list of errors this project has found in itself. The abbreviations of the sources, such as HKN or C&V, are resolved at the beginning of Part B.

The separation has a reason. In the first three editions the bookkeeping stood beside every result, and the reader heard the caveats louder than the theorems. Here the matter stands; the evidence stands together in one place.

The numerals in square brackets point to the carrier table in Part B. Where the text says proved, a machine-checked theorem stands there. Where it says posited, an explicit premise stands there. Where it says interpretation, nothing stands there — interpretation is the assignment of the formal to the conceptual, and it is called what it is.

They are edition-internal. Like footnote numbers they are assigned afresh in each edition; whoever wants to refer to a theorem names it from the table, not by its numeral.

Interpretation takes three shapes, and one test separates them: how many passages of the source carry the statement, and does one carry it alone?

Where a place names its shape, the shape is determined; where it says only interpretation, the shape is not determined, and the absence of the note means nothing.

What this edition changes compared with the eighth

The eighth edition remains reachable and is not updated. The ninth changes it in five ways.

It corrects first. Statements of the previous edition that no longer held, or did not hold even when it appeared, are corrected; the list of errors in Part B names each. Among them is a sentence that attributed a finding of this build to Günther. From this edition on, no statement about our own apparatus stands in the text without its state and its route; each is taken from a measurement that can be repeated.

It shows what orders the theorems. Before the first chapter stand two plans of Günther's, the eightfold thematic and the compound contextures, each with a chapter of its own. The build has grown since the previous edition, like a fan and not like a tower. Its load-bearing theorems are textbook material one by one; together they are a calibration of Günther's combinatorics. Günther's plans give them their order; the connection of the two plans is ours.

It adds to two chapters. Chapter 3 receives the time of 1937 as a theorem and Günther's own example, Buridan's ass. Chapter 5 receives the heterarchic pair that Günther singles out on two different paths, in 1962 and in Cognition and Volition.

It has a third part. Part C brings together the measured limits of the build. A limit of which one knows what it hangs on is a result.

It has new marks. To proved, posited and interpretation with its three shapes are added:

Proved now carries the number of its carrier in Part B.

The shape in one sentence. A combinatorics with a built-in direction carries logics whose separation does not consist in a missing map between them; Günther's two plans order what is built on it, and full cycles through his negation system run through the whole compound while every single step stays within one logic; this direction reappears as time and as ascent; the distance between growing richness and unchanging reachability is its measure; it holds exactly as far as order reaches — the same order that the exchange of two values enforces without ever grounding it; and where cognition and volition are read as its two strands, their connection is thereby regulated and not grounded.

value-filling bridge 2^C(m,2) against 2 1 ground 2 contextures 3 time 4 mode of proof 5 measure 6 ascent 7 reach combinatorial ascent chooses, descent computes temporal no linear measure hierarchical no signature-faithful form as far as order reaches
Figure 1 — The chapters and the arc they carry. The same asymmetry in three languages; the measure stands in the middle, the limit at the edge.

For Thomas Mahler

This paper stands in a line it did not itself found. Thomas Mahler's Morphogrammatik (Bochum and Dortmund, 1993) worked kenogrammatics out as a formal theory where Günther had left it as a programme — keno-sequences, normal forms, concatenation, degree of accretion. It arose in the research project Theorie komplexer biologischer Systeme under the direction of Rudolf Kaehr, who continued Günther's work after his death; that Kaehr took his doctorate with Günther is said concordantly by several sources, and this paper reports it as their information and not as its own.

What is formalised here would not have been possible in this form without that earlier work. We have read Mahler's concatenation and built it differently where our tool allowed — functionally rather than over a list of triples —; that is no objection to it but its use. Where this paper gets further, it gets further on paths not its own, and where it does not get further, it stands at the same limits Mahler himself named.

On the bibliographic record: the version used here names Thomas Mahler alone on its title page. Some catalogues list the printed edition of 1993 under two names, Kaehr and Mahler; the printed edition was not available for inspection.

Two plans

This edition orders its theorems by two plans, and both are Günther's.

The first is the eightfold thematic of objective spirit (Lille 1968). Günther obtains its intervals from an "ascending scale of designations by one value, by two values, by three values and so on" and adds up the values these designations take in (our translation) (source-verified, Lille p. 7). The length of an interval is the number of themes treated in it (source-verified, Lille p. 11). The intervals begin at 1, 3, 6, 10, 15, 21, 28, 36.

The second are the compound contextures, the joining of several two-valued logics. The first is the three-valued system. The next higher ones, Günther writes, "are indicated by the value numbers 6, 10, 15, 21, 28, …", computable by the formula m(m−1)/2 (our translation) (source-verified, HKN p. 26, on the page image).

Figure 2 — Two constructions of Günther's. Left, the ascending scale of designation types, "by one value, by two values, by three values and so on" (our translation), whose values he adds up (Lille pp. 7, 11). Right, the formula m(m−1)/2, the number of pairs from m, by which Günther computes the sequence. The lower rows compare value numbers with value numbers: Günther expressly calls 3, 6, 10 … the value numbers of his compound contextures (Die historische Kategorie des Neuen p. 26). That the two sequences coincide is forced by the identity 1 + … + k = C(k+1, 2). That Günther connects the two plans is stated in no passage found; the connection is ours. In the corpus the compound sequence is defined from the ontology sequence, not proven.

The two sequences coincide from the second term on. What forces this is not depth but an identity: 1 + 2 + … + k = C(k+1, 2) (computed). The equality of the numbers is therefore arithmetic. A finding about Günther's text is something else: that he hangs his two plans on two different constructions, a sum over designation types and a number of pairs, which this identity brings together (source-verified, both constructions). That he connects the two plans with each other is stated in no passage found. The connection is ours (synopsis). In the corpus the sequence of compound contextures is defined from the sequence of interval starts (verbundWertzahl), not proven from it.

This is how the order of this paper is built: The order of the theorems is founded by Günther's plans. The connection of the plans is founded by this house. No theorem connects the theorems.

The build has grown since the previous edition, but like a fan, not like a tower. Only few load-bearing theorems are consumed outside their module, among them exactly_fortyfour, inv_is_min_length and three_iff_adj (measured at single places, not across the whole corpus). Each load-bearing theorem is textbook material by itself. Together they are a calibration: Günther's combinatorics stands under formal proof, and it holds. Beside them stand findings that are not calibration: where Günther grounds his plan and where not, the two constructions behind his two plans, the identification of his two mediations, a limit whose place is now determined, and a finding of this build which the previous edition had attributed to Günther. They stand one by one, each with its mark.

The eightfold thematic

In the Structural Minimal Conditions of a Theory of Objective Spirit, Günther divides objective spirit into eight themes: a being without reflection that recurs at every stage, three themes of nature, three of subjective spirit, and an eighth that arises from the exhaustion of reflection (source-verified, Lille p. 19).

In the corpus each of the eight places has a correlate verified at the term; open is only the passage beyond the eighth place, called AT-1b here (proved [1], [2], [3], [4], [5], [6], [7], [8], per correlate). Which formalization is which place is our attribution, not a statement of Günther's (assignment). Among the eight correlates only the eighth, the reaching of a fixed point, carries the axiom of choice; the proof that excludes return, at the third place, uses no axiom at all (measured, profiles in Part B). At three points the formalization says something about Günther's text.

Where he grounds his plan and where not. The division into one and seven Günther grounds himself: only one value is positive, the others are its reflections (source-verified, Lille). The division of the seven into three and three he gives in Lille without a reason (source-verified, range: Lille). The build separates the two triads at a change of carrier. The themes of nature are properties of a process; on the lifted carrier of its reflection there then stand exchange, mediation and ground, and freedom from return does not lift along (reflect_not_noreturn) (proved [9]). That is a decision of the build, not a reason Günther gave (posited).

One process, two names, two forms. Of the eighth place Günther says that subjectivity returns into its ground and that with it the next interval begins (source-verified, Lille). In the build the two versions exclude each other. That follows from the choice to bind one form to a fixed point; both statements about the eighth place are projections of the same definition (exhausts_ground, decomp_never_exhausts) (proved [10], [11], definitional). What remains as substance is a theorem: the step across the intervals always goes on and has no fixed point (dstep_no_fixpoint) (proved [12]). The second form, the beginning of the next interval, rests on the decomposition of every value number into interval start and remainder (decomp, dstep_decomp, decomp_never_exhausts) (proved [13], [11]). This decomposition does not redeem the passage AT-1b. Whether Günther's process is thereby two, or one with two sides, the build does not decide (reading).

The upper edge. What lies beyond the eighth place is in Part C.

At the one, the two new chapters touch. The being without reflection has a correlate in the corpus, the fixed point that recurs at every stage (RecurringGround) (proved [1]). It is not an elementary contexture in the sense of the corpus: under that name the corpus carries only pairs of values. Günther's self-cycle, the one-valued form of the elementary contexture, is deliberately not built. The next chapter returns to this.

A point Günther excludes himself. That the even perfect numbers fall on interval starts is his own conjecture. He arrived at it "from considerations of reflection theory" and communicated it to Heinz von Foerster, who checked it (our translation) (source-verified, Lille pp. 13 f.). Mathematically it is the theorem of Euclid and Euler (textbook). Günther treats the matter as an excursus and records: "For the problem of the structural minimal conditions of a theory of objective spirit, the considerations of this excursus have not been taken into account." (our translation) (source-verified, Lille) This paper follows him in that.

The compound and its cycles

Günther says in one sentence what a compound contexture is: "a repeated, relatively independent occurrence of classical logic at different ontological 'world-places'" (our translation) (source-verified, tml 1971).

Two stipulations and a table

Günther posits the ground of this chapter himself, and he says that he posits. "We stipulate further that a negation system, considered calculus-theoretically, represents nothing other than the totality of all permutations of which a given value number n is capable." (our translation) (source-verified, tml 1971 p. 10, on the page image) And one page later: "If we now stipulate that an elementary contexture is constituted by a symmetrical exchange relation of any two values, then the simplest form of a compound contexture consists of three elementary contextures." (our translation) (source-verified, tml 1971) The "further" of the first passage points to an earlier stipulation not read here.

Between the two stands a statement: Table II, which Günther gives for three values, "represents the negation structure underlying the simplest case of a compound contexture" (our translation) (source-verified, tml 1971 p. 10, on the page image). Its last column carries no equals sign. It carries a single operator sign, with 2.1.2 above, 1.2.1 below, and below that the values 3 · 2 · 1 (source-verified, on the page image). Günther writes two paths one above the other that lead to the same place.

Figure 3 — The six arrangements of three values, joined by Günther's negators N₁ and N₂. The two shortest paths from p to the reversal 3 2 1, N₁N₂N₁ and N₂N₁N₂, meet opposite each other: this is the braid relation (genesen_kuerzeste). In Table II Günther writes the two paths one above the other in a single column, without an equals sign (tml 1971 p. 10, checked on the page image); the equals sign appears in 1962, as a definition (cyb p. 34). Together the two paths form the boundary, the one full cycle for three values (triadic_unique); its word is N₁N₂N₁ · N₂N₁N₂.

The two shortest paths from the initial arrangement into the reversal 3 2 1 are exactly N₁N₂N₁ and N₂N₁N₂ (genesen_kuerzeste) (proved [14]). That they arrive at the same place is the braid relation. The notation of the table asserts this equality without needing a sign for it. As an equation it appears in 1962, as a definition (cyb p. 34) (source-verified).

The elementary contexture — three ranges

The word has three ranges in this paper, and they are kept apart:

The mediated elementary contexture

Why non-neighbouring values do not exchange directly, Günther says himself: the values are "direction-oriented ordinal numbers", and P "is neither the immediate predecessor nor the immediate successor of N 2" (our translation) (source-verified, IGN pp. 17 f.). The exchange of non-neighbouring values therefore goes through the shared value, and Günther ties this mediation to the second negation (source-verified, IGN p. 19).

In the corpus this is built. The pair {i, i+2} is an elementary contexture (isElemContexture_Em), and the mediated exchange swaps exactly this pair, for every value number (mediated_elem) (proved [16], [17]).

The paper of 1971 identifies two mediations that stand apart elsewhere. To the exchange relations 1⟷2 and 2⟷3 is added "a 'mediated' exchange relation of the values 1⟷3", and this is one of the three elementary contextures of which the simplest compound contexture consists (our translation) (source-verified, tml 1971). What IGN calls the mediated is here a constituent of the compound.

How the elementary contextures touch

Two negators whose pairs of values share a value generate the cycle relation. Two negators whose pairs share no value commute. Both hold for every value number (overlap_iff, disjoint_iff_comm, overlap_iff_three) (proved [18], [19], [20]). The negative half is in Günther: non-neighbouring negators stand "side by side without connection" (our translation) (source-verified, IGN p. 48). That the positive half is his statement is attribution (assignment).

Figure 4 — Günther's negation system for four values, the totality of all permutations (tml p. 10): each vertex an arrangement, each edge a negator. The graph is the truncated octahedron. Its hexagons are the faces of two negators that share a value; there the cycle relation sits. Its squares are the faces of two negators that share none; there they commute (overlap_iff_three, disjoint_iff_comm; the division of the surface is textbook). In both halves the division can be read off the edge colours: around a square N₁ and N₃ alternate, around a hexagon two neighbouring negators. Right, laid out flat, Günther's circle 2 (IGN p. 44) as a full cycle along the edges, taken verbatim from the corpus (kreis2). The last two steps are missing in the print of IGN p. 44; Günther's 1974 print has them.

For four values the negation system is a solid: the 24 arrangements are the vertices, the negators the edges, and the graph is the truncated octahedron (computed). Its hexagons are the faces of two negators that share a value, its squares the faces of N₁ and N₃. The cycle relation at the overlap and the commuting at the separation are the division of this surface into hexagons and squares (textbook).

Joining and compound contexture

Günther reads the same sequence 3, 6, 10, … twice: as the value numbers of his compound contextures and, two paragraphs later, as the number of elementary contextures "that must come together in each case" (our translation) (source-verified, HKN p. 26, on the page image). Under the second reading his compound contexture coincides with the joining of all pairs of values exactly once, at three values. From six values on the joining takes more pairs than Günther's compound has elementary contextures: 15 against 6 (verbund_eq_pairs_iff) (proved [21]).

The paper therefore keeps two words apart. Joining is the built notion, which exists for every value number from three on. Compound contexture is Günther's notion, which has a stage only at his value numbers 3, 6, 10, … Four values are no such stage. Günther's cycles on four values, discussed next, lie between two stages of his compound contextures.

The cycles

A full cycle is a sequence of negations that runs through every arrangement of the values exactly once and returns to the start, a Hamiltonian cycle of the negation system. Günther calls it a circle (assignment). He uses the same word for the cycle relation between two stations; the paper therefore says full cycle.

For every value number. Where Günther speaks of every value number, he posits the negation system and the condition that only neighbours exchange directly (source-verified, tml 1971 p. 10; Die Metamorphose der Zahl p. 7), not the full cycle (range: Part B). Full cycles he shows for three and for four values. The gap between these cases and the general one is closed by a theorem: for every value number there is a full cycle (sjt_full) (proved [22]). The procedure is that of Steinhaus, Johnson and Trotter (textbook: Steinhaus 1958, Trotter 1962, Johnson 1963). English bell-ringers knew it as plain changes long before. The theorem meets Günther's own sequences: for three values his sequence (5) (sjt2_eq), for four values his second circle in the extended version described in the next paragraph, up to the mirroring N₁ ↔ N₃ (sjt3_mirror_kreis2) (proved [23], [24], calibration). Among the 44 cycles, four carry the same distribution of negators as this one, two up to mirroring. The distribution was fixed by Günther's plan to take each of his three circles from a different family (source-verified, IGN p. 43). Within the family he chose, of the two classes, the one that the procedure of Steinhaus, Johnson and Trotter generates (measured on the corpus). The paper claims no reason for this choice.

The second circle and its print. Günther's second circle, as printed in IGN, does not return to the start (kreis2Gedruckt_not_closed) (proved [25]). The page itself demands the missing steps. In the same paragraph Günther counts that "N 1 occurs nine times, the next negation N 2 appears six times" and N 3 operates nine times (our translation). The printed circle has 8, 6 and 8; only the extended one has 9, 6 and 9 (source-verified, IGN p. 44; counted). Extended by two steps, N₁ and N₃, it becomes a full cycle, and no other extension by two steps achieves this (kreis2_emendation) (proved [26]). Günther's own print of 1974 contains the extended sequence, shifted by one step (janus1974) (source-verified, proved [27]).

The 44. For four values Günther gives 44 full cycles (source-verified, IGN). Why he could not determine the number himself he writes in the afterword to Das Janusgesicht der Dialektik: "The reason for this is to be sought in the fact that at the time of writing his treatise the author of the lecture had no access to a computer." Dr. Alexander Andrew in Reading programmed the question, and "according to the machine" there are 88 (our translation) (source-verified, Janusgesicht p. 23). For the 44 Günther thanks Dipl.-Math. Gerhard Thomas (source-verified, IGN, n. 40).

Both numbers are right, and they count the same thing differently. The corpus counts 88 sequences from a fixed start and 44 up to reversal (exactly_fortyfour and the directed list in the same module) (proved [28], without the axiom of choice). The machine of 1974 counted with direction, Thomas without. 44 is the number of Hamiltonian cycles of the truncated octahedron. It stands in Wolfram's graph data (measured: GraphData, a curated database) and has been recomputed on the graph (computed). Here it is formally checked; an exhaustive enumeration is a proof.

Günther's claims about these cycles. What Günther says without proof about the four-valued cycles stands here as theorems: that in a full cycle the three operators never repeat equally often, that the cycles fall into families, and that for three values there is only one circle (source-verified, IGN pp. 29, 43; proved, as compilations: no_888_all [29], the family theorem [30], triadic_unique [31]).

From this a sentence about this part of his work can be formed, and it is our synopsis: His claims about the cycles of his negation systems hold, as far as we have checked them. The number he could not give; in 1974 a machine in Reading gave it, in 1979 a colleague counted it; here it is formally checked (synopsis).

The second negation: range, genesis, mediation (IGN pp. 17–19)

The range. The second negation reaches beyond the classical pair. For n values, n! − 2 arrangements lie outside the two that N₁ alone reaches; for three values these are the four columns Günther gives (transklassisch_card) (proved [32]; source-verified, HKN p. 24).

The genesis. The two paths into the reversal, N₁N₂N₁ and N₂N₁N₂, are the two geneses Günther carries from 1962 to 1979. They are the shortest and the only ones of this length (genesen_kuerzeste) (proved [14]); the hexagon figure shows them. IGN p. 19 prints "N 1.2.3" for the forward path of the first permutation group. For three values there is no third negator. Three lines later, in the same paragraph, the page prints "N 1.2.1" for the return path of the second group, and its table is symmetrical: the return path of one group takes the negators of the forward path of the other. The page itself therefore demands "N 1.2.1", and the corpus confirms this form (Part B, note on genesen_kuerzeste). Where the paper quotes the passage, it reads [1.2.1].

The mediation. The mediated exchange is described above (mediated_swap, mediated_elem). Günther ties it to the second negation (source-verified, IGN p. 19).

What in this is trans-contextural. Every negator stays within its range. The operations of a contexture, Günther writes, "remain strictly enclosed in the respective contextural domain in which they arose. Subjective thought cannot propagate itself into the object. The belief in this is magic." (our translation) (source-verified, tml 1971 p. 9, on the page image) A full cycle consists only of such steps and still runs through all arrangements. The trans-contextural arises here not through a foreign operation but through the chaining of enclosed ones; it lies in the order of the steps, not in the step (reading). The single step that would leave the contexture does not exist in the corpus; Part C records this as a definitional gap. The order of the steps exists.

Günther's time as a path. It is on exactly these sequences that Günther reads time: "Time plays a role in this insofar as the negation sequences N 1·2·1·2·1·2 and N 2·1·2·1·2·1 are always a path of reflection that runs ahead in time and that, through the different order of the negations, can take two shapes, which in turn produce an ambiguity." (our translation) (source-verified, IGN pp. 19 f.) Elsewhere he calls time "the ontic shape of the exchange relation" (source-verified, IGN), and he gives the reason why the genesis counts and not only its result: "mediation is essentially a problem of the combination of time and timeless logic" (our translation) (source-verified, HKN). The corpus has no theorem about time as a path. This path is something other than the two times without a common measure that Chapter 3 is about.

Günther names as the connection of number and will "what can be done, or what ought to be done" (our translation) (source-verified, IGN p. 54). The can is built here: the negators, the second negation, the full cycles (assignment).

1 · The ground: a combinatorics prior to logic

At the very bottom lies something that is not yet a logic. One may picture it as a row of empty places into which nothing has yet been entered. Two such rows count as the same if the same places repeat one another — nothing further is asked. No values, no truth, no negation; only distinguishability and repetition.

That sounds poorer than it is. Take the row

a  b  b  a  c

and beside it

x  y  y  x  z

They consist of different signs and are nevertheless the same pattern: the first and fourth place carry the same thing, the second and third carry the same thing, the fifth carries something new. What counts here is not what stands at a place, but which places agree.

Three granularities, and why only the finest carries

Günther distinguishes three degrees by which such rows may be classified, and the distinction is not his invention alone but an obvious gradation.

The coarsest counts only how many distinct signs occur: three in both rows above. The middle one records how often something repeats, without regard to position: here two blocks of size two and one of size one. The finest retains the position-exact pattern.

Only the finest can be the ground of a logic, and the reason is structural, not aesthetic. An assignment — the entering of values into the places — must be able to say which places carry the same value. Whoever knows only the block sizes does not know the assignment: "two blocks of size two" fits a b b a as well as a a b b, and those are different assignment situations. The coarser degrees are therefore readable marks of the ground, not possible grounds.

sequence 1 sequence 2 normal form abb ac xyy xz 011 02 proto3 marks deutero2, 2, 1 trito0, 1, 1, 0, 2 coarser → finer
Figure 5 — Two assignments with the same pattern; the normal form makes them identical. Below, the three granularities as increasingly fine classifications of the same row — only the finest says which places carry the same value.

The normal form, and why it is built rather than asserted

The finest pattern can be written canonically. One numbers the signs in the order of their first occurrence: the first gets zero, each new one the next higher number. From a b b a c comes

0  1  1  0  2

and from x y y x z the same. Two rows carry the same pattern if and only if their normal forms agree — that is proved [33], in both directions and in a form that does not depend on the kind of signs [34], [35].

These normal forms are known in combinatorics; what is remarkable is not their existence but that the architecture has built the canonisation as a procedure and not as a claim. There is a prescription that computes the normal form of any row, and a decidable predicate that says whether a given row is already in normal form. The difference matters: an asserted uniqueness can be false, a built procedure computes.

A construction decision stands here too, and it could easily have gone otherwise. Pattern identity could be introduced as a quotient — one simply declares rows with the same pattern to be the same object. The architecture does not do it. A quotient immediately creates connective work and conceals what the normal form leaves visible; as long as the normal-form semantics carries, it is a purchase on credit. This is no embarrassment but a choice, and it stands so in the corpus.

The normal forms of length n correspond exactly to the partitions of an n-element set; both have the same number (KPC.card_rgs_eq_card_finpartition, proved [36]). That this number is the Bell number the theorem does not say.

The built-in direction

Now comes the first piece of information that goes beyond mere ordering.

A pattern can be extended — one place appended — or retracted: the last place struck. These two operations are not mirror images.

Take the pattern 0 1 1 0. It contains two distinct signs. For the fifth place there are three possibilities: it repeats the first sign, it repeats the second, or it introduces a third. In general a pattern whose largest sign carries the number k has exactly k+2 extensions. Retraction, by contrast, is unique: strike the last place, and precisely one pattern remains.

This is no notational nicety but the matter itself: ascent chooses, descent computes. Whoever extends makes a decision that does not follow from what is given; whoever shortens performs an operation whose result is fixed. Between the two directions lies not a change of sign but a difference in the kind of determinacy.

Günther calls two directions evolutive and emanative — terms he takes over from the metaphysics of history and brings to bear on the kenogrammatic layers. That beneath them lies a pure counting asymmetry, k+2 against one, is stated nowhere in his work; it is a finding of this construction (assignment). This asymmetry is the germ of what returns in chapter 3 as time and in chapter 6 as ascent — and that at this point it is nothing but a count is what makes it load-bearing.

Canonisation knows the direction too

The normal form and the striking of a place are compatible — but only at one end. Number an initial segment on its own and the result is the same as numbering the whole and then cutting (proved [37]); the reason is that assignment goes by first occurrence, and an initial segment has the same first occurrences.

At the other end this fails. Cut at the front and the numbering starts over: from 0,1 striking the first place gives the row 1, and that is no normal form — canonised it reads 0. A sign that was the second is now the first.

The direction thus appears a second time in this chapter, and at a place where one does not expect it: not in the relation of the patterns to one another, but in the prescription that makes them comparable at all. Canonisation is compatible with shortening from behind and not with shortening from the front. What is called the descent in chapter 6 has its ground here.

011 emanative unique pattern 01 10 011 00 011 01 011 02 evolutive branching
Figure 6 — The asymmetry in its sharpest form: retraction is unique, extension chooses. A pattern with largest mark k has k+2 continuations and exactly one retraction — computed.

Where the ground and the logic hang together

So far there has been no talk of values. The transition to logic is the moment when values are entered into the places. And here it emerges that the ground does not simply accept the range of values.

The question is: which patterns can be filled with how many values at all? It has a sharp answer. A pattern can be filled with two values if and only if its signs do not go beyond one — proved [38].

One direction is an encoding: whoever has only zeros and ones in the pattern writes down the two values. The other direction is the interesting one. If a two occurs in the pattern, then — because of the construction of the normal form, in which each new sign exceeds the previous maximum by exactly one — there are three places with pairwise distinct signs. Three pairwise distinct signs require three pairwise distinct values, and a two-valued row does not have them. The closing argument is a counting argument, and it is the one place where the proof goes beyond mere recoding.

Worked through at a fixed length, the matter becomes tangible. At four places there are fifteen distinct patterns; eight of them can be filled with two values — and both numbers are proved [39], [40] and not looked up. The unequal pair 15 to 8 says: the ground is richer than any fixed valency. A witness of this excess is quickly found — the pattern

0  1  2  0

requires three values, and no two-valued row satisfies it.

Whoever recalls classical logic will recognise the number: the sixteen binary truth functions rest on eight patterns. The other seven do not occur in it — not because they were overlooked, but because two values do not reach them.

Why eight patterns carry sixteen tables

Up to here that was an observation: two numbers that fit together. It has become a calculation, and the calculation has three parts.

The fibre. To every two-valued fillable pattern of length four there belong exactly two truth tables, and which of the two is at hand is decided by the filling of the first place alone [41]. The theorem is not built as a count, but as a correspondence to the two truth values themselves: the first place chooses, everything else follows from the pattern. The two tables over one pattern come apart by a global exchange of values — they agree at no place whatever. Determined by the first place does not mean different only at the first place; it is the first that decides, and after that everything flips with it.

The calculation. With this, 16 = 2 · 8 is no longer an observation but an equation between two figures of this corpus [42]: on the left the truth tables over four rows, on the right the two-valued fillable patterns. It is Günther's own calculation, and it now stands on both sides within the corpus rather than on one.

The pair of witnesses. The excess above can be graded instead of merely asserted. The pattern 0 1 2 0 requires three values and not two; the pattern 0 1 2 3 requires four and not three [43]. The steps two, three and four are thereby separated at witnesses — and the first of the two witnesses is precisely the pattern that had to carry the excess a few lines above.

What the three theorems do not say. They stand for length four. The general series — two to the power n minus one tables for every pattern of length n — is not built, and this paper does not assert it. And the numbers under which Günther lists his tables are his count; their assignment to the classes built here remains interpretation.

What this chapter does not say

The ground is not a logic, and it does not become one. It carries no truth values, no negation, no inference; all of that comes only with an assignment.

Kenogram is not contexture. When the next chapter speaks of contextures and this one of k-valued fillability, the reading that a k-fillable row is "a k-valued system" is an interpretation — it hangs on the bridge [38] that supports it, and it is expressly labelled as interpretation in the corpus. The theorem says something about values in places; that values in places yield a logic, it does not say.

The threefold gradation of granularities is attested in Günther with this explicitness; the finer division of kinds of map with which the architecture works is not — it is a refinement of this project and does not claim him as its authority.

2 · The contextures: separated, without any map being missing

A contexture is an assignment on the ground that has the rank of a logic of its own. Not a region within an encompassing logic, but a logic: with its own distinction of true and false, self-contained. The overall picture is therefore not one logic with regions, but a web of logics over a shared pre-logical ground.

The question around which everything turns is: wherein does their separation consist?

The case at which the obvious answer fails

The obvious answer would be: two contextures are separated if no translation exists between them — no structure-preserving map.

This answer fails at Günther's own basic case. The most elementary case of discontexturality is for him the opposition of Being and Nothing. And these two are for him isomorphic. He appeals to mathematical logic, in which the matter has long been known "as the isomorphism of two-valuedness and the semantic symmetry of affirmation and negation", and to the mathematician Reinhold Baer, who pointed to this isomorphism at a Hegel congress in 1931. Baer's statement that between a statement and its negation there is "no essential difference" Günther calls "unassailable", and yet he holds that "an essential ontological difference" exists (our translation, from the German column; source-verified, Die historische Kategorie des Neuen p. 10, on the page image: Hermeneutes, gg_category.pdf). Between them there is a complete, structure-preserving map — and they are discontextural nonetheless.

One may read this finding as a contradiction or as a hint. The architecture reads it as a hint, and the hint is precise: the map exists, but it is stated from outside, not executed from within. Whoever stands in one of the two contextures and has only the means that hold there does not arrive at it. This is Günther's own distinction, the same one with which he handles the excluded middle: it holds for both sides and is nevertheless applicable only to one.

The formalisation decision that follows

Discontexturality therefore appears not as the non-existence of a map, but as non-assemblability from the means available inside.

Concretely: one fixes the operations that hold within a contexture — in the simplest case two connectives and a reversal — and asks which operations can be built from them by composition, at any depth and in any wiring. Everything so buildable is inside. What cannot be so built is not.

What is missing is not the map, but the path to it from within.

Two shorter formulations are expressly excluded and carried in the corpus as construction prohibitions. One would be: two contextures are separated if they have nothing in common. The other: they are separated if no map exists between them. The second fails at Being and Nothing, as just shown. The first fails at a fact one can count.

The overlap is counted, not agreed

Consider three values and the two-element regions within them: {0,1}, {1,2}, {0,2}. Any two of them have exactly one element in common. This is no convention that could have been settled otherwise, but a counting statement — and it is proved [45].

That is more than it looks. Were the overlap merely a construction decision, one could drop it and model contextures as disjoint; the prohibition would then be a house rule. Since it is a counted property of the situation, the prohibition is not a rule but a consequence: whoever posits the elementary contextures as disjoint is no longer speaking about the same objects. And the overlap really does carry weight in the proofs — it is the reason why an operation can behave differently on different elementary contextures without leaving any region anywhere. Without the shared value that case would not exist.

The joining: what several contextures are together

Besides the elementary contexture Günther knows the compound contexture — several elementary contextures together, and between them a mediation. The joining is built. It has three statements, and the first of them was a justification in Günther.

At least three values, and now as a theorem. Günther says a compound contexture requires at least three values, and he justifies it by saying that with two the second value stands over against the first unmediated. The corresponding theorem says it without appeal to intuition: more than one elementary contexture — that is, anything at all that could come together — exists exactly from three values on [46]. At two values the situation is not poor but single: there is one contexture, and with one alone nothing joins.

They hang together. Take two distinct elementary contextures: either they overlap, or there is a third that touches both [47]. The connection therefore does not fall apart as soon as the stock of values grows; it only becomes indirect. This is the version that survives the preceding section: pairwise overlap holds at three values, connectedness holds beyond that.

And from four on they also occur without a common value. Two elementary contextures with no element in common exist exactly from four values on [48]. Below that every one touches every other; from four on there are pairs that no longer see each other. It is the same number at which reachability tips over in chapter 5 — what becomes of it there stands there.

What does not stand here is the mediation. The joining is the one piece of Günther's concept; the other is the mediation between the contextures so joined, and in him that hangs on the second negation. No theorem of this paper carries it. Chapter 7 says what exactly that means.

Where the posit sits, and why its ground is firm

One point must be stated openly, because the whole series that follows rests on it.

Every two-element set of values is an elementary contexture in Günther's sense — any two, not only those neighbouring in size. — This is posited, not proved.

No theorem decides whether Günther's concept means precisely this. The posit is the load-bearing choice of the architecture, and it stands as such in the corpus.

But its ground is not arbitrary, and that can be shown. A two-element set is closed under the local operations if and only if its two elements are comparable. If they are not, then even the minimum leaves the set — proved [49]. Then it is no self-contained connection and hence no contexture in the sense of the definition from which the architecture proceeds.

The posit remains a posit. But it does not stand on taste, it stands on a theorem: the limit of the formalisation lies in the concept, not in the proof.

What this chapter does not say

The second fundamental relation is only half redeemed. Beside the symmetric exchange relation between elementary contextures Günther names a second, asymmetric one — that between a contexture and what goes beyond it. Its structural part is available as a theorem; its conceptual part is not. That a change of stage is a change of contexture is closed by no theorem. A contextural boundary never closes by a theorem alone, but by definition and theorem together — and the definition is a posit.

The separation is grasped as non-assemblability and not as an ontological rupture. What is proved are failures of reduction. To read them so that a rupture of being appears in them is interpretation.

3 · Time: a structure that fits into no linear measure

Before the architecture speaks of time, the place where Günther first came upon the matter is worth a look. It lies early, in 1937, and it is agreeably tangible.

Three propositions, each plausible on its own

First: time is more powerful than will. Every decision falls within time. No one can will that a decision had fallen earlier; the will finds the moment at which it expresses itself already given.

Second: thought is more powerful than time. Memory runs counter to time and reaches back to the beginning. Thought is not bound to the direction of the flow — it can survey it, and whoever surveys something is in that respect above it.

Third: will is more powerful than thought. With Fichte: that I think rests on the fact that I will to think. Thought does not set itself in motion.

Take the first two together: if thought is more powerful than time and time more powerful than will, then thought is more powerful than will. The third proposition says the opposite. The three cannot be brought into a ranking; they close into a circle.

Günther draws from this no contradiction but a finding: from such propositions no groups of statements of transitive character can ever be formed, and therefore the course of time in actual consciousness remains always ambiguous.

What the architecture makes of it — and what not

It does not claim that thought, will and time behave this way. That assignment of three names to three corners is interpretation and is carried as such.

What is proved is the other, the hard half: in every transitive, irreflexive ordering — on every carrier, without exception — such a three-cycle is impossible [50]. And there is likewise no structure-preserving image of such a cycle into an ordering [51]; it cannot be accommodated by clever translation either. The core of these theorems manages without the classical instruments of set theory.

The claim is therefore: if the three behave this way, then no linear order is their measure — and not because none has been found so far, but because none can exist. That is less than a philosophy of time promises, and more than an observation achieves.

thoughttimewill memory reaches back to the beginning decisions fall in time “that I think” rests on “that I will to think” ≻ means more powerful than Chaining the first two gives thought ≻ will — the third says the opposite. The cycle closes.
Figure 7 — Günther's three principles of potency and their intransitive circle. What is proved is not the circle but its impossibility in every transitive, irreflexive ordering; that the three corners bear these names remains interpretation.

The time of 1937 as a theorem

Günther's early finding about time has a theorem since this edition. In Wahrheit, Wirklichkeit und Zeit he records that for two times there is "no common, objective (objectual) measure of time" (our translation) (source-verified, WWZ p. 3). In the corpus it follows: two times that reverse each other have no common measure (no_common_measure_inverse) (proved [52], corollary). That Günther's two times reverse each other the paper reads from his text; he does not say it in these words (reading).

This time is not that of the compound chapter. There one path runs ahead in time; here stand two times without a common measure. The paper keeps the two apart.

The stock of movement

Over the web of contextures lies a threefold doctrine of movement — three ways in which something can change, without its yet being said what changes:

Their compositions are smooth in exactly one direction; there is no canonical interchange of directions, and that is not an image but proved [53].

The third mode of movement — irreversible positing, the step that is not taken back — is irreversible for a reason the source names. In a heterarchical circular order every beginning is an arbitrary choice, and once one is chosen there is "keinen originären Grund … zu entscheiden, ob der Kreis links- oder rechtsläufig durchlaufen werden soll" — no original ground for deciding whether the circle is to be run through leftward or rightward; there Günther comes upon the logical motif of contingency, and there "hakt der Wille ein, der zwar immer nur sich selbst, aber sich selbst in der negativen Kontingenz einer noch nicht durchgeführten Empirie sucht" — the will hooks in, which always seeks only itself, but itself in the negative contingency of an experience not yet carried out. Where no ground decides the direction, no computing back is possible: that is the reason for the irreversibility, and it is the same reason for which the building direction of chapter 1 — the one that chooses — chooses at all.

Here Günther stands in his own words, because no theorem hangs on the place: a programme claims nothing about the object. The three determinations — "Willkürwahl", "negative Kontingenz", "noch nicht durchgeführte Empirie" (arbitrary choice, negative contingency, experience not yet carried out) — are terms and therefore stand in quotation, in the German original, with a rendering of this edition beside them. The place is interpretation, namely assignment of the reason to the form; the form does not hang on it. That the three modes of movement of this chapter are Günther's triad likewise remains assignment from the wording and no measurement (Als Wille, p. 4 of the file used; checked word for word against it).

Two differentials, separated by the number of contextures

Time falls into two statements, and what separates them is a single hard quantity: the number of contextures involved.

Within one contexture the cycle of potency stands against every linear order — that is the finding above.

Between contextures the cumulative movement does not close: under an expressly posited premise — that no state reproduces itself — there is no circle, and the ascent admits no reversing assignment. The premise is declared, not hidden; with a self-reproducing state the claim would fall.

The connection with chapter 1

Both statements are the same asymmetry in another guise. At the ground it appeared as a count — ascent chooses, descent computes — and a second time in canonisation itself, which tolerates shortening from behind and not from the front. Here it appears as the impossibility of reversing a direction or bringing it into a measure. In chapter 6 it returns twice: as a provable limit of the ascent and as a coupling that is measured in one direction only.

That is the core of the whole architecture: a single asymmetry — combinatorial, temporal, hierarchical — and more than once in each of the three languages.

Buridan

Günther himself shows what the proemial relation is good for, with Buridan's ass (source-verified, C&V pp. 16 f.). An animal that has to eat stands in an environment that gives it no directive: "the environment does not provide the volitive system with a directive situation from which the will can take its orders" (source-verified, C&V p. 16). What is missing is the directive to the system, not a ranking among the objects. The judgments about the environment, Günther writes, "may motivate the volition but they do not control the mechanism of volitive action" (source-verified, C&V p. 17). Whoever stands in front of six unequal turnstiles at a station is in the same situation: information about the turnstiles is not an order to the traveller (our example). That the animal has to eat belongs to the example; only this compulsion confronts it with the alternative at all (interpretation).

The situation has three phases. Before, an order holds. Then an exchange occurs that is "absolutely neutral in itself relative to the distinction between subject and object" (source-verified, C&V p. 16). After it, the order holds that the animal founds by its choice. The exchange changes the pole and does not replace it, and the act founds both roles at once (reading). One point Günther leaves open himself: whether the exchange entails the new order ("implies", p. 23) or only sets it off ("triggers", p. 16) (source-verified).

The relation describes the situation in which an act becomes due, and what the act changes in the roles. The act itself it does not describe (interpretation). The example claims no carrier for the proemial relation. Where its limit lies is said in Part C.

What this chapter does not say

The naming of the three corners is interpretation. The statement about the relation of thought, will and time is conditional: it hangs on a premise that this paper does not prove and cannot prove. And the premise in the inter-contextural case — freedom from self-reproducing states — is posited.

4 · How one proves a lack

Everything so far runs into negative statements: something cannot be assembled, cannot be brought into an order, cannot be reached with finitely many values. Such statements have a difficulty of their own, and it is not technical but fundamental.

A system that certifies its own limit from within contradicts itself. Whoever says "with my means X is unreachable" uses precisely those means for the statement. The way out that the architecture takes throughout is called the differential: one does not prove positively within one system, but differentially between two.

The procedure always has the same form. One names a poor class — a precisely specified set of structures — and shows: over all its instances the feature in question is impossible. Beside it one places a rich witness, a concrete structure that carries it.

the hard half the easy half
the feature is impossible — over all instances the feature is exhibited — a construction
all orderings; everything buildable from the local means one concrete structure, built inside the system

The impossibility is the hard half. The construction alone would be the easy one, and passing it off for the whole would be the most comfortable form of self-immunisation.

poor class all strict orders, the generated clone X is impossible — universally quantified the hard half ⊢ rich witness one concrete structure, built internally X is exhibited — a construction the easy half
Figure 8 — The differential is delivered only with the negative half.

Three marks keep the procedure honest.

First: the poor model is built inside the system, not asserted in a metalanguage. Whoever speaks about "all orderings" must be able to say what he is speaking about.

Second: the result is conditional, relative to the posited premises. It does not compel the sceptic; it symmetrises him — from the comfortable position this can be reduced to the known to the explicit position I posit the one encompassing logic, which is itself a posit and thereby has no precedence.

Third: what is proved is the form, never the naming. That a contexture-dependent choice of operations is unreachable from local means is a theorem. That this choice is called mediation is interpretation. The corpus keeps to this down to its file names: the file carrying the theorem is named after the formal property and not after its philosophical reading.

The procedure applies to the workshop as well. In the most recent working phase it has been applied twice to the architecture itself — once to a theorem about the ascent, whose impossibility half runs over all maps and whose possibility half exhibits an explicit witness (chapter 6), and once to a measurement: where an explanation for a result is given, it requires two versions differing in exactly one quantity. Whoever wants to read that up will find it in Part B.

5 · The measure of the separation

Chapter 2 said wherein the separation consists: in non-assemblability from the means available inside. This chapter says how much that is. For an impossibility becomes information only when one knows how large the unreachable is against the reachable.

The frame is everywhere the same. We have finitely many values ordered by size. The elementary contextures are the two-element regions — any two values, and with four levels that is six pairs, in general m(m−1)/2. The local means are two connectives — minimum and maximum — and the reversal of order. An operation is called locally classical if on every elementary contexture it acts like one of the two connectives and does not leave it. The question is which of the locally classical operations can be built from the local means.

Two values: no excess

At two values there is exactly one elementary contexture and exactly two locally classical operations — minimum and maximum themselves. Both are trivially buildable. The excess is zero, and that is proved [54] and not merely observed.

This meets Günther's own threshold, and does so literally: for him the classical two-valued system does not yet represent a compound contexture; the second value yields nothing new and stands unmediated over against the first. What is a thesis in him stands here as a counted zero. And his justification is by now itself a theorem: at two values there is no second elementary contexture, and there is one exactly from three on [46].

Three values: half, and in steps

At three values there are three elementary contextures, and a locally classical operation is nothing other than the specification of on which of them it acts as minimum and on which as maximum: eight choice patterns. Of these exactly four are buildable and exactly four are not — proved [55].

The four reachable ones are not four arbitrary ones. Ordering the elementary contextures by size, they read

(min, min, min)   (max, min, min)   (max, max, min)   (max, max, max)

— a chain of thresholds. Reachable is exactly whoever switches once from minimum to maximum and then stays. Whoever switches back is outside.

Here the second reason for non-assemblability appears for the first time, and it is the genuinely interesting one. An operation can be unreachable because it leaves its contexture — it delivers at some place a value that does not occur in the two-element region. Or it can be unreachable although it preserves every contexture and acts classically on each: then it is due solely to the fact that it chooses differently on different contextures. The first reason is transcendence, the second is non-uniformity. The second long had no witness; it has one now, and completely so — the division into four and four leaves nothing open.

The first reason has its own witness: an operation that refuses an offered pair of values as a whole and thereby produces the third value. It does not lie in what can be built — proved [56]. And it lies not somewhere outside, but at a determinate place: the local means preserve three properties, and every operation built from them preserves all three — not merely the generators, but every composition. The refusal violates exactly one of them and preserves the other two.

Lying outside is cheap in itself: of the 19,683 binary operations over three values only 82 are buildable, less than half a per cent. The claim does not rest on that. It rests on the location.

all binary operations over three values: 19,683 generated clone 82 rejection three invariants are preserved by every term (proved · aggregate): two-valued embedding · fixed point · tolerance relation rejection violates exactly one and preserves the other two the clone size 82 holds equally at four, five and six values — it depends on the signature, not on the number of values
Figure 9 — Not somewhere outside, but beyond exactly one of three properties that every built operation preserves. The clone counts are computed, outside the corpus.

The heterarchic pair

Günther exhausts the eight choices of values from conjunction and disjunction in six hierarchical orders of preference and calls the remaining two, KKD and DDK, "heterarchical (or cyclic)" (source-verified, C&V pp. 26–28). Read as tournaments on three values, six of the eight choices are transitive and two cyclic (cyclic_iff) (proved [57]).

The same two appear as early as 1962, and for a different reason. In Cybernetic Ontology Günther singles out two sequences because they "cannot be defined in this simple manner": their definition needs both negators and both bases (source-verified, cyb p. 39). In the corpus these two sequences are exactly the two operations with a non-transitive tournament (tafel_cyclic_pair) (proved [58]). Two different criteria, Günther's definitional one and ours, meet the same set (proved [58], calibration). The transjunction that hangs on these sequences is, in Günther, their consequence, not their reason (source-verified).

The pair does not depend on the convention of the letters K and D: it goes over into itself when all letters are exchanged (cyclic_letter_swap) (proved [59], calibration). It is therefore the same pair as KKD and DDK in C&V p. 27, provided that Günther's order of places in C&V is that of the corpus or its mirror image. Under an arbitrary order of places this does not hold (cyclic_not_swap23) (proved [60]). Which of the two sequences is Günther's KKD depends on the convention; the paper therefore says "the same pair", not "the same sequence".

Günther himself leaves something open here, and he marks it: "It turns out then that the two cyclic negations … do not yield the cyclic functions KKD and DDK. What we obtain instead is KDD and DKD … A highly significant feature which should be noted but which will not be interpreted within the scope of this essay is that … we do not obtain exactly the order of the conjunctive/disjunctive functors which they should have according to their logical strength." (source-verified, C&V p. 27) This paper does not interpret the passage either. Günther refers the notion of logical strength to Carnap; Carnap has not been read here (Part C).

Four values and beyond: two remain

At four values the picture tips. Of the 64 locally classical operations two remain buildable — minimum and maximum themselves [61]. At five values it is 2 of 1,024, at six 2 of 32,768.

And this is no accident of small numbers but a theorem for all value counts from four upwards: a locally classical operation is buildable if and only if it is globally the minimum or globally the maximum [62]. The proof manages without case distinction on the number of values and without machine enumeration; it runs over six families of neighbourhood relations with breaking points given in closed form, and an induction on path lengths.

The threshold lies at four, and it is no artefact. At three values the statement is false — there four of eight are reachable. At two values there is no witness, because there is only one contexture — and that no second one joins it there is the theorem from chapter 2 [46]. Mediation begins at three; it becomes completely unreachable from four upwards.

The same threshold shows itself on the contexture side, and there it is a different statement: only from four values on are there two elementary contextures with no common value [48]. That both thresholds lie at four follows from the two theorems; that they lie there for the same reason is said by neither.

What it means not to be generable

The phrase not constructible has so far always appeared at a witness: an operation that is not, and a proof of it. It also exists as a statement about the whole class.

Whoever is not generable chooses differently. From four values on: if a locally classical operation is not constructible, then there are two distinct pairs, on one of which it acts like the maximum and on the other like the minimum — and the two pairs do not coincide [63]. With this the phrase used several times in this chapter becomes a theorem about the class, and no longer a description of its witnesses.

And its limit belongs beside it. Choosing differently does not mean choosing disjointly. The theorem yields two pairs that are not the same pair; it does not yield two pairs without a common value. The class does not achieve that — a single witness does: over four and more values there is a non-constructible operation and, for it, two elementary contextures with no common value, on one of which it acts like the maximum and on the other like the minimum [64]. Poor class, rich witness — the same shape as with the measure itself, and here for the second time.

It is at the same time the one place where the two threads of this paper hold the same object: the theorem speaks in the terms of chapter 2 — elementary contexture, no common value — about an object of this chapter.

The richness, counted

Where do the numbers 8, 64, 1,024, 32,768 come from? They are not separate counts but instances of one theorem.

A locally classical operation is nothing other than one choice per elementary contexture. That is proved as a one-to-one correspondence [65]: forwards one reads off, for each elementary contexture, whether the operation acts there as maximum; backwards one builds the operation from the choice data. Their number is thereby

2^C(m,2)

for every value count m — proved and not observed. The exponent is the number of elementary contextures, that is, the number of pairs from m values. It is the same number series that Günther carries for the compound contextures and for the gradation of ontologies — here it stands as the exponent of a space of possibilities, and it stands there not as an observation but as a theorem.

"Locally classical" is thereby no longer a mere property but a blueprint: one choice per elementary contexture, nothing further. And the boundary cases carry without side conditions: with at most one value there is no pair and exactly one operation.

The measure

Now the question of this chapter can be answered. From value stage to value stage

That is the most precise version of what "mediation needs more than local means" says: a distance between two numbers, one of which grows exponentially and the other of which stays constantly two. Not an existence claim — "there is something unreachable" — but a characterisation: the set of the reachable is completely determined, and everything else lies outside.

2 8 64 1,024 32,768 m = 2 m = 3 m = 4 m = 5 m = 6 space of possibilities 2^C(m,2) reachable: 2 the unreachable no excess from here exactly two count, logarithmic
Figure 10 — The space of possibilities grows like 2^C(m,2), the reachable stays at two. The distance between them is the measure of the separation — both series proved, the scale logarithmic.

How much each bound claims

An impossibility statement hangs on the property it works with. If constant operations are admitted to the local means — checkers that always deliver the same value regardless of input — then the bound survives precisely when its property is also respected by constants.

For the witness of transcendence this is not the case: it falls as soon as constants are permitted. For the characterisation from four values upwards and its applications it is the case: they hold. A bound that falls to an added constant claims less than it appears to — and that is written into the corpus as a duty of inspection before every new witness.

What this chapter does not say

The numbers 82, 19,683 and the pattern counts at five and six values are computed, not proved inside the system; they stand as orders of magnitude and carry no claim. The chain of thresholds at three values is likewise computed.

And: the expressions "locally classical" and "mediation" are not the same thing. The theorem says that a contexture-dependent choice is not buildable from local means. That such a choice is the formal locus of what Günther calls mediation is interpretation — grounded interpretation, but no theorem.

6 · The ascent

Günther takes polycontexturality as a world picture: reality as a system of infinitely expanding contextures with growing structural richness. A world picture is no subject for theorems, and the architecture does not claim it.

But two structural statements are contained in this determination, and those are subjects for theorems. One: it expands, and without end. The other: in doing so the structural richness grows. Both have theorems, and this chapter presents them.

The gap is inhabited everywhere

Chapter 5 says what is reachable. It does not say that the unreachable is also inhabited at every stage — that there is anything there at all that is locally classical and yet not buildable. Now a theorem says it: for every value count from four upwards such an operation exists [68].

The witness is a rule and not a single case: act as maximum exactly on the lowest elementary contexture and as minimum everywhere else. The same prescription at every stage. That the lowest is chosen is a chosen and not a found basis — any other pair would give another witness, and the corpus says so on the spot.

The witness travels along

Now the step from one stage to the next. One embeds the smaller set of values order-faithfully into the larger — the values keep their sequence, and one is added.

On the embedded region the rule of the larger stage agrees with that of the smaller [69]. The witness is thus not lost and need not be chosen anew; it is the same one, seen from further up.

This is the formal version of what Günther's stepwise progression means by "every stage contains the previous one as a substructure" — here as a theorem and not as a programme. Beside it the arithmetic of growth: each step adds exactly m new elementary contextures when going from m to m+1 values [70], and the image of the old stage does not reach the new element [71]. What is added was not there before.

And yet the step does not carry the signature

Here comes the finding no one had reckoned with.

The embedding carries the order, it carries the lattice, it carries the witness. The reversal of order it never carries — at no place, for no value count [72]. The reason is elementary: the reversal reflects the values about the middle, and the middle shifts when a value is added.

One might hope a cleverer embedding heals this. The answer is a differential in the sense of chapter 4, and it comes out hard:

If the value count is odd, then not a single map into the next stage commutes with the reversal of order [73] — without any assumption of injectivity or monotonicity, over all maps whatsoever.

The argument is three lines long and therefore exhibitable. At an odd value count the reversal has a fixed point: the middle value, which is mapped to itself. A compatible map would have to send it to a fixed point of the next stage. The next stage has an even value count — and there the reversal has no fixed point. Hence there is no such map.

And the possibility half stands beside it: at an even value count there is indeed an order-faithful, reversal-compatible embedding — it leaves the gap exactly in the middle [74], [75] — and from four values upwards the witness ascends under it as well [76].

odd value count fixed point m = 5 no map, for none even value count no fixed point m = 6 m = 4 embedding, compatible gap at the middle place m = 6
Figure 11 — At an odd value count the reversal has a fixed point that the next stage does not have — hence not a single map commutes with it. At an even value count there is one, with an explicit witness.

The stage step therefore fails to carry the full local means precisely when the value count is odd. The lattice ascends step by step, the reversal only in jumps of two. Put otherwise: the exchange relation is stage-relative.

What this means is interpretation, and let it be said: the ascent has no form that would close it — the expansion is genuine because it cannot be caught up signature-faithfully. A theorem about the non-existence of a limit object this is not, and none is claimed. About double steps — from m to m+2 — the theorem says nothing, and that too stands so in the corpus.

What the step exchanges — and where it does not

So far it has been said what outlasts the step: the witness yes, the reversal no. It has not yet been said what is interchangeable with it — and that is the sharper question, because it holds the exchange and the ordering step against each other.

For this the chapter returns for a moment to the ground — stage here means length of the row, not number of values.

Take the simplest exchange movement there is on a row: swap two places and bring the result back into normal form. And take the simplest ordering step: strike the last place. Both are total, both are cheap. The question is: does the order of the two matter?

Mostly not. If the swap does not touch the last place, then it is the same whether one swaps first and then strikes or the other way round — the two operations commute (proved [77], for arbitrary rows and without any normal-form assumption).

At the last place it becomes interesting. There interchangeability no longer holds in general — but neither does it simply never hold. It holds exactly under a statable condition, and the condition is a statement about the repetition pattern: the swap changes nothing if the two values agree anyway, or if the place concerned stands alone in the remaining part and the value of the last place does not occur there at all. Otherwise it changes the result of the striking — proved [78], as a biconditional and for normal forms.

Thereby the last place is distinguished not by a naming but by its behaviour: it is the one whose exchange does not commute with the ordering step. That is read off. And that the breaking point lies exactly there is the yield and no incidental: the exchange disturbs the ascent at precisely the place that constitutes the ascent.

The information has a direction, and it belongs to it. What is measured is the exchange against the ordering step — the swapping of two places, measured against the striking of the last. The converse direction, measuring the order against the exchange, occurs in no theorem. What that means for Günther's interlocking stands in chapter 7; it is less than it sounds, and more than what stood there before.

No finite stock of values suffices

The second structural statement — infinitely expanding — is redeemed not by a limit object but by a negative theorem about every finite stock of values.

The fillability bridge of chapter 1 generalises: a pattern can be filled with k values if and only if all its signs lie below k [79], boundary cases included. The way is the same as in the two-valued case, only general: a sign at k or above forces k+1 pairwise distinct values.

Now consider an infinite sequence of patterns whose signs grow beyond every bound. It follows that for every k there is a place from which on the initial segment can no longer be filled with k values [80]. And such a stream exists — the simplest is the one in which every place brings a new sign [81].

That is "infinitely expanding" in its most honest formal shape: not as a claim about an infinite, but as a statement about every finite. The evolutive direction of chapter 1 — the one that chooses — provably exceeds every stock from which it could choose.

The interpretive step is stated expressly: kenogram is not contexture. That a k-fillable row is a "k-valued system" hangs on the bridge that supports it, and is labelled interpretation in the corpus.

The richness grows, the reachable does not

The third ingredient has already fallen in chapter 5 and belongs here: the space of possibilities grows strictly from stage to stage [66], the reachable remains at every stage the same two [62], [67]. That is the quantitative shape of "growing structural richness".

That this gradation is what Günther means is interpretation. What is proved are a correspondence, a cardinality, a set equality and two inequalities.

The concept, second stage

From these four results a concept can be formed that no longer speaks of one structure but of a family of structures. A family is called formally operationally polycontextural in ascent if

  1. every one of its members carries several overlapping contextures on which a locally classical but not buildable operation exists;
  2. the members are joined by embeddings under which this witness is preserved;
  3. the stock of locally classical operations grows strictly from member to member;
  4. at every member exactly the same two named operations remain reachable.

This is satisfied by the stage family of the ordered value sets from four values upwards. Each of the four clauses carries a theorem.

And what is expressly not claimed belongs to the concept and not in a footnote. Not claimed is a preservation of the full local means — the parity obstruction forbids it, which is why the second clause speaks of the witness and not of the signature. Not claimed is a limit object. Not claimed is the world picture.

Deliberately the concept has not been built as an object of its own in the library. A structure with four fields that no theorem requests would be a renaming of what is there — the same decision with which the project once already let a planned naming layer lapse.

What about the world picture

The totality — reality as a system of… — remains open, and is carried as open.

That is a result and not an arrears. A statement of totality is not a structural property; it says nothing about how something is built, but that everything is built so. What is structure in this determination now has theorems. The only formal path to totality would be a constitutive posit — one declares it a premise. That would not approximate the concept, it would posit it, and this path is not taken.

7 · Reach and limit

Where the bound bites

The characterisation of chapter 5 has a face of application, and it is narrower than the name polycontexturality suggests.

It bites where a linear scale of at least four levels is present and a policy is called for that decides classically on every pair of levels — with four levels on all six — but not everywhere alike. Release levels from blocked to privileged; source authority from note to statute; security levels; hierarchies of norms. In such cases the theorem says: a mixed policy is not assemblable from local, level-blind checkers — in whatever wiring and to whatever depth.

And it does not say that the policy is right. From non-assemblability follows no guarantee of security, legality, truth or completeness. What follows is a statement about architecture: at this place a mediating instance of its own must stand, and it cannot be compiled away.

Where the scale is missing, the claim falls. Several roles, several perspectives, several agents — that does not suffice. A transition graph of named roles without gradation is not carried by this bound; what remains provable there is reachability, and a type system achieves that too.

Two ways of falling out of the local means

Up to here one way has been in the foreground: mixture. A policy that decides classically on every pair of levels and is nevertheless not everywhere alike is not assemblable from the local means; its certificate is two pairs on which it acts in opposite ways [63].

The corpus carries a second, independent way: leaving a contexture. A set of values closed under the local means is never left by an assembled expression. If an operation leaves it at a nameable point, it is no such expression [86] — and the certificate names the set and the point.

An example one can check by hand. Over four levels exactly two two-element sets are closed under minimum, maximum and the reversal of order: {0,3} and {1,2} [87]. The rounded-down average of two levels — the familiar rule take the middle — maps 0 and 3 to 1 and thereby leaves {0,3} at the point (0,3) [88]. An auditor thus receives a cell and not a verdict: your rule leaves the contexture {0,3} at (0,3).

Three things that do not follow from this.

The narrowness stated above stands in full. It concerned the first way, and it holds unchanged; the second stands beside it and does not replace it.

The precondition of the scale is not loosened. The second way too computes over the linear scale of levels — its means are minimum, maximum and the reversal of order, and these presuppose the order. Whoever reads a wider reach out of the two ways reads it in: several roles, several perspectives, several agents — that does not suffice holds for both.

And the certificate is sufficient, not necessary. If no point is found at which a rule leaves a closed set, then nothing is shown by that, least of all that the rule were assemblable. There are operations that preserve both sets and are nevertheless not assemblable; for them this paper carries no certificate, and it says so rather than pass over a gap in silence.

The height of the fall, and that it can be stated

What happens if one removes the order? Take the smallest lattice in which three elements stand side by side as equals — a bottom element, three incomparable above it, a top. On it there is an operation that acts classically on every comparable pair and is globally neither the infimum nor the supremum. It is not merely calculated but exhibited as a term and proved [89]:

(x ∧ y) ∨ ((x ∨ y) ∧ (¬x ∧ ¬y))

A lattice version of the characterisation is thereby not open but refuted. That is more than "we have not proved it": exactly the pattern that the characterisation excludes on linear scales is assemblable here. The limit is no hole in the proof but a counterexample — and the breaking point is exactly the lattice shape an architecture of equal-ranking roles would have.

That the architecture can state its own height of fall is no admission but its strongest piece. It stands on order, not on plurality, and it can say by what one notices the difference.

And the theorem that supports the posit of chapter 2 belongs in the same context: on an incomparable pair even the minimum leaves the two-element set [49]. The same property that grounds the posit is the one whose absence makes the bound fall.

The four limits

First, mathematical. The characterisation lives on linearly graded carriers and falls on lattices of equal-ranking elements — refuted, as just shown, not unclarified.

Second, hermeneutic. That the two-element value set is Günther's elementary contexture is decided by no theorem. The posit stands on grounded and, since recently, theorem-supported soil — and remains a choice.

Third, in principle. Not the will as a function, but solely the that of enactment is no structural feature. There is no poorer model in which it is missing as a position, because it is not a position. Here the procedure declares its reach, as a statement about itself.

Fourth, at the subject matter: a coupling is not a ground. This limit is new and the heaviest of the four. The three previous ones concern the mathematics, the interpretation and the procedure; this one concerns the matter itself.

The construction shows a coupling of exchange and order, and in one direction: what is measured is the exchange against the ordering step — as a biconditional, on the ground, generically, over arbitrary pairs of places and without any normal-form assumption, with the stage-determining place as the breaking point. Günther claims more, and he claims it verbatim: the proemial relationship, he writes, "'pre-faces' the symmetrical exchange relation and the ordered relation and forms … their common basis"; it "provides a deeper foundation of logic as an abstract potential from which the classic relations of symmetrical exchange and proportioned order emerge."

Between the two there is no difference of degree. Whoever shows a coupling of two things has not shown that they stem from a third — and that would hold even if the coupling were mutual; here it is not even that. No strengthening of the first statement leads to the second. What is missing here is therefore not to be replaced by more of what has been built — and that distinguishes this limit from the other three, at each of which a further theorem would be conceivable.

That Günther's own footnote cites, for the same subject, Karl Heim's name for it — das Grundverhältnis, literally the ground relation — is no play on words of this paper but the very circumstance at issue here.

What is not built

The proemial relation. It is the pivot of Günther's late theory — and not his invention: he calls it implicit in Hegel's dialectic and points to a book by the theologian Karl Heim, Das Weltbild der Zukunft (1904), where it is called das Grundverhältnis. The name comes from the Greek prooimion, prelude.

In him it governs the connection of cognition and volition: a connection that "is in its inner core heterarchical and governed by the proemial relation" — precisely the figure whose impossibility in every ordering chapter 3 proves. What is denied in this is named by two writings, and they deny different things: Cognition and Volition denies that either of the two faculties firmly dominates the other (p. 33); Identität, Gegenidentität und Negativsprache denies a symmetrical exchange relation between them and sets number, not the proemial relation, as the medium for cognition and volition (IGN p. 53). And what it establishes, he writes, is "a heterarchical connection between Form and Matter and consequently between subject and object and therefore also between volition and cognition."

Two cautions belong to this, and they are unequal.

The first concerns the language, and it falls away here. Günther wrote this text in English; this edition quotes the original and is, at these places, the one closer to the source. The German edition quotes the translation and says so.

The second concerns the bridge to chapter 3, and it is to be divided. Documented is that the cyclic order of preference belongs, in Günther, to heterarchy and heterarchy to the proemial relation — in the same essay he builds a cyclic order of preference over three values, calls it heterarchical, and remarks that two values do not have enough structure for such a distinction. What remains interpretation is only that the three corners of 1937 are the same as the late faculties: there thought, will and time, here two faculties and a relation of rank, and a good three decades between them.

Read this way the arc of this paper closes: chapter 3 shows the phenomenon, this chapter surveys Günther's answer to it — and says how far it carries formally.

It is not built as a whole. What is built is more than a section and less than the matter.

The stage movement carries a section property and an asymmetry of fibres and does not collapse into an invertibility: the descent is canonical, the ascent a choice [90] — and that it is one stands as a theorem and not as a remark, because two admissible ascents demonstrably come apart [91].

The chiasm of exchange and order — Günther's interlocking, and the word is his: the proemial relation, he writes, "represents a peculiar interlocking of exchange and order" — the German translation renders it Ineinandergreifen, which is why the German edition must fix a word of its own and this one need not. What is meant is the coupling of the two fundamental relations. It is one-sidedly touched and not redeemed.

Touched, and the direction belongs to the information: what is measured is the exchange against the ordering step — the swapping of two places, measured against the striking of the last. If it does not touch the stage-determining place, the two operations commute smoothly; if it does, the ordering step stays the same exactly under a statable condition. That the breaking point is precisely the stage-determining place is the yield and no incidental. And the converse direction is missing: no theorem measures the order against the exchange.

Not redeemed: the simultaneous reversal of the order of rank. Günther says it himself and expressly: the switch involves "not two relata but four! Not only two subjective faculties, called cognition and volition, are exchanged, but the order of subject and object also suffers a reversal." What is missing is therefore precisely the representable exchange of cognition and volition itself.

A second openness, at the same place and different in kind. The missing converse direction concerns the coupling of the two fundamental relations. This one concerns their occupancy: which of the two relations a value occupancy of two kenograms carries.

The separation theorem. Since 9 August the construction carries, at this place, a classification theorem, and it says more than the open place requires: every pair of criteria that divides the different-valued occupancies of two places exclusively and exhaustively, and stays stable under order embeddings of the carrier, is the order pair — in one of its two namings and in no third form; proved [92]. Whoever wants to separate the two occupancies thereby has no choice but to rename the order relation.

The theorem and the three statements from which it draws its separating power manage without the axiom of choice. The normal form carries it; within the module no theorem carries the axiom of choice that does not name it — measured on the axiom profile of every theorem of the module, with the gate run green.

And from this follows what the chapter needs. The theorem leaves open which of the two occupancies carries the symmetrical exchange relation and which the order: its conclusion is a disjunction of two namings that it does not resolve, and both branches are of equal right. It therefore does not close the place — it proves that the place cannot be closed within this frame, and thereby confirms precisely the openness this paragraph started from.

Its reach it carries itself, and the reach belongs to the statement: two places, and as structure on the stock of values nothing beyond a linear order. More places and more structure stay expressly outside. The theorem does not say that there is no substantial value criterion — it says that within this frame there is none. Whether the bound is one of the matter or one of the frame, it does not decide.

What this has to do with Günther stands beside it and not in it. That the two places are his two kenograms with their value occupancy, and the two cases the symmetrical exchange relation and the order, are assignments from a single passage, and the words are his own: "the two empty squares represent kenograms which can either be filled in such a way that the value occupancy represents a symmetrical exchange relation or in a way that the relation assumes the character of an order" (assignment; Cognition and Volition, p. 22).

That this occupancy stays open in him, and not merely unmentioned, no passage says alone. At the figure itself he gives the disjunction and no rule; on p. 13, however, he sets up the rule by which the silence can be read as intention — he distinguishes "the mere structure of a symmetrical exchange relation and its two aspects of possible value-occupancy", and a value occupancy is not meant "unless we say so expressly" (synopsis; pp. 22 and 13 — neither passage says it alone; the evidence for p. 13 has been checked once. This note appears only where a piece of evidence has been checked once; its absence elsewhere means nothing.). Where he names none, by his own rule none is meant.

Not open, by contrast, is what he assigns himself elsewhere: "Equivalence, of course, is a symmetrical exchange and implication an ordered relation" (checked against the source; p. 32). What is open is the occupancy of the two kenograms, not the assignment of the two actualisations.

The role exchange itself is not built. In its place stands a differential: over every carrier whose stock of values carries a fixed-point-free exchange — hence over Günther's own table of negation — the relations cannot be named by their members [96]; and one order up a morphism becomes an object [97]. The exchange enforces the order; the order does not perform the exchange.

The generalisation holds for transpositions — the commutation theorem holds over arbitrary pairs of places and even over arbitrary rows, without any normal-form assumption [77]. For arbitrary permutations nothing stands.

And both strands of the construction instantiate the same form of proof — retraction without invertibility —; there is now a proof term that reaches both [98].

That Günther locates the proemial relation itself at the level of the kenogrammatic structures — as pure possibility that becomes actual only as the exchange or as the ordering relation, written with two kenograms — is the reason why the load-bearing theorems lie there and nowhere else (checked against the source).

The compound contexture is half built, and the halves can be named. The joining stands as structure: several elementary contextures exactly from three values on [46], their connectedness through overlap or a third [47], their coming apart exactly from four on [48]; and its exponent is a theorem [65]. The mediation does not stand: Günther binds it to the second negation, and no theorem of this paper carries that.

A limit object of the ascent is neither built nor claimed nor excluded. These three negations have three different reaches, and they are not the same.

And the two paragraphs likewise say different things. The first says what is missing and why it is missing; the second says that nothing has been said. A gap with a reason is worth more than a gap without — which is why halving the first negation is a yield and not a retreat. Up to the fifth edition the gap was called the compound contexture is not built; it is now called the joining is built, the mediation is not, and the second negation is the reason.

To the counting of compound contextures belongs a note that lies in the matter itself: the source gives a formula and a series beginning at one, and says at the same time that a compound contexture requires at least three values. The two do not agree — the first compound contexture is the three-valued one, the one belongs to the series of ontologies. The architecture counts the elementary contextures of an m-valued situation as pairs from m values; this is compatible with Günther's series, but it is a stipulation and not a derivation.

The picture

A ground that counts repetition, whose normal form is built as a procedure and whose value-filling has two proved bridges. Logics whose separation is not posited but proved — in a form that withstands Günther's own basic case, because it does not deny the map but the path to it from within. A mode of proof that knows its hard half and delivers it. A measure of separation that has turned from an existence claim into a characterisation, and from computed numbers into theorems. An ascent that is everywhere inhabited, takes itself along, grows strictly — and provably has no form that would close it. A layer of application that says where it bites. And four limits — three of them statements of place at which a further theorem would be conceivable, and one that says what this construction is not.

What is posited stands at the beginning; what is proved is counted; what is interpretation is called so.

Part B resolves the numerals: for each one the theorem, its axiom profile and its range of validity. There also stand the counting routes, the checking apparatus, and the list of errors this project has found in itself.

The sources of the passages adduced stand as a register at the beginning of Part B; there it also says by what their pages are counted.

This is the English edition of the German Part A. The two editions are the same document in two languages, and their agreement — figures, numerals and marks at the same places — is checked at generation and not asserted here. Where they would diverge, the German edition governs — the rule concerns the language and not the correctness: where one edition is measurably wrong it is corrected, not privileged. And one further exception lies in the nature of the case: the passages from "Cognition and Volition" are quoted here from Günther's own English and in the German edition from the German translation. For those sentences this edition is the closer one to the source.

The Mathematical Shape of the Architecture — Part B: The Apparatus

About this part

Part A sets out the shape. Part B supplies what it is to be checked against: for every numeral the carrier, its axiom profile, its range of validity; the mode of proof in full; the register of concepts; the safeguards with their figures; the instruments and the errors this project has found in itself; and the routes by which every number can be recomputed.

This paper carries no figures of the checking apparatus. They stand in exactly one place, the generated table docs/kennzahlen.md of the repository, each with its route and a state anchor; equations between them run along at generation, and if one falls the table as a whole is void. Where this paper would need such a number, it points there and does not copy it out.

The reason is measured, not precautionary. Up to the fourth edition every one of these numbers stood twice — once in the corpus, once in the paper — and the second aged unnoticed: one group count stood verbatim the same across three editions while reality overtook it twice, and two number-words about the paper's own checking apparatus were not old but false. A number that stands in two places has one place too many.

What remains are the numbers a theorem carries: they stand in the carrier table, beside the theorem that proves them. The difference is the whole point — a proved number does not age.

Marks. The drafts carry a bracket sign for whatever still has to be settled before generation. In this edition there is none — and the sentence that claimed as much was false in the fifth edition: the draft carried such a mark, and the generation route removed it silently. The paragraph meant to explain the sign thereby lost its own example and stood, in both language versions, without a grammatical subject. The case is in the list of errors (§5); the route now breaks instead of deleting, and this paragraph no longer shows the sign but names it.

Names and profiles of the carrier table are measured (§1); figures of measurement are referred to (above); and the one entry that allowed neither — which share of the corpus carries the shape — now names the kind instead of a number (§4.6).

The numerals of the carrier table are edition-internal. They are assigned afresh in each edition — like footnote numbers — and are cited nowhere outside edition and draft. A guard in the corpus checks this; its baseline is zero. Whoever cites a numeral outside binds himself to an edition and not to a theorem — the theorem stands in the table, and there its name stands.

The range of validity is measured on the import closures and not on the directory:

The difference is not tidiness: proved means something else inside the aggregate than outside, because a machine barrier bites there.

On the sources. Part A quotes Cognition and Volition — in the English edition from Günther's own English, in the German edition from the German translation. The file, its checksum and the page of every passage quoted are filed in the corpus; at those places the English edition is the one closer to the source, and both editions say so. This is the one point at which the standing rule in case of conflict the German edition governs does not apply.

The sources of the passages adduced, as a register and ordered by year. Every page number of the paper counts by the file used; where the print counts differently, the entry says so. The series title given in the files used varies: twice "zur Grundlegung" is missing, once "Logik" stands for "Dialektik"; the series title is set.

The conceptual determinations follow the project's definitions edition, an unpublished working edition of the sources named.

1 · The carrier table

For every numeral from Part A the theorem that carries it.

The profile column is measured, not typed. A probe of the repository reads this table, resolves every name given against the corpus, measures its axiom profile and holds the result against the column; it reports every deviation and every name it cannot resolve uniquely. At the state of this edition: 105 rows confirmed, no deviation, no unresolved name. Four rows carry a reference to §1.7 instead of a profile — the reason stands there, and a prose entry is no machine-readable claim.

What the probe does not check: whether the theorem named is the right one for the claim. That remains the business of whoever sets the numeral.

1.0 The new chapters (Part A, before chapter 1)

Numeral Carrier Range Profile
[1] RecurringGround.ground_recurs — the fixed point recurs at every stage aggregate axiomfrei
[2] ReversibleExchange.reversible_pointwise_periodic — place 2: a reversible exchange is pointwise periodic aggregate axiomfrei
[3] IrreversibleAdvance.noreturn_not_periodic — place 3: without return no pointwise periodicity (nonempty carrier) aggregate axiomfrei
[4] ComplementaryMediation.mediates_not_reversible — place 4: a mediation is not reversible aggregate axiomfrei
— ComplementaryMediation.mediates_not_noreturn — place 4, counterpart: a mediation is not return-free aggregate axiomfrei
[5] ContentReflexivity.reflect_reversible — place 5: the exchange lifts to the carrier of reflection aggregate [propext, Quot.sound]
[6] MediationProcess.reflect_mediates_of_noreturn — place 6: on the lifted carrier, freedom from return becomes mediation (nonempty carrier) aggregate [propext, Quot.sound]
[7] SelfDetermination.solitude_ground — place 7: {∅} is a ground of the twice-lifted map aggregate [propext, Quot.sound]
[8] ExhaustionTransition.fixpoint_reached_of_strict_descent — place 8: if a rank falls at every step that moves, a fixed point is reached aggregate [propext, Classical.choice, Quot.sound]
[9] ContentReflexivity.reflect_not_noreturn — freedom from return does not lift along: no lifted map is return-free aggregate [propext, Quot.sound]
[10] RecurringGround.exhausts_ground — what exhaustion reaches is ground — reads .1 of Exhausts aggregate axiomfrei
[11] ExhaustionTransition.decomp_never_exhausts — the course of the value-number decomposition never falls under Exhausts — also reads .1 aggregate [propext, Quot.sound] · axiomfrei
[12] ExhaustionTransition.dstep_no_fixpoint — the step across the intervals has no fixed point aggregate [propext, Quot.sound]
[13] ExhaustionTransition.dstep_decomp — the decomposition of every value number into interval start and remainder, read as a step aggregate axiomfrei
[14] NegationCycleLength.genesen_kuerzeste — N₁N₂N₁ and N₂N₁N₂ are exactly the shortest paths to the reversal 3 2 1 aggregate [propext, Quot.sound]
[15] NegatorContexture.isElemContexture_E — the neighbouring pair {i, i+1} is an elementary contexture aggregate [propext, Quot.sound]
[16] NegatorContexture.isElemContexture_Em — the mediated pair {i, i+2} is an elementary contexture aggregate [propext, Quot.sound]
[17] NegatorContexture.mediated_elem — the mediated exchange swaps exactly the pair {i, i+2} aggregate [propext, Quot.sound]
[18] NegatorContexture.overlap_iff — two negator pairs share a value exactly for neighbouring negators aggregate [propext, Quot.sound]
[19] NegatorContexture.disjoint_iff_comm — the pairs are disjoint exactly when the negators commute aggregate [propext, Quot.sound]
[20] NegatorContexture.overlap_iff_three — the pairs overlap exactly when the two negators produce the cycle relation aggregate [propext, Quot.sound]
[21] CompoundContexture.verbund_eq_pairs_iff — Günther's number of elementary contextures equals that of all value pairs exactly at three values aggregate [propext, Quot.sound]
[22] NegationCycleSJT.sjt_full — a full cycle for every number of values, after Steinhaus, Johnson and Trotter aggregate [propext, Quot.sound]
[23] NegationCycleSJT.sjt2_eq — for three values Günther's sequence (5) aggregate [propext]
[24] NegationCycleSJT.sjt3_mirror_kreis2 — for four values Günther's emended second cycle, mirrored aggregate [propext]
[25] NegationCycle.kreis2Gedruckt_not_closed — the printed second cycle does not return to the start aggregate [propext]
[26] NegationCycle.kreis2_emendation — exactly one completion by two steps closes it aggregate [propext]
[27] NegationCycle.janus1974_rotate — the 1974 print is the emended cycle, shifted by one step aggregate [propext]
[28] NegationCycleSearch.exactly_fortyfour — exactly 44 full cycles for four values, 88 sequences from a fixed start aggregate [propext, Quot.sound]
[29] NegationCycleSymmetry.no_888_all — in no full cycle do the three negators occur equally often aggregate [propext, Quot.sound]
[30] NegationCycleThreeCycle.verteilungen_vollstaendig_all — Günther's family theorem: every full cycle belongs to one of the three families aggregate [propext, Quot.sound]
[31] NegationCycle.triadic_unique — for three values only one full cycle, in two directions aggregate [propext]
[32] NegationCycle.transklassisch_card — n! − 2 arrangements outside the classical two aggregate [propext, Classical.choice, Quot.sound]

On [14] — the reading of IGN p. 19. For the forward path of the first permutation group the print has "N 1·2·3"; with three values there is no third negator. Two witnesses carry the reading "N 1·2·1". The first is the page itself: three lines later, in the same paragraph, it prints "N 1·2·1" for the return path of the second group, and its table is symmetrical — the return path of one group takes the negators of the forward path of the other. The second is the corpus: the two shortest paths into the reversal are N₁N₂N₁ and N₂N₁N₂ (genesen_kuerzeste), and only the first begins with N₁. The corrected form is quoted (source-verified, IGN p. 19, on the page image).

On [22] — the range of the finding on "every value number". Four phrases around every value number and all value numbers were searched in twelve of Günther's writings: Wahrheit, Wirklichkeit und Zeit; Cybernetic Ontology; the Lille paper; Die historische Kategorie des Neuen; Die Theorie der "mehrwertigen" Logik; Cognition and Volition and Erkennen und Wollen; Das Janusgesicht der Dialektik; Als Wille verhält der Geist sich praktisch; IGN; Martin Heidegger und die Weltgeschichte des Nichts; Die Metamorphose der Zahl. The phrases occur twice, and both times Günther posits: the negation system as the totality of all permutations (tml p. 10) and the condition that every value number exchanges directly only with its neighbours (Die Metamorphose der Zahl, p. 7). Full cycles he shows for three and for four values. About sentences that say the same without these phrases, and about other writings, the finding says nothing.

1.1 The ground (Part A, chapter 1)

Numeral Carrier Range Profile
[33] K.rgs_unique_of_pattern aggregate [propext, Quot.sound]
[34] KM.samePattern_iff_pattern aggregate [propext, Classical.choice, Quot.sound]
[35] KM.samePattern_iff_common_nf aggregate [propext, Classical.choice, Quot.sound]
[36] KPC.card_rgs_eq_card_finpartition — as many rows in normal form of a given length as set partitions of as many places; the theorem does not name the Bell number aggregate [propext, Classical.choice, Quot.sound]
[37] K.relabel_take — the normal form of an initial segment is the initial segment of the normal form aggregate [propext, Quot.sound] — choice-free
[38] KF.marksLeOne_iff_fillable aggregate [propext, Classical.choice, Quot.sound]
[39] KF.card_rgs_four — fifteen patterns of length four aggregate [propext, Classical.choice, Quot.sound]
[40] KF.card_rgs_four_fillable — eight of them two-valued fillable; with KF.fillable_card_lt_card as a strict inequality aggregate [propext, Classical.choice, Quot.sound]
[41] KFib.fiberEquiv — over every fillable pattern exactly two truth tables, as a correspondence to the two truth values; which one is at hand is decided by the first place aggregate [propext, Classical.choice, Quot.sound]
[42] KFib.card_bool_fun_eq_two_mul — 16 = 2 · 8 between two figures of the corpus aggregate [propext, Classical.choice, Quot.sound]
[43] KFib.witness_over_three — 0 1 2 3 requires four values and not three; beside it KFib.witness_over_two for 0 1 2 0 and the steps two and three aggregate axiom-free
[44] RelInv.relabel_map_of_injective — canonicalisation is invariant under every injective renaming of the values, heterogeneously over arbitrary carriers; the instance at the reversal of order is RelInv.relabel_map_negFin aggregate [propext, Classical.choice, Quot.sound]
— K.relabel — the canonisation as a procedure, not as a claim (definition) aggregate axiom-free
— K.relabelStep_foldl_append — the fold state grows only at the end; carries [37] aggregate [propext]
— K.relabel_dropLast, K.isRGS_take, K.isRGS_dropLast' — corollaries aggregate [propext, Quot.sound], resp. with Classical.choice

On [37] — the side belongs to the statement. The lemma holds for initial segments. For final segments the corresponding statement is false: the normal form of [0,1] without its first place is [0], the final segment of the normal form is [1]. A formulation saying "compatible with cutting" without naming the side would be half false — and the corpus says so on the spot.

The corpus carried the statement so far only for streams; the finite version was missing. It is choice-free and useful in its own right: K.isRGS_take follows from it in three lines instead of rebuilding a probe's lemma.

On [34] and [35]. The two characterisations are not interchangeable: [35] hangs on a concrete carrier type, [34] is type-transverse. The corpus notes this on the spot.

On [39] and [40]. The number fifteen is the fourth Bell number. It is proved in the corpus and not taken from the literature — that is more expensive, and it is the reason why the statement about the excess (15 against 8) stands without foreign authority.

1.2 The contextures (chapter 2)

Numeral Carrier Range Profile
[45] CO.three_contextures_overlap — the pairwise overlap as a counting statement aggregate [propext]
[46] CC.two_elem_contextures_iff — two distinct elementary contextures exactly from three values on aggregate [propext, Classical.choice, Quot.sound]
[47] CC.overlap_or_third_touches — any two distinct ones overlap, or a third touches both aggregate [propext, Classical.choice, Quot.sound]
[48] CC.disjoint_elem_contextures_iff — two without a common value exactly from four values on aggregate [propext, Classical.choice, Quot.sound]
[49] meet_leaves_incomparable — on an incomparable pair the infimum leaves the two-element set aggregate [propext]

On [45] — the upgrade of the fourth edition. The file header of the carrier expressly labels the overlap a cardinality theorem and not an interpretation. The third edition carried it, at both places where it occurs, as a construction prohibition and as a grounded choice respectively — the theorem did not appear in it. That is a loss of a mark in a positive statement, found while ordering the corpus by subject matter.

1.3 Time (chapter 3)

Numeral Carrier Range Profile
[50] Proemial.IntransitivityDifferential.no_cycle_in_strict_order aggregate axiom-free
[51] cyc3_not_representable aggregate [propext]
[52] TimeMeasure.no_common_measure_inverse — two times that invert each other have no common measure aggregate [propext, Quot.sound]
[53] Proemial.NoUniformSwap.no_uniform_swap aggregate [propext, Classical.choice, Quot.sound]
— cyc3_holds, cyc3_irrefl, cyc3_not_transitive — the witness itself aggregate [propext]

The full name with its module is no pedantry at [53]. A theorem of the same name lies in a call target, unguarded, as a historical record. Whoever names the name without the module leaves open which one he means — and the range of validity this part carries then runs empty. The choice component at [53] stems from the category machinery used and not from the proof itself; the path of the axiom into the term is not measured, and the corpus says so there.

1.4 The measure of the separation (chapter 5)

Numeral Carrier Range Profile
[54] CV.card_locallyClassical at two values (2^1 = 2), together with CV.min_ne_max; the sharpness of the bound from CV.two_lt_card_locallyClassical aggregate Classical.choice (see 1.7)
[55] NUCB.four_of_eight_generatable and NUCB.locally_classical_dichotomy — the complete classification over three values: the choice-vector version and the ops version without choice-vector coding aggregate [propext, Quot.sound]
[56] TCB.T_not_in_clone; with TCB.T_rejective and the departure from the contexture aggregate [propext, Quot.sound] · [propext]
[57] TournamentSplitThree.cyclic_iff — a tournament on three values is non-transitive exactly for KKD and DDK aggregate [propext, Quot.sound]
[58] LocalOpOrbits.tafel_cyclic_pair — Günther's two sequences of 1962 are exactly the two non-transitive operations aggregate [propext]
[59] LocalOpOrbits.cyclic_letter_swap — flipping all letters preserves the cyclic pair aggregate axiomfrei
[60] LocalOpOrbits.cyclic_not_swap23 — swapping the second and third place leads out of the pair aggregate axiomfrei
[61] QCB.locally_classical_in_clone_iff4 — the characterisation at four values aggregate [propext, Quot.sound]
[62] GCB.locally_classical_in_clone_iff — for all m ≥ 4 aggregate [propext, Quot.sound]
[63] PM.not_in_clone_pair_mixture — not constructible means: acts on two distinct pairs as maximum and as minimum; the general form is PM.pair_mixture_of_ne_min_ne_max aggregate [propext, Classical.choice, Quot.sound]
[64] PM.w_differs_on_disjoint — the witness achieves it on two elementary contextures with no common value aggregate [propext, Classical.choice, Quot.sound]
[65] CV.locallyClassicalEquiv and CV.card_locallyClassical aggregate see 1.7
[66] CV.card_locallyClassical_lt aggregate see 1.7
[67] CV.two_lt_card_locallyClassical aggregate see 1.7
— NUCB.W_not_in_clone — the witness of non-uniformity aggregate [propext, Quot.sound]
— GCB.constant_clone_min_or_max — the version with constant checkers aggregate [propext, Quot.sound]

On [62] — the consumption, measured. Seven declarations of the aggregate reference it in their proof term; none rebuilds it. Both are measured: the consumption at the proof term, the non-rebuilding by must-not routes. The number holds at the anchor of this edition and is measured afresh for each one — in the fifth it was six, in the sixth and the seventh seven, and in this one it is seven still.

A ranking claim of the fifth edition fell back then. There it read that [62] was the most consumed theorem of the corpus. Measured at the anchor of the sixth edition that was not so: four auxiliary lemmas lay above it, the highest at ten.

And the sentence that took its place fell itself in the seventh edition. The sixth edition wrote: among the carriers of its table [62] is the most consumed, seven against six for the next. At the anchor of the seventh edition three carriers stood at seven — [33], [62] and [94] — and none above. The rank had become a tie, and what remained was the list.

The difference from the first case is the instructive one. Then the range of the claim was too wide; the second time the claim was correct at its anchor and the corpus had moved — [94] had arrived only with the seventh edition, and [33] had gained a consumer. A ranking claim about a moving corpus is therefore true, even with a route, only as long as its anchor.

And the list has moved again. At the anchor of this edition [33] stands at nine, [62] and [94] stand at seven. No rank is written from it: the previous paragraph says why.

1.5 The ascent (chapter 6)

Numeral Carrier Range Profile
[68] SAsc.exists_locally_classical_not_in_clone aggregate [propext, Quot.sound]
[69] SAsc.w_castSucc aggregate [propext]
[70] SAsc.choose_two_succ aggregate [propext]
[71] SAsc.ascent_proper aggregate axiom-free (measured at c15a27f)
[72] SPar.castSucc_negFin_ne aggregate [propext, Quot.sound]
[73] SPar.odd_no_neg_compatible aggregate [propext, Quot.sound]
[74] SPar.eSym_strictMono aggregate [propext, Quot.sound]
[75] SPar.eSym_negFin aggregate [propext, Quot.sound]
[76] SPar.w_eSym aggregate [propext, Quot.sound]
[77] K.dropLast_exchangeAt — commutation when the swap does not touch the last place aggregate [propext, Quot.sound] — choice-free, without IsRGS
[78] K.dropLast_exchangeAt_last_iff — characterisation at the last place, under IsRGS; with a statement pin aggregate [propext, Classical.choice, Quot.sound]
[79] KU.marksLt_iff_fillable aggregate [propext, Classical.choice, Quot.sound]
[80] KU.unbounded_not_fillable aggregate [propext, Classical.choice, Quot.sound]
[81] KU.idRGSStream_not_fillable aggregate [propext, Classical.choice, Quot.sound]
— K.swapPlaces, K.exchangeAt, K.preservesPrefixPattern — the carrying concepts aggregate [propext]
— K.count_eq_one_iff_unique, K.set_pattern_iff, K.relabel_eq_iff_pattern — the pattern core aggregate [propext, Classical.choice, Quot.sound]
[82] K.JointlyClosed — closure of a set of rows under the exchange of places within the row and under the descent aggregate [propext]
[83] K.hull_le_of_jointlyClosed — every such set containing a row of length ≥ 2 contains {[],[0],[0,0]} or {[],[0],[0,1]} entirely; both are themselves closed (K.jointlyClosed_hull_pair) aggregate [propext, Classical.choice, Quot.sound] · [propext, Quot.sound]
[84] KOS.canonicalize_eq_of_ne — over two places any two occupancies with distinct values have the same normal form; the exchange of places is invisible to it (KOS.canonicalize_comp_swap) aggregate [propext, Classical.choice, Quot.sound]
[85] KOS.RisingOccupancy — the value occupancy of two places, rising along the places; counterpart KOS.FallingOccupancy aggregate [propext]
[92] KOS.separation_is_the_order — every pair of criteria stable under order embeddings that divides the distinct-valued occupancies exclusively and completely is the order pair aggregate [propext, Quot.sound]
[93] KPS.no_injective_pair_three — no map of the ordered pairs of one stage into the next is injective (25 > 15); one stage higher likewise (KPS.no_injective_pair_four), below there is one (KPS.exists_injective_pair_two) aggregate [propext, Classical.choice, Quot.sound]
[94] K.concatWith — concatenation of two rows under an identification, an injective renaming of the symbols of the rear row aggregate axiomfrei
[95] K.concatWith_pair_not_injective — the decomposition is not recoverable from the concatenated row; the descent acts on the rear part (K.concatWith_dropLast) aggregate [propext] · [propext, Quot.sound]

On [77] and [78] — three things the corpus says expressly.

First: commutation and not invariance. The probe says, at its witness, that the descent stays the same; that holds there only because the swapped initial segment happens to carry the same pattern. Whoever generalises the probe's theorem writes down a false theorem — and it would look enough like the probe to pass.

Second: the premises are unequal. [77] holds for arbitrary rows, without any normal-form assumption — the RGS hypothesis did not occur in the proof, so it does not stand there. [78] has IsRGS as a hypothesis. The contrast implies this; implying is not saying, and that is why both parts name it.

Third: the pin. [78] is a characterisation; a weakening of the right-hand side — dropping one of the two conjuncts, say — would pass an axiom guard, because a guard checks the profile and not the statement. The pin freezes the statement.

And the classical principle distributes tellingly: the two pure list theorems — the prefix lemma [37] and the commutation [77] — are choice-free. Classical.choice appears only where the work goes through the normal-form property or through counting. The commutation rule costs no classical principle; the characterisation does.

On the witness at [68]. The choice of the lowest elementary contexture as the max-island is a chosen basis, not a found one; any other pair would give another witness. The file header says so, and Part A says so too.

On [73]. The proof runs via the fixed point of the order reversal and needs neither injectivity nor monotonicity. About double steps — from m to m+2 — it says nothing; that too stands in the corpus.

On [79] to [81]. With [81] the identity stream is for the first time a named object of the corpus; the anonymous illustration that stood elsewhere before was not consumable and still stands there.

1.6 Reach (chapter 7)

Numeral Carrier Range Profile
[86] CEB.not_in_clone_of_escapes — if an operation leaves a set closed under the basis at a nameable point, it is no term over the basis; general over every signature, structure and substructure aggregate [propext]
[87] CEB.contexture03 — the boundary contexture {0,3} as a substructure at four levels; counterpart CEB.contexture12 aggregate [propext, Quot.sound]
[88] CEB.avgDown_not_in_clone — the rounded-down average CEB.avgDown leaves {0,3} at the point (0,3) (CEB.avgDown_escapes) and therefore does not lie in the clone aggregate [propext, Quot.sound]
[89] M3CloneWitness.m3_mixed_term_exists aggregate choice-free
[90] K.descent_split_epi_not_iso — the retraction equation for every admissible ascent; the non-injectivity at one witness aggregate [propext, Quot.sound]
[91] RB.kenoAscents_differ — two admissible ascents come apart aggregate [propext, Quot.sound]
[96] AA.no_naming_of_fixpointfree — where the stock of values carries a fixed-point-free exchange, there is no naming of the relations by their members aggregate axiom-free
[97] AA.arrow_left_id and AA.arrow_left_not_injective — the section and the forgetting, one order up aggregate [propext, Quot.sound]
[98] RB.both_strands_retract — both strands satisfy the same statement form; the form itself RB.RetractionWithoutIso aggregate [propext, Quot.sound]; the form axiom-free

On [96] — axiom-free and universally quantified. It is quantified over all carriers and draws no axiom.

Which carriers are axiom-free: the list, not the rank. Measured across all 100 numerals of this table, state c15a27f, fourteen theorems are axiom-free — [1], [2], [3], the two theorems at [4], [10], [13], the two at [43], [50], [59], [60], [71] and [96] — together with five axiom-free definitions: Exhausts at [10] and [11], K.relabel, IsRGS at [78], K.concatWith [94] and the statement form at [98]. The definitions claim nothing and therefore stand beside the row and not in it. The eighth edition named a measurement across forty numerals here while its table carried sixty; the list is therefore measured anew and not carried forward. The list says no more than that. It enumerates what was measured at the state named; it claims no exclusiveness. Whether a further carrier turns out axiom-free is a question for the corpus and for a measurement, not for this paragraph. The contrast within the differential carries even without a rank: the poor half costs no classical principle, the rich half [97] does.

The hypothesis is not arbitrarily chosen: Günther's table of negation is a fixed-point-free exchange — proved at the two-valued swap. The converse does not hold, and the theorem does not need it: it speaks about all such exchanges and therefore covers the table of negation too. In the form of a theorem it says: the exchange enforces the order.

On [97] — why two theorems and not one. Section and non-injectivity stand apart so that [98] can take them up verbatim. The composite statement — retraction without invertibility — is exactly what [98] claims, and for both strands; anticipating it here would have left [98] nothing but a renaming.

On [98] — why the statement form is not a renaming. It requires, on the kenogrammatic side, a construction that would not exist without it: a total section. The available ascent is partial — it takes a place and two proof arguments. It is not the theorems that are cut differently, but the ascents: one is total, one partial — and that the ascent chooses is the reason it has arguments. That is precisely the condition under which a statement form is more than a notation.

On [89] — the second upgrade of the fourth edition. The third edition wrote that a lattice version of the characterisation "does not exist". The corpus carries more: the term is exhibited and proved, so a lattice version is not open but refuted. The carrier is built on an inductive type of its own, to exclude any ambiguity of instances.

The clone counts of the flat lattice — 166 clone members, of which ten are locally classical, of which eight are neither infimum nor supremum — are computed, outside the corpus, and carry no claim.

1.7 A dividing line with a criterion

In the counting layer [54], [65], [66], [67] Classical.choice sits in the finiteness machinery itself — the instance and the cardinality of the base set already carry it; the transition constant between the layers stays free. Hence the dividing line that stands in the file header:

Every statement in this file that names a cardinality carries Classical.choice; none that does not, does.

That is a limit with a criterion instead of an enumeration — and it is measured, not inferred (see §4.3).

1.8 The layer of application

Two applications: a release policy over four authorisation levels, a source authority over four evidence levels. Both aggregate. The load-bearing claim is the measured consumption:

Theorem referenced in the proof term
PolicyCheck.freigabe_nicht_erzeugbar GCB.locally_classical_in_clone_iff yes
RAGAuthority.autoritaet_nicht_erzeugbar GCB.locally_classical_in_clone_iff yes
PolicyCheck.freigabe_nicht_erzeugbar_konstanten GCB.constant_clone_min_or_max yes
RAGAuthority.autoritaet_nicht_erzeugbar_konstanten GCB.constant_clone_min_or_max yes
PolicyCheck.freigabe_lokal (control) the same target no
RAGAuthority.autoritaet_lokal (control) the same target no

The control is the point. A route that reports yes everywhere measures nothing. This one discriminates, and it does so at the nearest non-hit — the prerequisite lemmas of the same files — and not at some arbitrarily distant counterpart.

1.9 The limit (Part C)

Numeral Carrier Range Profile
[99] K.descent_not_injective — the kenogrammatic descent is not injective aggregate [propext, Quot.sound]
[100] ReflexionsrestProbe.realize_not_injective — two different terms with the same denotation: the intensional substructure of the fourth open way built along, outside the aggregate [propext, Quot.sound]

Part C also cites AA.arrow_left_not_injective, with its numeral from §1.6.

The carrier attempts for §20 (on Part C, C.1). Compiled from the mathematician's note of 26 September; what is counted is the note's entries, not commits.

Phase Period Entries Outcome
A until 9 August 2 repurposed or recognised as a location, not a carrier
B 10 to 13 August 12 failed; one carried the claim of that time and later fell at the classical figure
C 14 August to 17 September 5 the claim or the criterion fell; two fell at the classical figure
D 17 to 20 September 12 failed except for one built bridge, which is not a carrier; three never tested
E time axis 2 not built or dropped
F 25 September 3 two failed; the third entry is the check itself

One carrier appears in two phases (A and B); the entries describe 35 distinct objects.

The reasons fall into kinds: level or exchange, never both; the connected is moved, the connecting not; notation instead of theorem; the number is forced by the carrier; the classical figure; the claim fell, not the carrier; the source does not carry it. The first two are the same thing from two sides, and the first is the largest.

Four ways are open: three that were never tested (the "freedoms" a @_i b, Fix/Stab, the insertion a ∘_i b), and an intensional one. Only this one has a built substructure: two different terms have the same denotation (realize_not_injective) (proved [100]). Whether it passes the prefilter is unmeasured; whether the prefilter admits it at all is open.

2 · The mode of proof, in full

Part A presents the differential in its short form. Here stands what is obligatory about it.

2.1 The three marks

First: the poor model is built internally. A statement about "all orderings" or "everything buildable from the local means" must have its object inside the system. Claims in the metalanguage do not count, because they cannot be checked.

Second: the result is conditional. It stands relative to the posited premises — above all to the one from Part A, chapter 2. It does not compel the sceptic, it symmetrises him: from this can be reduced comes I posit the one encompassing logic, and that is itself a posit without precedence.

Third: what is proved is the form, never the naming. The file that carries the witness of non-uniformity is named after the formal property and not after the philosophical reading. This is no modesty but a precaution: a name that claims more than its theorem will be taken for the theorem at the next reading.

2.2 The provenance of the poor classes

Here, and not with the theorems, sits the burden of proof of the construction.

Canonical is the procedure: the concept of the buildable and its generation are standard clone theory and not invented for this purpose.

Chosen is the basis: these operations, this embedding. The objection that this choice is cut to fit is admissible. It is not answered but declared — and Part A, chapter 2 says why the choice has a substantive reason and where that reason is itself a theorem.

And once the poor class was replaced. For the differential of the role exchange the announced class was "every carrier whose roles are distinguished by type". It is not internalisable — it quantifies over type judgements of the ambient language, and an ill-formed term has no negatable proposition — and it would have been false: the corpus contains a counter-witness over a one-element stock of values. The class that took its place — every carrier whose stock of values carries a fixed-point-free exchange — is admissible not because it is convenient but because it is Günther's symmetric exchange relation. The replacement is named in the file header together with both reasons for the fall of the literal version.

2.3 The differential, applied to the workshop

In the working phase before the fourth edition the form was applied twice to the architecture itself.

To a theorem: the parity obstruction [73] has exactly the differential shape — the impossibility half over all maps without side conditions, the possibility half with an explicit witness [74], [75] beside it.

To a measurement: where an axiom profile is to be explained, the workshop has since required two versions differing in exactly one quantity. The four cases stand in §4.3.

3 · The ledger and the register

3.1 What the ledger achieves

Günther's concepts stand in a definitions edition, divided into paragraphs. Which concept has which formal carrier is machine-checked and stands in a file of its own — not in this paper. What stands here is the mechanism.

How many rows the ledger carries, how many of them have a carrier and how many paragraphs are covered stands in docs/kennzahlen.md.

How many carriers appear in more than one row, and how many rows are surplus as a result, is stated in the ledger's self-report, with the arithmetic; no tool checks that arithmetic. A sentence about it stood wrong in the self-report until the fourth edition, for five revisions — "eight carriers more than once" instead of "five carriers, eight surplus rows" — and none of the rules could see it, because they read rows and not sentences about rows.

3.2 The rules

Two bite at build time, the others at lint time:

R3 through R9 set the exit code. The open rows stay open — among them the row on the world-picture concept (L06-1), which now refers to the ascent probes and still has no carrier. An open row is not a defect of the ledger but its achievement.

3.3 The register of posits

Posits do not disappear, they are registered. The load-bearing rule is not "the aggregate contains no posit" but no theorem of the aggregate hangs on a posit. A field of type true can enter no proof; why it must nevertheless be marked is an epistemic and not a logical argument: what stands in the aggregate reads as certified holdings.

Two classes are carried — placeholders with an exit criterion, constitutive posits with a justification — and one standing probe: no non-projection of the aggregate has the conclusion true, value zero, with a known counter-count on the projection side.

How many posit fields the corpus carries, and how they divide between the two classes, stands in the posit register of the repository.

Exactly two of them are constitutive. One of these was not found when the register of marks was first built, because its file header states its status in the language of the construction pattern and not in the language of the marks. The lesson stands in §5.2.

4 · The safeguards

4.1 The standing

The values stand in docs/kennzahlen.md, generated from the corpus, each with its route: constants checked by the gate, guards written and enforced, theorems, build jobs, declared gaps. What stands here is what they mean.

Equations between the values run along at generation, and if one falls, none of the numbers is to be used. The load-bearing one is: guards written = guards enforced + those lying outside the default targets. Two independent routes arrive at the same decomposition — one over the file tree, one over the import closures. And it is more than a check of itself: because the one route sees the working tree and the other the tracked files, it falls as soon as a module lies in the tree and is not tracked. A rule that formerly demanded care is now a condition that breaks.

The gate reports that the aggregate draws no sorryAx and that the whitelist is empty.

4.2 The four mechanisms

First, the axiom guards. For every load-bearing theorem the profile is measured and frozen as an expectation; if the proof basis shifts silently, the build breaks. The guard secures the basis, not the wording.

Second, the statement pins. A weakened theorem with the same profile would pass a guard. Pins nail down the full wording and break the build on definitional drift.

Third, the global gate (§4.1).

Fourth, the separation of ranges. The gate's assurance holds for the aggregate and for no other range. That a module runs along with every build does not mean it is gated: the probes on the proemial relation are built along, guarded and ungated — a situation for which the third edition had no language, and which the fourth described for the first time.

4.3 Measured axiom provenance

Measuring a profile is cheap; saying where an axiom comes from is a second measurement. It has a form: two versions differing in exactly one quantity. Four cases:

A fifth case belongs beside them, because it went the other way. In a later move a saved declaration would have inherited Classical.choice into the whole chain below it — the saving was withdrawn after measurement, and the chain is choice-free. A saving that changes the profile is no saving: it trades one declaration for an axiom in everything downstream, and it does so silently, because the saved line is visible and the inherited axiom only shows in a profile.

What is measured throughout are profiles and dividing lines. What is not measured is the path of the axiom into the term — the file headers say both, in that order.

4.4 Unguarded theorems inside the aggregate

A statement about guard density has a quantifiable reservation, and it stood nowhere until the fourth edition.

While ordering the corpus by subject matter, at the state 427b4b0, 115 theorems in 32 aggregate modules were found whose module carries no guard — the unit of the count is the module and not the theorem —, spread over three strands; outside these three every aggregate module with theorems carries at least one. Striking: they are exactly the three strands whose subjects occurred in no edition of the paper. This coincidence is measured, its cause is not — and without a route no explanation is offered here.

For the largest of the three — the layer on the interchange of form and content — the question has meanwhile been decided. Of the 43 theorems it then had (counted on 4 August, 3b2da94) only two lay in the closure of a guarded theorem; the exception for auxiliary lemmas therefore did not carry. In two stages (4feaf25, 4fdf931) 17 guards have been set, selected by the marks the corpus itself sets: four after the core named in the file header, eight after the module index, five after the concept the respective file carries in its title — these five expressly marked as discretionary, with the note that a later move on a better basis may reclassify.

Afterwards, at the state 4fdf931, 21 of 43 lie in a closure, all nine modules carry at least one guard, and all 17 measured profiles are identical — the strand is profile-uniform. A third stage will not be built: the marks of the corpus are exhausted, and to switch a criterion because it has run out would be exactly the error the selection was built against. The remaining 22 theorems are recorded by name and with their source situation in an accepted report; they are unguarded and are called so.

The running state stands in docs/kennzahlen.md and has moved twice since the survey above. It is measured, not computed — the unit is the module: whoever guards a module takes all its theorems out of the count, and therefore a number of guards can never yield a number of theorems.

4.5 What a foreign glance finds

Whoever searches the tree for the gap mark finds three numbers, and each answers a different question: raw word occurrences across the whole tracked corpus, occurrences in the source files, and affected declarations — the last of these all outside the aggregate. The first two stand in docs/kennzahlen.md; the third needs an environment query and is measured separately when needed. The third is the load-bearing one; the first two count prose along — freeze notes, doc strings, the phrase "free of it".

This quantity counts itself, and the rule for it stands in §5.1.

The frozen branch stays frozen, with the same thawing conditions; green means compiles there, not gap-free. It carries no guard; how many theorems it holds is counted in docs/kennzahlen.md at the anchor.

4.6 What the shape rests on

Ordering the corpus by subject matter produced a piece of information that no range table can give: the shape does not rest on the whole corpus. Three of the seven layers of Part A are carried solely by the directory on the proemial relation, two solely by the kenogrammatic layer; probes, calibration, frozen preparatory work and the assignment layers do not carry it.

This is no criticism of the rest — they are legitimate and are marked as such in their headers. It is the statement of range belonging to the sentence "this architecture claims…", and it has been missing for three editions.

5 · The instruments

Alongside the theorems something has arisen that knows nothing of Günther and could travel further: a reviewing practice for the formalisation of philosophical texts. Whoever formalises a thinker has a problem that this project has at every formalisation: the interpretation outruns the term. A theorem is built, its name is chosen, and the name claims more than the theorem. Against this gradient no resolutions help, only mechanisms.

5.1 The rules

The rule file of the corpus carries marked rules, each from a measured misstep; how many there are stands in docs/kennzahlen.md, counted there and not carried forward here. The most load-bearing:

A route carries a must and a must-not case, and its name boundary is a character class, not an assumption about the notation of the build. Violated three times in a row, each time differently; the sharpening of the second error was itself the third.

The stipulations of a specification are checked against each other, not only each on its own. Two individually correct stipulations can jointly force something neither demands — three times, at rising cost: first a tool exception, then a non-construction decision, then an axiom in a profile.

A statement of holdings is a pointer, not a list. Enumerating statements without a route go stale silently. In a single file nineteen identically built ones stood; they have been replaced by section pointers. The same healing at a heading, at a preamble and at a rule number.

Claims about the reachability of a location are write probes, not inferences from empty search results. A missing result looks like an answer; twice it was none.

Whoever updates a self-counting number measures after writing. The gap number of §4.5 counts its own documentation along — and, at second order, the explanation of its movement as well. One commit carried, at its own place, the value that had held before the explaining sentence. The wrong value still stands in the history, with hash and reason; the error is worth more than its removal.

If a measurement is repeated after a change, it runs first with the seed set of the previous move and must reproduce its numbers exactly. The other rules check a result against an expectation; this one checks whether the route measures the same thing in two moves.

Before a name is assigned, it is checked whether it is occupied — in the corpus or in its surroundings; if it is, the meaning decides and not the proximity. Two measured cases: one letter that denoted two different things in the same strand, and one name under which the corpus carries a different operation — with that one the two theorems of a whole module would have been trivial, at a green build.

5.2 The pitfalls

The pitfall file carries its entries; how many there are stands in docs/kennzahlen.md. Several concern not the proof language but the tool chain, and the newest are measurement errors in their most unpleasant shape:

An empty result gives pause; a slightly too small one does not. An unquoted path list on the command line delivered zero for every search word — noticeable because for every one. An output command, by contrast, prints a different wording for axiom-free theorems than for all others; whoever searches only for the one finds 415 instead of 487 names (measured at that state, c3b28cb, 5 August); axiom-free at that state were 72 guards. A closure from 415 seed names can be computed, no intermediate figure looks odd, and it was found solely by the calibration of set size against set size.

And a character class loses what it does not contain. Lean names may contain ? and !; a class built without them lost exactly one of 501 names — and a second route cut the same name at the same place. Two routes, the same blind spot.

An output breaks at the line length, not at the name length. For the most frequent profile: line length equals name length plus 61. Measured: at 116 no break, at 123 a break; the interval is open in its middle, because no measuring point lies between. A broken expectation text is the correct form and no sloppiness — it is not smoothed, because the comparison is verbatim. And whoever sets a series by a template breaks the short ones.

A range list older than the move measures the previous state and reports it as the new one. The result can be right and the route blind — no counter-probe that looks at the value shows this. The range list is therefore generated after the move; and a list generated before it is correct for the reproduction run and wrong for the new measurement.

Text extraction inserts hyphens at line breaks. Whoever checks verbatim quotations without removing them gets a false alarm at two of five correct places. What makes this dangerous is not the false alarm but its rate: a check that fires at two of five correct places will not be read the third time — and then it misses the one real deviation it was built for.

Searching for the mark word finds no pattern speech. The register of interpretation and posit marks was built from the marks that were known — and therefore failed to find one of the two constitutive posits of the aggregate, because its header states the status in the language of the construction pattern.

At every extension of a reference work the set test applies, not the comparison of numbers. A first attempt lost nine entries (mark register rev. 2, 4 August), and the grown number looked good.

5.3 The lint

By kind, not by number. The number of groups stood in three consecutive editions verbatim the same — "three" — and was twice overtaken by reality without any edition noticing; the third even called it "unchanged". Not a number that was updated wrongly, but one that was not updated at all and therefore stayed while it became false.

Reporting groups are read and do not enforce: the rank claims and the conceptual relapse. What they have in common is that judging them requires a judgement — a proximity window also hits benign cases, and a rank claim can be admissible. A breaking lint gets circumvented, a reporting one gets read.

Breaking groups set the exit code: the concept register; the unguarded printing of an axiom profile; the numerals of the carrier table outside edition and draft. What they have in common is that their finding carries no discretion and their baseline is zero — that is the condition under which a breaking lint is read rather than circumvented. Exceptions carry a justified mark and no tolerance of counts.

Which groups exist at the generation state, and how many, is said by the lint's own report — not by this paragraph.

A side use that costs nothing: an unchanged rank figure after a text move is at the same time the control that the new text carries no rank phrase. An existing instrument as a check for a move it was not built for.

5.4 The list of errors

The evidence that the review layers bite is this list — and it is continued, not shortened. A good part of the entries were made by both instances, and that belongs here and not in a footnote: an edition that conceals it claims a care it did not have; one that shows it evidences the checking layers it describes.

From the working phases that led to the fourth edition:

Four entries from the then most recent phase, before the fourth edition, and three of them are a new class:

The common denominator of the first three is new and less pleasant than a wrong result: an empty field with a reassuring label. The list carried, so far, the empty result and the slightly-too-small one; here the result is right and the range blind — and no counter-probe that looks at the value shows that. The healing therefore does not look at the value: every measuring route names the size of its range, and every new guard is checked with a seeded hit.

And the sentence above the list has become sharper with these entries. It read: none of these errors was found by the instance that made it — and that no longer holds: the path expression was made and found by the same instance. What holds without exception lies one level lower:

None of these errors was found by the route that made it.

The path expression was found by a different route, the link blindness by a seeded probe, the count of cases by counting again. Never the baseline, never the repetition of the same measurement.

From the generation of the fifth edition — and here, because a list of errors necessarily ends before the generation of its own edition:

And those from the sixth and the seventh edition. They sit where the paper speaks about itself — save the one that is about the way of working:

Two classes stand in the last entries. One is a number taken from a subset that appears as a number about the whole set; it is the sister of the empty field with a reassuring label — there the range is blind, here too small, and both times the number looks right. The other is a claim that was correct at its anchor and became untrue as the corpus moved — not an error of the measurement but of its durability.

Added after the seventh edition was delivered — a point repair on the running edition, and the first entry of this list that withdraws a claim instead of healing a rendering:

From the work on the eighth edition:

From the eighth edition, corrected in the ninth. The entries are ordered by kind. The last concerns not the paper but the corpus.

Incorrect — already wrong when that edition appeared:

Unmarked — a gloss without its mark:

Missing:

Outdated — right when it appeared, aged since:

Empty — a rank without a set, in the corpus:

5.5 What the fourth edition learnt methodically

The third edition explained its reticence by an asymmetric burden of proof: against overstatement there is an apparatus, against understatement nothing, so the text drifts downward. This explanation is half refuted. A review of the negations found not only statements that were too weak, but also one that was too strong — a "provably" in the closing picture where the carrier expressly says interpretation.

What explains both directions: a mark set by the carrier is lost on the way into the paper. From "carries no decidability instance" comes "is not decidable"; from "interpretation" comes "provably". And the loss does not hit negations only: the overlap [45] is a cardinality theorem in its carrier's header and stood in the paper as a construction prohibition.

Hence the obligation under which Part A is written, and it has three limbs: every negation carries a route as a rank claim does; every upgrade carries a measurement; and where the carrier sets a mark, the paper carries it along.

A further distinction has arisen in the process which the corpus did not have before. A negation claims either that something does not exist, or that this project does not build it, does not claim it, does not exclude it. The first is a statement about the world and needs checking; the second is one about the project's own self-binding and can be looked up in file headers. The sentence about the limit object looks like the first and is the second.

And one lesson of the fifth edition concerns the anchoring itself. A number-word about one's own apparatus — "three groups", "fifteen entries" — carries no anchor and therefore rots where an anchored figure would merely age. Two such sentences of the fourth edition were false, and that is why the fifth edition exists.

6 · Appendix: counting routes

So that the numbers are recomputable and not merely credible, each carries its route. The measured quantities stand with value and route in docs/kennzahlen.md and are not repeated here; what stands here is of which kind each number is — measured, proved or computed. That is the information a table generated from the corpus cannot give.

Quantity Route
constants checked build output of the gate
guards written search for the guard pattern over both directories
guards enforced the same route, restricted to the import closure of the default targets; equation written = enforced + foreign-set case
theorems widened theorem route over the main directory
build jobs build output, not summed
gap mark word boundary, occurrences rather than lines, over the tracked files; declarations per file. The search term itself stands in the README, not here — naming it in the paper would move the number the paper reports
frozen branch structure and guard route per directory
unguarded aggregate theorems theorem route against guard route per module — the unit is the module
module partition import closures of the targets, checked as an equation
carriers of the shape assignment of the subjects to the layers
axiom-free guards expectation-text route — not the profile route
ledger lint group for the register; surplus as an equation
locally classical operations proved [65]; 8, 64, 1024, 32,768 are instances
of these buildable proved [62], [55], [54]
patterns of length 4 proved [39], [40]
reversal-compatible embeddings non-existence and existence proved [73], [74]; the counts computed
clone fragment over three values computed, outside the corpus
flat lattice computed; the existence form proved [89]

Four rules on counting. Counted over the shell, not with a library function that skips blank lines. Aggregate and corpus figures kept apart. Build outputs of several targets never summed. And: a number standing next to a related one is checked against it as an equation — twice exactly that found a standing error.

And one more, from the working phase before the fourth edition: every measuring route names the size of the range it searched. A zero is a statement about what was searched — and twice in one session it was a statement about nothing.

Edition Rev9, Part B · rolling DRAFT · figures in docs/kennzahlen.md, with a state anchor

This is the English edition of the German Part B. Where the two would diverge, the German edition governs — except for the passages from Cognition and Volition, which the English edition quotes from Günther's own English and the German edition from the German translation.

The Mathematical Shape of the Architecture — Part C: The Limit

About this part

This part brings together the measured limits of the build. A limit of which one knows what it hangs on is a result; none of the following is carried here as a defect.

C.1 · The proemial relation

What Günther claims. The proemial relation is the relation in which what connects can itself become what is connected at another level, and conversely. The exchange is "not mutual". It is "a mere potential" that becomes actual only as exchange or as order, and it "constitutes relation as such". It governs the connection of cognition and volition, heterarchically (source-verified, C&V pp. 19–21, 33).

What was attempted. The build has tried to carry the relation in several attempts over several phases. The attempts, their kinds and the reasons for their failure are in the carrier note (Part B).

Where it failed. From Günther's own determination a prefilter is derived: a carrier of the relation would have to be a fibre over what is connected (posited, derived from [T6]). About other fibres the prefilter does not decide. What the corpus carries on this is exactly: the two maps that forget in the corpus — the kenogrammatic descent and the projection of an arrow onto its source — are demonstrably not injective (descent_not_injective, arrow_left_not_injective) (proved [99], [97]). The collecting carrier ProemialCarrier distributes the features of the relation over its fields and remains a placement, not a carrier.

What the pattern says about the subject. A carrier that is itself a relation cannot be it — a formal shadow of "a mere potential" (reading). The reading holds under two conditions. It concerns the proemial relation as a whole; a built theorem would carry a claim on it. And it does not explain future failures in advance. It also has an anchor in Günther's text: the connection of a relation with a relatum he leaves to the traditional means; it "can easily be taken care of by traditional logical devices"; his subject from then on is "the trans-classic relation between relator and a relatum" (source-verified, C&V p. 20, on the page image). A relator that in extensional semantics is its table is a relation together with its relata, that is, the case Günther leaves to the traditional means; that the reading thereby carries his distinction is assignment.

What is open. Several ways are open; the carrier note names them. Only the intensional one has a built substructure. Whether a fibre over relators fulfils the claim is decided neither by the prefilter nor by the source (programme).

What it is good for. Buridan shows it (Part A).

The relation in IGN. In Identität, Gegenidentität und Negativsprache the word proemial does not occur (measured, over the version of IGN). For cognition and volition IGN sets number as a neutral medium. This is neither a contradiction of C&V nor a revision. C&V denies a fixed dominance of the one over the other, IGN p. 53 a symmetrical exchangeability (source-verified). Both leave the same space that C&V gives the proemial relation: an exchange that is not mutual. The will's "transcendental prius" means, in IGN, underivability, not dominance (source-verified, IGN p. 53).

C.2 · The second negation as a definitional gap

A single negator is, in the corpus, a permutation of the values; its type alone keeps it within their range (definitional, by type). A definition that would lead a step out of the contexture as a single operation the corpus does not have; the item is open (L07-4) (programme). This is a gap of definition, not a limit of the subject matter: a build could overcome it. What exists is the order of the steps (Part A, second negation).

C.3 · The ass's choice

An animal that has to eat, and an environment that gives it no directive from which its will could take its orders. From this Günther reads off what a choice changes in the world: first an order, then an exchange that is neutral between subject and object, then the order the animal founds by choosing. → Buridan

Which haystack the animal eats, this paper leaves open, and it may not derive it: a theorem that derived the choice would reduce action to a ground, and with that there would be no freedom (Günther, following Schelling; source-verified, IGN p. 53; the application to the corpus is a reading).

This distinguishes this limit from the one Chapter 7 names as the third: that only the that of the act is no structural feature. There a calculus cannot; here it may not. The other limits in this part are findings; this one is a condition.

C.4 · AT-1b as the limit of semantics

For the step beyond the eighth place Günther names two conditions (source-verified, Lille p. 19). The first, that the step arises from the exhaustion of reflection, is built. The second, that the seven values move into the designative, is neither built nor claimed: the corpus carries no semantics of values, and its modules claim none. Whether the limit could be crossed is open.

Günther draws a limit of the same kind elsewhere. In IGN the criterion that distinguishes within the realm of number is language, and the languages are fixed to the values and to designation (source-verified, IGN pp. 53 f.). That this is the same limit that is called AT-1b here is an attribution over two steps (assignment). The corpus works in the layer of number and at its syntactic edge; above it, designation begins.

C.5 · The fifth limit

The previous edition left open in Chapter 7 whether the bound of the separation theorem belongs to the subject matter or to the frame. It belongs to the frame, and it hangs on one order axiom: the antisymmetry of ≤, from which the asymmetry of < follows (computed: complete enumeration outside the corpus; no theorem, no module). Without this signature one would read the statement at the level of the strict order; there it is the definition of asymmetry, turned around once, and the class of its counterexamples is empty.

The two horns of the separation theorem carry different marks. That the order horn is asymmetric is a synopsis with a derivation step that is not Günther's (synopsis). That the exchange horn is equivalence stands in Günther (source-verified, C&V p. 32). The localization explains the separation theorem; it does not derive it. The fourth limit of the previous edition is thereby determined at its place.

C.6 · What has not been read