2000 character limit reached
Rooted Hypersequent Calculus for Modal Logic S5
Published 22 May 2019 in math.LO | (1905.09039v1)
Abstract: We present a rooted hypersequent calculus for modal propositional logic S5. We show that all rules of this calculus are invertible and that the rules of weakening, contraction, and cut are admissible. Soundness and completeness are established as well.
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.