Provability logic is amodal logic, in which the box (or "necessity") operator is interpreted as 'it is provable that'. The point is to capture the notion of a proof predicate of a reasonably richformal theory, such asPeano arithmetic.
There are a number of provability logics, some of which are covered in the literature mentioned in§ References. The basic system is generally referred to asGL (forGödel–Löb) orL orK4W (W stands forwell-foundedness). It can be obtained by adding the modal version ofLöb's theorem to thelogicK (orK4).
Namely, theaxioms ofGL are alltautologies of classicalpropositional logic plus all formulas of one of the following forms:
And therules of inference are:
TheGL model was pioneered byRobert M. Solovay in 1976. Since then, until his death in 1996, the prime inspirer of the field wasGeorge Boolos. Significant contributions to the field have been made bySergei N. Artemov, Lev Beklemishev,Giorgi Japaridze,Dick de Jongh, Franco Montagna, Giovanni Sambin, Vladimir Shavrukov, Albert Visser and others.
Interpretability logics andJaparidze's polymodal logic present natural extensions of provability logic.