2000 character limit reached
Cut Elimination for Weak Modal Grzegorczyk Logic via Non-Well-Founded Proofs
Published 3 Apr 2018 in math.LO | (1804.01432v1)
Abstract: We present a sequent calculus for the weak Grzegorczyk logic Go 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.