Pages that link to "Item:Q5224566"
From MaRDI portal
The following pages link to On the complexity of modal separation logics (Q5224566):
Displaying 20 items.
- Reasoning about sequences of memory states (Q636268) (← links)
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic (Q1855229) (← links)
- Verification of dynamic bisimulation theorems in Coq (Q2035655) (← links)
- On the complexity of graded modal logics with converse (Q2296751) (← links)
- On the relative complexity of labelled modal tableaux (Q2843911) (← links)
- On the size of shortest modal descriptions (Q2904050) (← links)
- Undecidability of Propositional Separation Logic and Its Neighbours (Q3189649) (← links)
- Inf-datalog, Modal Logic and Complexities (Q3549285) (← links)
- Complexity Results for Modal Dependence Logic (Q3586056) (← links)
- (Q4364506) (← links)
- (Q4599212) (← links)
- Decidability and complexity of fibred logics without shared connectives (Q4644566) (← links)
- On Temporal and Separation Logics (Q5079764) (← links)
- Modal Logics with Composition on Finite Forests (Q5145629) (← links)
- The power of modal separation logics (Q5216335) (← links)
- Copy and remove as dynamic operators (Q5861999) (← links)
- The Complexity of Decomposing Modal and First-Order Theories (Q5892176) (← links)
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5918962) (← links)
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5925549) (← links)
- An undecidability result for separation logic with theory reasoning (Q6161426) (← links)
