Any one of a family of translations from the language of intuitionistic logic into the modal language of . A very simple version can be given recursively:
These translations are notable for showing a particular correspondence between intuitionistic logic and , such that a formula is valid intuitionistically if and only if its translation is valid in . Although the original translation of mathematician Kurt Gödel (1906–1978) only preserves validity or theoremhood, the later translations of J. C. C. McKinsey (1908–1953) and Alfred Tarski (1901–1983) preserve validity in general, so that:
iff
Gödel interpreted the operator of as a provability operator, so that intuitionistic logic becomes an implicit provability logic.