Modal Logic for Simulation, Refinement, and Mutual Ignorance

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: van Ditmarsch, Hans, French, Tim, Galimullin, Rustam, Kuijer, Louwe B.
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909930662920192
author van Ditmarsch, Hans
French, Tim
Galimullin, Rustam
Kuijer, Louwe B.
author_facet van Ditmarsch, Hans
French, Tim
Galimullin, Rustam
Kuijer, Louwe B.
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2511_22390
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Modal Logic for Simulation, Refinement, and Mutual Ignorance
van Ditmarsch, Hans
French, Tim
Galimullin, Rustam
Kuijer, Louwe B.
Logic in Computer Science
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.
title Modal Logic for Simulation, Refinement, and Mutual Ignorance
topic Logic in Computer Science
url https://arxiv.org/abs/2511.22390