2000 character limit reached
On structural proof theory of the modal logic K+ extended with infinitary derivations
Published 16 Oct 2023 in math.LO | (2310.10309v1)
Abstract: We consider an extension of the modal logic of transitive closure K+ with some inifinitary derivations and present a sequent calculus for this extension, which allows non-well-founded proofs. For the given calculus, we obtain the cut-elimination theorem following the lines of so called continuous cut elimination. Our consideration also covers ordinary proofs of K+ since they correspond to cyclic cut-free proofs of the presented sequent calculus.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.