(2025)
This paper explores relational structures in modal logic, particularly focusing on the concept of proper relational structures. A relational structure for a propositional modal language L_n is defined as a tuple involving a set, binary relations, and a valuation. The authors demonstrate that properness is not a restrictive condition by showing that every relational structure is equivalent to a proper relational structure via bisimulation. The discussion includes constructions for finite, countable, and continuum-sized models and addresses properties preserved through the translation of these models, emphasizing the role of properness in the context of simplicial semantics used for epistemic logic.
This paper employs the following methods:
The following datasets were used in this research:
The authors identified the following limitations: