Propositional game logic
- 1 November 1983
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 195-200
- https://doi.org/10.1109/sfcs.1983.47
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Propositional logics of programs: New directionsPublished by Springer Nature ,1983
- Trees, automata, and gamesPublished by Association for Computing Machinery (ACM) ,1982
- An elementary proof of the completeness of PDLTheoretical Computer Science, 1981
- Propositional Dynamic Logic of looping and conversePublished by Association for Computing Machinery (ACM) ,1981
- AlternationJournal of the ACM, 1981
- Decidability of Second-Order Theories and Automata on Infinite TreesTransactions of the American Mathematical Society, 1969
- An application of games to the completeness problem for formalized theoriesFundamenta Mathematicae, 1960