A mechanically specified mapping from formulas and proofs of one formal language or proof system to formulas and proofs of another, defined by rules on syntax (symbols, connectives, term formation) and intended to preserve syntactic derivability and related proof‑theoretic properties.

Principle

Syntactic translation is built by structural recursion on syntax and by mapping inference rules or proof constructions so that derivations in the source yield derivations in the target; it is algorithmic, often compositional, and targeted at preserving provability rather than only semantic truth.

Demonstration

The Gödel–Gentzen negative translation maps classical proofs into intuitionistic proofs by a recursive syntactic transformation of formulas and by providing a rule‑level justification that source derivations produce target derivations, thereby embedding classical provability into constructive provability for a restricted class of formulas.

Misapplication

Assuming that a syntactic translation automatically preserves semantics such as model‑theoretic truth, or that it preserves complexity and proof length; also misusing a syntactic translation designed for one deductive notion on an incompatible target proof system without adjustment.

Consequence

A correct syntactic translation yields soundness of provability transfer: if Γ ⊢_S φ then mapped(Γ) ⊢_T mapped(φ). This supports mechanized proof transport, meta‑theorems about conservativity, and formal embeddings of one calculus into another.

Reversal

Semantic (model‑theoretic) translations focus on mapping models and truth conditions rather than proofs; a purely semantic embedding need not give a syntactic translation that converts source proofs into target proofs.

Boundary

Requires explicit formal grammars and proof systems for source and target and an effective description of the translation; it excludes informal paraphrase, non‑effective encodings, or transformations that only preserve satisfiability or individual truth without producing target derivations.

Semantic Tension

Tension exists between syntactic translations and semantic embeddings: a translation that is syntactically faithful may be semantically opaque (changing model behavior), and conversely a semantic embedding may not induce a practicable syntactic translation of proofs.

Synthesis

A syntactic translation is an algorithmic, structure‑preserving mapping on formulas and derivations that carries provability from one formal system to another; it is the proof‑theoretic instrument for embedding, conservativity proofs, and automated proof migration.