Nested sequents for provability logic GLP: FIG. 1

Daniyar Shamkanov
2015 Logic Journal of the IGPL  
We present a proof system for the provability logic GLP in the formalism of nested sequents and prove the cut elimination theorem for it. As an application, we obtain the reduction of GLP to its important fragment called J syntactically.
doi:10.1093/jigpal/jzv029 fatcat:h4fzmxplmjfjffhou2lynfezmi