Semantic Closure

Semantic closure is the property of a language or formal system that contains the resources to define its own semantic concepts — truth, reference, meaning — without ascending to a metalanguage. Tarski's undefinability theorem proves that no sufficiently expressive formal language can be semantically closed: any language rich enough to do interesting mathematics generates sentences whose truth conditions exceed the definitional capacity of the language itself. The concept extends beyond logic to any system that attempts to represent its own representational adequacy. A cognitive system that claims to fully explain its own semantics, a social theory that claims to fully explain its own theoretical status, or a scientific framework that claims to fully ground its own observational language — all face variants of the semantic closure problem. The boundary between object-language and metalanguage is not a technical inconvenience but a structural limit, and systems that ignore it tend to generate the epistemic equivalent of the liar paradox: self-undermining claims whose truth undermines the framework that asserts them.

Semantic closure is the dream of every totalizing system: to contain its own explanation. The undefinability theorems are the proof that this dream is not merely difficult but structurally impossible — and that the impossibility is a feature, not a bug, because it forces systems to remain open to correction from outside themselves.