pith. sign in

arxiv: 1804.00955 · v1 · pith:WXBMC5JVnew · submitted 2018-04-03 · 🧮 math.LO

Non-Well-Founded Proofs for the Grzegorczyk Modal Logic

classification 🧮 math.LO
keywords logicproofscut-eliminationgrzegorczykmodalnon-well-foundedactingallowing
0
0 comments X
read the original 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.

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.