Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have