2000 character limit reached
Cut Elimination for Weak Modal Grzegorczyk Logic via Non-Well-Founded Proofs (1804.01432v1)
Published 3 Apr 2018 in math.LO
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.