Score: 1

Modal Logic for Simulation, Refinement, and Mutual Ignorance

Published: November 27, 2025 | arXiv ID: 2511.22390v1

By: Hans van Ditmarsch , Tim French , Rustam Galimullin and more

Potential Business Impact:

Helps computers understand how much agents know.

Business Areas:
Simulation Software

Simulation and refinement are variations of the bisimulation relation, where in the former we keep only atoms and forth, and in the latter only atoms and back. Quantifying over simulations and refinements captures the effects of information change in a multi-agent system. In the case of quantification over refinements, we are looking at all the ways the agents in a system can become more informed. Similarly, in the case of quantification over simulations, we are dealing with all the ways the agents can become less informed, or in other words, could have been less informed, as we are at liberty how to interpret time in dynamic epistemic logic. While quantification over refinements has been well explored in the literature, quantification over simulations has received considerably less attention. In this paper, we explore the relationship between refinements and simulations. To this end, we also employ the notion of mutual factual ignorance that allows us to capture the state of a model before agents have learnt any factual information. In particular, we consider the extensions of multi-modal logic with the simulation and refinement modalities, as well as modalities for mutual factual ignorance. We provide reduction-based axiomatizations for several of the resulting logics that are built extending one another in a modular fashion.

Country of Origin
🇦🇺 🇳🇴 Norway, Australia

Page Count
20 pages

Category
Computer Science:
Logic in Computer Science