# A Non-Formulable Theorem: A Fundamental Limit of Finite Syntactic Systems and Its Consequences for Security and AI

arXiv: https://arxiv.org/abs/2609.04086 · HTML: https://mlsanity.com/paper/2609.04086/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 6 of its 10 references that are in the map.
- First posted on arXiv 3 Sep 2026.

## Builds on (most cited first, 6 of 6)

- [Syntactic Systems Cannot See Semantic Invariants](https://mlsanity.com/paper/2606.17275/) (2026)
- [The Observer World: A Cryptographic Extension of Impagliazzo's Five Worlds](https://mlsanity.com/paper/2606.27139/) (2026)
- [Observers, Symmetries, and the Hierarchy of Language Classes: A Theory of Computation Parameterized by the Observer](https://mlsanity.com/paper/2606.27407/) (2026)
- [Syntactic Separation Implies Computational Indistinguishability: An Abstract Obstruction Theorem](https://mlsanity.com/paper/2606.29177/) (2026)
- [Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods](https://mlsanity.com/paper/2607.07723/) (2026)
- [What Syntax Cannot See: The Dynamic Syntactic Invariance Principle and Several Instances of the Same Hidden Assumption, and a Contradiction](https://mlsanity.com/paper/2608.00958/) (2026)

## Abstract (arXiv)

For every coherent and sufficiently expressive finite syntactic system S, we prove the existence of at least one theorem that S cannot produce autonomously. The result is a metatheorem: it proves the existence of a theorem, and applies to every finite syntactic system - security mechanisms, AI systems, formal verifiers, legal systems, economic models, and the formal system in which it is itself proved.