ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
An Approximation Semantics for the Propositional Mu-Calculus
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Handbook of automated reasoning
Automata logics, and infinite games
Mathematical modal logic: a view of its evolution
Journal of Applied Logic
A Fixed-point Characterization of a Deontic Logic of Regular Action
Fundamenta Informaticae - Deontic Logic in Computer Science
Logical Specification and Analysis of Fault Tolerant Systems Through Partial Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
On the structure of inductive reasoning: circular and tree-shaped proofs in the µ-calculus
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
A formal language for electronic contracts
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
CVPP: a tool set for compositional verification of control-flow safety properties
FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Weak automata for the linear time µ-calculus
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
A Fixed-point Characterization of a Deontic Logic of Regular Action
Fundamenta Informaticae - Deontic Logic in Computer Science
Reducing behavioural to structural properties of programs with procedures
Theoretical Computer Science
| Hi-index | 0.00 |
We consider the propositional \m-calculus as introduced by Kozen [TCS 27]. In that paper a natural proof system was proposed and its completeness stated as an open problem. We show that the system is complete.