What a theorem transfer must establish

Formal results
Gödel: a consistent, effectively axiomatised system strong enough for arithmetic. Tarski: truth for the relevant formal language cannot be defined within that same language.
Running language-model system
Software on hardware, producing statistical outputs and studied empirically.
1. Identify the component treated as a formal theory.
2. Establish that the theorem's hypotheses hold.
3. Argue that the formal conclusion transfers to the running system.
Unsupported leap
A citation to the theorem does not supply these premises.
What a theorem transfer must establish A theorem does not transfer itself Formal results Gödel: consistent, effectively axiomatised, enough arithmetic Tarski: truth for the language not definable in that language Explicit symbols and rules Running language- model system Software on hardware Statistical outputs Observed experimentally May implement formal components premises skipped 1. Identify the formal component 2. Establish every hypothesis 3. Argue the conclusion transfers Without the middle, the claim is not established.