2000 character limit reached
Cut-elimination for the modal Grzegorczyk logic via non-well-founded proofs
Published 11 Apr 2017 in math.LO | (1704.03258v1)
Abstract: We present a sequent calculus for the modal Grzegorczyk logic Grz allowing non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.
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.