Cut Elimination for Weak Modal Grzegorczyk Logic via Non-Well-Founded Proofs

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.

submitted to AiML'18. arXiv admin note: text overlap with arXiv:1704.03258, arXiv:1804.00955