Tarski's Meta-Language Ladder
Updated 2026-08-05
INTRODUCTION
English translation pending.
CORE DEFINITION
From Alfred Tarski's undefinability theorem and his schema stating that 'snow is white' is true if and only if snow is white. Truth for an object language cannot be defined inside that same language without contradiction; it needs a meta-language with its own vocabulary. The ladder can be climbed indefinitely, but a dictionary must eventually anchor in non-linguistic reference.
SCAFFOLDING EFFECT
Reduce cognitive load
- Level shift: When a field stops yielding answers, look for a higher-level vocabulary to describe it. - Cross-discipline borrow: Import a neighboring field's terms to reframe a stuck problem. - Layer discipline: Keep object-level claims separate from claims about those claims.
Anchor fast decisions
A language cannot fully describe its own semantics, because the description would have to be expressed in the very terms under examination. Introducing a meta-language adds the expressive capacity the lower level lacks, which is why the move produces new answers rather than restatements. The same step works outside logic: a field stuck on its own terms needs vocabulary from outside.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Metalanguageverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS