 As noted, KQML’s sole rule of inference is MP, Modus Ponens. Accordingly, a proof in KQML is a finite sequence of formulas of \(\scrL_\Box\) such that each is either an axiom of KQML or follows from preceding formulas in the sequence by MP.