3 citations · 4 across the 5 of their papers we have counts for
5 papers
The Limit of Recursion in State-based Systems
Bahareh Afshari, Giacomo Barlucchi, Graham E. Leigh
We prove that omega^2 strictly bounds the iterations required for modal definable functions to reach a fixed point across all countable structures. The result corrects and extends…
Cut elimination for the alternation-free modal mu-calculus
Bahareh Afshari, Johannes Kloibhofer
We present a syntactic cut-elimination procedure for the alternation-free fragment of the modal mu-calculus. Cut reduction is carried out within a cyclic proof system, where proofs…
Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
Bahareh Afshari, Johannes Kloibhofer
We consider modal logic extended with the well-known temporal operator 'eventually' and provide a cut-elimination procedure for a cyclic sequent calculus that captures this fragmen…
Demystifying
Bahareh Afshari, Graham E. Leigh, Guillermo Menèndez Turata
We explore the theory of illfounded and cyclic proofs for the propositional modal -calculus. A fine analysis of provability for classical and intuitionistic modal logic provides…
On the Herbrand content of LK
Bahareh Afshari, Stefan Hetzl, Graham E. Leigh
We present a structural representation of the Herbrand content of LK-proofs with cuts of complexity prenex Sigma-2/Pi-2. The representation takes the form of a typed non-determinis…