Game Quantification Patterns
From MaRDI portal
Publication:3601804
DOI10.1007/978-3-540-92701-3_8zbMath1209.03031OpenAlexW1492625947MaRDI QIDQ3601804
Dietmar Berwanger, Sophie Pinchinat
Publication date: 12 February 2009
Published in: Logic and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-92701-3_8
Applications of game theory (91A80) Logic in computer science (03B70) Logic with extra quantifiers and operators (03C80) Temporal logic (03B44)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Cores of effectivity functions and implementation theory
- Propositional dynamic logic of regular programs
- Game logic is strong enough for parity games
- Automata, logics, and infinite games. A guide to current research
- Complete axiomatization and decidability of alternating-time temporal logic
- Modal frame correspondences and fixed-points
- The variable hierarchy of the \(\mu\)-calculus is strict
- Alternating-time temporal logic
- Temporal Verification of Reactive Systems: Response
- One-unambiguous regular languages
This page was built for publication: Game Quantification Patterns