2000 character limit reached
Cut-elimination for the modal Grzegorczyk logic via non-well-founded proofs (1704.03258v1)
Published 11 Apr 2017 in math.LO
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.