Refinement modal logic

DOI10.1016/j.ic.2014.07.013zbMath1309.68175arXiv1202.3538OpenAlexW2073942343MaRDI QIDQ476194

Laura Bozzelli, Sophie Pinchinat, Tim French, James Hales, Hans P. van Ditmarsch

Publication date: 28 November 2014

Published in: Information and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27)

Related Items

The undecidability of quantified announcements, Logics with group announcements and distributed knowledge: completeness and expressive power, Arbitrary arrow update logic, The undecidability of arbitrary arrow update logic, Propositional quantification in logics of contingency, To be announced, Arbitrary public announcement logic with memory, Unnamed Item, Arrow update synthesis, Coalition and relativised group announcement logic, Refining strategic ability in alternating-time temporal logic, Recapturing dynamic logic of relation changers via bounded morphisms, Positive announcements

Uses Software

• Z

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
• An axiomatization of bisimulation quantifiers via the \(\mu\)-calculus
• Modal specifications for the control theory of discrete event systems
• The complementation problem for Büchi automata with applications to temporal logic
• On the control of discrete-event dynamical systems
• Reasoning about information change
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Module checking
• The undecidability of iterated modal relativization
• Refinement Quantified Logics of Knowledge
• A Modal Interface Theory for Component-based Design
• Quantifying Notes
• The Complexity of One-Agent Refinement Modal Logic
• An Alternative Logic for Knowability
• A Note on Bisimulation Quantifiers and Fixed Points over Transitive Frames
• Automata for the modal μ-calculus and related results
• ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’
• Dynamic Epistemic Logic and Knowledge Puzzles
• Simulation and Information: Quantifying over Epistemic Events
• Expressivity and completeness for public update logics via reduction axioms
• Propositional quantifiers in modal logic1
• Infinite Games
• Memoryless Determinacy of Parity Games
• DEL-sequents for regression and epistemic planning
• Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
• Arbitrary Action Model Logic and Action Model Synthesis
• Mathematical Foundations of Computer Science 2003
• Mechanizing Mathematical Reasoning
• Modal I/O Automata for Interface and Product Line Theories
• Rudiments of \(\mu\)-calculus
• On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic