Applications
A Non-Formulable Theorem: A Fundamental Limit of Finite Syntactic Systems and Its Consequences for Security and AI
arXiv:2609.04086v1 Announce Type: cross Abstract: For every coherent and sufficiently expressive finite syntactic system S, we prove the existence of at least one theorem that S cannot produce autonom
arXiv:2609.04086v1 Announce Type: cross Abstract: 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.
Related
- The Deterministic Horizon: Impossibility Results as Design Specifications for Trustworthy AI Systems
Source: arXiv cs.AI | 2026-09-04