https://dspace-test.anu.edu.au/items/fbc2f6c0-b727-40a4-96a0-c63a097344b1
Theoremhood-preserving maps characterising cut elimination for modal provability logics
Propositional modal provability logics like G and Grz have arithmetical interpretations where □φ can be read as 'formula φ is provable in Peano Arithmetic'....
cut eliminationtheoremhoodpreservingmapscharacterising