Abstract
We investigate properties of propositional modal logic over the class of finite structures. In particular, we show that certain known preservation theorems remain true over this class. We prove that a class of finite models is defined by a first-order sentence and closed under bisimulations if and only if it is definable by a modal formula. We also prove that a class of finite models defined by a modal formula is closed under extensions if and only if it is defined by a ♦-modal formula.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
