Name
Abstract | ||
|---|---|---|
The hybrid logic $${\mathcal{H}(@,\downarrow)}$$ and the independence friendly modal logic IFML are compared for their expressive powers. We introduce a logic IFML c having a non-standard syntax and a compositional semantics; in terms of this logic a syntactic fragment of IFML is singled out, denoted IFML c . (In the Appendix it is shown that the game-theoretic semantics of IFML c coincides with the compositional semantics of IFML c .) The hybrid logic $${\mathcal{H}(@,\downarrow)}$$ is proven to be strictly more expressive than IFML c . By contrast, $${\mathcal{H}(@,\downarrow)}$$ and the full IFML are shown to be incomparable for their expressive powers. Building on earlier research (Tulenheimo and Sevenster 2006), a PSPACE-decidable fragment of the undecidable logic $${\mathcal{H}(@,\downarrow)}$$ is disclosed. This fragment is not translatable into the hybrid logic $${\mathcal{H}(@)}$$ and has not been studied previously in connection with hybrid logics. In the Appendix IFML c is shown to lack the property of `quasi-positionality' but proven to enjoy the weaker property of `bounded quasi-positionality'. The latter fact provides from the IFML internal perspective an account of what makes the compositional semantics of IFML c possible. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s10849-009-9092-y | Journal of Logic, Language and Information |
Keywords | Field | DocType |
Compositionality,Decidability,Expressive power,Game-theoretic semantics,Hybrid logic,Independence friendly logic,Modal logic | Principle of compositionality,Discrete mathematics,Hybrid logic,Independence-friendly logic,Decidability,Modal logic,Expressive power,Mathematics,Undecidable problem | Journal |
Volume | Issue | Citations |
18 | 4 | 2 |
PageRank | References | Authors |
0.40 | 16 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tero Tulenheimo | 1 | 16 | 5.19 |