A Complete Deductive System for the µ-Calculus (1995)

by Igor Walukiewicz
Citations:13 - 0 self

Documents Related by Co-Citation

13 Completeness of Kozen’s axiomatization of the propositional µ–calculus – Igor Walukiewicz
72 An automata theoretic decision procedure for the propositional modal mu–calculus – Robert S Streett, E Allen Emerson - 1989
18 On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-Calculus – Christoph Sprenger, Mads Dam - 2003
27 About cut elimination for logics of common knowledge – Luca Alberucci, Gerhard Jäger - 2005
365 Propositional dynamic logic of regular programs – M J Fischer, R E Ladner - 1979
14 Cut-free common knowledge – Gerhard Jäger, Mathis Kretz, Thomas Studer - 2007
16 A calculus of circular proofs and its categorical semantics – Luigi Santocanale - 2002
52 Games for the µ-Calculus – Damian Niwinski, Igor Walukiewicz
302 Results on the propositional µ-calculus – D Kozen - 1983
15 A theory of programs. Unpublished manuscript – D Scott, J De Bakker - 1969
23 Rudiments of mu-calculus – A Arnold, D Niwinski - 2001
98 Proof Theory – K Schütte - 1977
3 Why are modal logics so robustly decidable?, Current Trends in Theoretical Computer Science. Entering the 21st Century – E Grädel
2 A note on model checking the modal ν-calculus, Theoretical Computer Science 83 – G Winskel - 1991
11 Automata for the µ-calculus and Related Results – David Janin, Igor Walukiewicz - 1995
7 On model checking for the µ-calculus and its fragments, Theoret. Comput. Sci – E Emerson, C Jutla, A Sistla
34 The modal mu-calculus alternation hierarchy is strict – J. C. Bradfield
8 Modal logics and mu-calculi: an introduction,” Handbook of Process Algebra – J Bradfield, C Stirling - 2001
14 Results on the propositional µ-calculus. Theoretical Computer Science, 27:333–354 – D Kozen - 1983