Cut Elimination for Weak Modal Grzegorczyk Logic via Non-Well-Founded Proofs
classification
🧮 math.LO
keywords
proofscut-eliminationgrzegorczyklogicnon-well-foundedweakactingallowing
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.