Non-Well-Founded Proofs for the Grzegorczyk Modal Logic
Logic
2018-04-04 v1
Abstract
We present a sequent calculus for the Grzegorczyk modal logic Grz allowing cyclic and other non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs. As an application, we establish the Lyndon interpolation property for the logic Grz proof-theoretically.
Keywords
Cite
@article{arxiv.1804.00955,
title = {Non-Well-Founded Proofs for the Grzegorczyk Modal Logic},
author = {Yury Savateev and Daniyar Shamkanov},
journal= {arXiv preprint arXiv:1804.00955},
year = {2018}
}
Comments
submitted to Review of Symbolic Logic