Abstract
Abstract We explain how propositional modal logics can be understood as subfragments of the two-variable fragment of first-order logic, in which the interpretation of a distinguished binary relation is subject to various semantic constraints, in particular, the properties of reflexivity, seriality, symmetry and transitivity. We introduce graded modal logic, which extends propositional modal logics (thus understood) with counting quantifiers. We determine the complexity of the satisfiability problems for modal logics and graded modal logics defined by all possible conjunctions of the semantic constraints just mentioned. We also characterize the expressive power of propositional modal logic and briefly consider some extensions contained within the two-variable fragment of first-order logic.
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.
