Pages that link to "Item:Q360052"
From MaRDI portal
The following pages link to On the succinctness of some modal logics (Q360052):
Displaying 11 items.
- Expressive power and succinctness of the positive calculus of binary relations (Q2141281) (← links)
- Two remarks on strictly implicative formulas in modal logic S3 (Q2751815) (← links)
- On the size of shortest modal descriptions (Q2904050) (← links)
- The succinctness of the cover modality (Q4586149) (← links)
- The Succinctness of First-order Logic over Modal Logic via a Formula Size Game (Q4636046) (← links)
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence (Q5060192) (← links)
- Formula size games for modal logic and μ-calculus (Q5216339) (← links)
- (Q5232899) (← links)
- A public announcement separation logic (Q5377700) (← links)
- Succinctness in subsystems of the spatial mu-calculus (Q6290036) (← links)
- Computationally hard problems for logic programs under answer set semantics (Q6636616) (← links)