2000 character limit reached
Nested Sequents for Provability Logic GLP
Published 24 Oct 2014 in math.LO and cs.LO | (1410.6652v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.