Beth’s theorem and Craig’s theorem

Beth’s theorem is a central result about definability of non-logical symbols in classical first-order theories. It states that a symbol P is implicitly defined by a theory T if and only if an explicit definition of P in terms of some other expressions of the theory T can be deduced from the theory T. Intuitively, the symbol P is implicitly defined by T if, given the extension of these other symbols, T fixes the extension of the symbol P uniquely. In a precise statement of Beth’s theorem this will be replaced by a condition on the models of T. An explicit definition of a predicate symbol states necessary and sufficient conditions: for example, if P is a one-place predicate symbol, an explicit definition is a sentence of the form (x) (Px ≡φ(x)), where φ(x) is a formula with free variable x in which P does not occur. Thus, Beth’s theorem says something about the expressive power of first-order logic: there is a balance between the syntax (the deducibility of an explicit definition) and the semantics (across models of T the extension of P is uniquely determined by the extension of other symbols). Beth’s definability theorem follows immediately from Craig’s interpolation theorem. For first-order logic with identity, Craig’s theorem says that if φ is deducible from ψ, there is an interpolant θ, a sentence whose non-logical symbols are common to φ and ψ, such that θ is deducible from ψ, while φ is deducible from θ. Craig’s theorem and Beth’s theorem also hold for a number of non-classical logics, such as intuitionistic first-order logic and classical second-order logic, but fail for other logics, such as logics with expressions of infinite length.