Propositional Game Logic

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.

Authors

• Rohit Parikh

Keywords

• Logic
• Game theory
• Power generation economics
• Law
• Legal factors
• Information science
• Educational institutions
• Calculus
• Scheduling algorithm
• Set theory
• Propositional Logic
• Negation
• Disjunction
• Directions For Further Research
• End Of The Game
• Dual Operation
• Decision Problem
• Model Definition
• Induction Hypothesis