Pillar 3: PBO/Autaxys — Pattern-Based Ontology as Intrinsic Self-Ordering

In plain language

The paper set out to see whether a pattern‑based way of organizing knowledge—called PBO/Autaxys—could make the structure of concepts line up on its own without extra rules. It showed that the number of items that survive each step follows the cascade bound \(N_t \le N_0 \cdot p^t = N_0 \cdot e^{t \ln p}\), meaning the count shrinks exponentially as the process repeats. It also measured that, when checking 480 existing papers, none matched the PBO/Autaxys pattern, a “zero‑match” result that highlights how different this approach is from current literature. The authors stress that PBO/Autaxys is not claimed to be the only possible knowledge framework, only that distinctions can be re‑framed, embedded, or combined rather than eliminated. This matters because it offers a mathematically grounded way to let concepts self‑order, which could simplify building and updating complex information systems. In practice, the exponential shrinkage rule and the strong negative test give developers a clear benchmark for when the method is working and when it needs adjustment.

Restated for a non-expert reader; the original wording follows. Still uses some technical language.

In the paper's words

PBO/Autaxys: Pattern-Based Ontology as Intrinsic Self-Ordering

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

Numbers it reports

1. This yields the cascade bound: $$N_t \le N_0 \cdot p^t = N_0 \cdot e^{t \ln p}$$ which is the TCCB introduced in §5.3.

   from 6.3 The Cascade Bound

2. Following the Syntactic Token Calculus (Quni-Gudzinas, 2026e), the mass $m(t)$ of a token $t$ is given by: $$m(t) = \kappa \cdot \frac{|\sigma(t) - \sigma_{\text{crit}}|}{\sigma_{\text{crit}}}$$ where $\kappa$ is a scale factor and $\sigma_{\text{crit}}$ is the critical coherence strength for token persistence.

   from 6.4 Relation to Physical Mass

How it is done

1. Formally, let $\mathbb{D}$ denote the space of distinctions.

   from 2.1 Distinction as the Primitive Act

2. Formally, a framework $\mathcal{F} = \langle \mathcal{P}, \mathcal{R} \rangle$ with primitives $\mathcal{P}$ and rules $\mathcal{R}$ satisfies OCV if: Generative Completeness : Every element of $\mathcal{F}$ is reachable via a finite sequence of rule applications from $\mathcal{P}$.

   from 3.1 The Closure Criterion

3. The zero-match result across 480 papers is a strong negative finding — it does not prove uniqueness (one cannot prove a negative across all possible literature), but it does shift the burden of proof.

   from 4.3 Significance of the Negative Result

4. The PBO Token Calculus (introduced in §6) implies a bound on observable complexity growth: the number of distinct tokens $N(t)$ at generation $t$ cannot exceed a cascade bound $N_{\text{max}}(t) = c_0 e^{\lambda t}$ where $\lambda$ is the Lyapunov exponent of the D/R algebra and $c_0$ is a system-dependent constant.

   from 5.3 Token Calculus Cascade Bound (TCCB)

What would falsify it

1. PBO/Autaxys generates three concrete, falsifiable predictions that distinguish it from alternative frameworks:

   from 5. Falsifiable Predictions

2. It is falsifiable through the following criteria: OCV Violation : If any D/R-generated pattern requires an external element for its definition or operation, the framework is falsified.

   from 7.2 Falsification Criteria

3. DIB Absence : If ultrametric quantum systems fail to exhibit the predicted Dissonance-Induced Bifurcation under controlled tuning (as specified in §5.1), the framework is falsified.

   from 7.2 Falsification Criteria

Where the claim stops

1. PBO/Autaxys does not claim to be the only possible ontology.

   from 8. Conclusion

2. A distinction cannot be annihilated — it can only be re-framed, embedded, or composed with other distinctions.

   from 2.1 Distinction as the Primitive Act

3. The zero-match result across 480 papers is a strong negative finding — it does not prove uniqueness (one cannot prove a negative across all possible literature), but it does shift the burden of proof.

   from 4.3 Significance of the Negative Result

Where to read

1. Abstract148 words · 1 min
2. 1. Introduction: Autaxys as Generative Meta-Framework274 words · 1 min
3. 2. The D/R Primitives: Distinction and Relation589 words · 3 min
4. 3. Ontological Closure Verification402 words · 2 min
5. 4. The Uniqueness Claim: 480-Paper Synthesis393 words · 2 min
6. 5. Falsifiable Predictions454 words · 2 min
7. 6. PBO Token Calculus434 words · 2 min
8. 7. Discussion and Falsification Criteria435 words · 2 min
9. 8. Conclusion245 words · 1 min