Abstract
In the context of logics with least and greatest fixed points, circular (i.e. non-wellfounded but regular) proofs have been proposed as an alternative to induction and coinduction with explicit invariants. However, those proofs are not wellfounded and to recover logical consistency, it is necessary to consider a validity criterion which differentiates valid proofs among all preproofs (i.e. infinite derivation trees). The paper focuses on circular proofs for MALL with fixed points. It is known that given a finite circular representation of a non-wellfounded preproof, one can decide in $$\mathrm {PSPACE}$$ whether this preproof is valid with respect to the thread criterion. We prove that the problem of deciding thread-validity for $$\mu \mathrm {MALL}$$ is in fact $$\mathrm {PSPACE}$$ -complete. Our proof is based on a deeper exploration of the connection between thread-validity and the size-change termination principle, which is usually used to ensure program termination.
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.
