Provability logic is a modal 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 rich formal theory, such as Peano arithmetic.
Examples
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 as GL (for Gödel–Löb) or L or K4W. It can be obtained by adding the modal version of Löb's theorem to the logic K (or K4).
Namely, the axioms of GL are all tautologies of classical propositional logic plus all formulas of one of the following forms:
Distribution axiom: □(p → q) → (□p → □q);
Löb's axiom: □(□p → p) → □p.And the rules of inference are:
Modus ponens: From p → q and p conclude q;
Necessitation: From ...