Imperfect Information in Logic and Concurrent Games

DOI10.1007/978-3-642-38164-5_2zbMath1264.91031OpenAlexW124055994MaRDI QIDQ4922070

Pierre Clairambault, Glynn Winskel, Julian Gutierrez

Publication date: 28 May 2013

Published in: Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38164-5_2

zbMATH Keywords

IF logicconcurrent gamesevent structures

Mathematics Subject Classification ID

Applications of game theory (91A80) Other nonclassical logic (03B60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Alternating (in)dependence-friendly logic ⋮ Partial-order Boolean games: informational independence in a logic-based model of strategic interaction

Cites Work

• Petri nets, event structures and domains. I
• Game Semantics for Access Control
• The Winning Ways of Concurrent Games
• Alternating-time temporal logic
• Asynchronous Games: Innocence Without Alternation
• The determinacy of Blackwell games
• Compositional semantics for a language of imperfect information
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item