Faster Model Checking for Open Systems
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Alternating-Time Temporal Logic
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
| Hi-index | 0.00 |
We define a propositional logic of games which lies in expressive power between the Propositional Dynamic Logic of Fischer and Ladner [FL] and the µ-calculus of Kozen [K]. We show that the logic is decidable and give a very simple, complete set of axioms, one of the rules being Brouwer's bar induction. Even though decidable, this logic is powerful enough to define well orderings. We state some other results, open questions and indicate directions for further research.