Abstract
AbstractInspired by Stirling's tableau proofs [4] we introduce a finite, cut‐free sound and complete sequent calculus for the modal mu‐calculus. Proofs in this system are finite trees in which leaves are either axioms or assumptions that are discharged by a specific rule of the calculus. The discharge rules provide a way to unfold assumptions motivating the name circular proofs. (© 2016 Wiley‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
