On some proof theoretical properties of the modal logic GL (Q798649): Difference between revisions

GL is the propositional modal logic complete under the interpretation of necessity as provability in first-order arithmetic. The cut elimination proof for GL given by \textit{D. Leivant} [J. Symb. Logic 46, 531--538 (1981; Zbl 0464.03019)] contained a gap repaired by \textit{S. Valentini} [J. Philos. Logic 12, 471--476 (1983; Zbl 0535.03031)]. The author presents another cut elimination proof.