We introduce a modal language L which is obtained from standard modal logic by adding the Boolean operators on accessibility relations, the identity relation, and the converse of relations. It is proved that L has the same expressive power as the two-variable fragment FO² of first-order logic, but speaks less succinctly about relational structures: if the number of relations is bounded, then L-satisfiability is EXPTIME-complete but FO² satisfiability is NEXPTIME-complete. We indicate that the relation between L and FO² provides a general framework for comparing modal and temporal languages with first-order languages.
Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:78985 |
Date | 24 May 2022 |
Creators | Lutz, Carsten, Sattler, Ulrike, Wolter, Frank |
Publisher | Aachen University of Technology |
Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
Language | English |
Detected Language | English |
Type | info:eu-repo/semantics/acceptedVersion, doc-type:report, info:eu-repo/semantics/report, doc-type:Text |
Rights | info:eu-repo/semantics/openAccess |
Relation | urn:nbn:de:bsz:14-qucosa2-785040, qucosa:78504 |
Page generated in 0.0013 seconds