Good-for-Game QPTL: An Alternating Hodges Semantics

DOI10.1145/3565365OpenAlexW3153705421MaRDI QIDQ5875946

Massimo Benerecetti, Dylan Bellier, Fabio Mogavero, Dario Della Monica

Publication date: 7 February 2023

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.06085

zbMATH Keywords

realizabilityreactive synthesisstrategic reasoningquantified propositional temporal logicbehavioral quantificationscompositional and game-theoretical semanticsgood-for-game logicssatisfiability and model-checking

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (max. 100)

Alternating (in)dependence-friendly logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A double team semantics for generalized quantifiers
• Logic and games on automatic structures. Playing with quantifiers and decompositions
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• The strict determinateness of certain infinite games
• Strategy logic
• The complementation problem for Büchi automata with applications to temporal logic
• Henkin quantifiers and complete problems
• Automata-theoretic techniques for modal logics of programs
• The temporal semantics of concurrent programs
• Rational cooperation in the finitely repeated prisoners' dilemma
• Number of quantifiers is better than number of tape cells
• On the logic of informational independence and its applications
• Reexamination of the perfectness concept for equilibrium points in extensive games
• Borel determinacy
• Handbook of proof theory
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Algorithms for model checking HyperLTL and HyperCTL\(^*\)
• Definability hierarchies of generalized quantifiers
• Aspects of compositionality
• Automata, logics, and infinite games. A guide to current research
• Dependence and independence
• Dependences in strategy logic
• Iterated Boolean games
• Dependence Logic
• What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
• A Behavioral Hierarchy of Strategy Logic
• Quantified CTL: Expressiveness and Complexity
• Reasoning About Strategies
• Reasoning About Substructures and Games
• Dependences in Strategy Logic
• Strategy Logic
• Coordination Logic
• Solving Games Without Determinization
• A new approach to infinitary languages
• Quantifiers vs. Quantification Theory
• PARTIALLY ORDERED CONNECTIVES
• Reflection of Long Game Formulas
• Compositional semantics for a language of imperfect information
• The First-Order Logic of Hyperproperties
• Team semantics for the specification and verification of hyperproperties
• On the Boundary of Behavioral Strategies
• Substructure Temporal Logic
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
• Dialogspiele als Semantische Grundlage von Logikkalkülen
• Extensive Games
• Automata theory and its applications

This page was built for publication: Good-for-Game QPTL: An Alternating Hodges Semantics