Re-Entry as a Binary Prohibition Law: Enumeration, Impossibility, and the Three-Outcome Completion

In the paper's words

Self-referential constraints arise in hardware security, programmable logic, and symbolic execution tools, where a system must forbid a state while generating the very operation that enforces the prohibition. The open question is whether a re-entering form of the calculus of indications — a distinction taken inside its own indicational space — can simultaneously function as a binary prohibition law: a total rule on a two-element domain that forbids each of its own inputs. We adopt the strictest of three reconciled conventions, in which a prohibition law is a total self-map f with f(x) ≠ x for all x, and re-derive with explicit arithmetic that exactly $1$ of 2² = 4 unary laws on the two-element Boole algebra satisfies it (the negation, density $0.25$), that this law has no fixed point and re-entry period T₂ = 2, and that a settled binary prohibition re-entry is therefore impossible.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. Fixed points require $f_{\text{not}}(x) = x$, i.e., $1 - x = x$, i.e., $2x = 1$ over $\{0, 1\}$: no solution, since $2 \cdot 0 = 0 \neq 1$ and $2 \cdot 1 = 2 \neq 1$.

   from 4.2 Re-entry of the prohibition law

2. The unique binary prohibition law has no fixed point ($2x = 1$ has no solution in $\{0, 1\}$) and orbit period $T_{2} = 2$.

   from 5. Results

3. The outcome that refutes the framework is an orbit that settles while the transition table still satisfies $f(x) \neq x$ for all $x$; since Section 4.2 shows the fixed-point equation $2x = 1$ has no solution on $\{0, 1\}$, such an outcome would indicate an implementation error rather than a genuine counterexample, which is itself the diagnostic value of the result.

   from 7. Practical Implications and Engineering Pathways

4. Extending to a three-outcome space $S_{3} = \{m, u, v\}$, derangement arithmetic yields exactly $2$ prohibition laws of $3^{3} = 27$, both of period $3$; density falls by a factor $27/8 = 3.375$ at an entropy cost of $\log_{2} 3 - 1 = 0.5849625$ bits.

   from Abstract

5. A secondary forbidden-word model with the single forbidden pair $11$ leaves $a_{10} = 144$ of $1024$ length-$10$ sequences admissible (survival ratio $0.140625$) and reproduces the three-outcome capacity $\log_{2} 3 = 1.5849625$ bits at the pair level.

   from Abstract

6. Quantitative comparisons: density ratio $27/8 = 3.375$ and entropy increment $\log_{2} 3 - 1 = 0.5849625$ bits (Section 4.4).

   from 1. Introduction

How it is done

1. A reading of the formal result against applied self-referential validation, with explicit falsification conditions and the smallest next experiment (Sections 6 and 7).

   from 1. Introduction

2. Seven works frame this analysis; each contributes a specific method, result, or structural analogy. [1] Marine size spectra stability.

   from 2. Background and Related Work

3. A second reading, retained in [7] as a clearly labeled secondary model, defines a prohibition law instead as a forbidden-word constraint : a set $P \subseteq B_{2}^{k}$ of forbidden words, with a sequence $s \in B_{2}^{n}$ admissible if no length-$k$ contiguous block lies in $P$.

   from 3.3 Secondary convention (forbidden-word model)

4. We compare settings by: (i) density of prohibition laws , $\rho_{2}$ and $\rho_{3}$, as fractions of all laws satisfying (P); (ii) orbit period $T_{f}$; (iii) uniform outcome entropy , $H_{k} = \log_{2} k = \ln k / \ln 2$ bits for $k$ equiprobable outcomes; (iv) for the secondary model, survival ratio $\rho_{n} = |A_{n}| / 2^{n}$ and capacity $C_{n} = \log_{2} |A_{n}|$, where $A_{n}$ is the set of admissible sequences of length $n$.

   from 3.4 Measures

What would falsify it

1. Engineers who insert micropatches into compiled binaries must confirm that a patched function behaves identically to the original, and the tool cozy was built precisely to symbolically execute both versions and check that their observable behavior agrees [3].

   from 1. Introduction

2. A reading of the formal result against applied self-referential validation, with explicit falsification conditions and the smallest next experiment (Sections 6 and 7).

   from 1. Introduction

3. Its results state that cozy verifies the instrumentation code leaves each function's observable behavior unaffected, with per-function symbolic execution times ranging from $0.0092$ s to $16.0683$ s, and its discussion reports testing on DARPA Assured Micropatching challenge problems including a proposed micropatch for the Army MRZR platform.

   from 2. Background and Related Work

Where the claim stops

1. The result rests on the following assumptions, with sensitivity noted for each: The derangement convention (P).

   from 6. Discussion

2. The entire impossibility claim is definitional; under the forbidden-word convention, settled admissible configurations exist (e.g., $000\ldots$), so R2 does not transfer.

   from 6. Discussion

3. On larger binary domains ($|B| = n \geq 2$) derangements exist for all $n \geq 2$ and none has a fixed point, so the no-settlement property generalizes, but the uniqueness claim does not.

   from 6. Discussion

Where to read

1. Abstract264 words · 1 min
2. 1. Introduction609 words · 3 min
3. 2. Background and Related Work1,102 words · 5 min
4. 3. Methods415 words · 2 min
5. 4. Analysis1,111 words · 5 min
6. 5. Results220 words · 1 min
7. 6. Discussion418 words · 2 min
8. 7. Practical Implications and Engineering Pathways921 words · 4 min
9. 8. Conclusion241 words · 1 min
10. Provenance and AI Involvement225 words · 1 min