Pages that link to "Item:Q5267432"
From MaRDI portal
The following pages link to An <i>n</i> ! lower bound on formula size (Q5267432):
Displayed 10 items.
- On the succinctness of some modal logics (Q360052) (← links)
- A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL (Q975478) (← links)
- Expressive power and succinctness of the positive calculus of binary relations (Q2141281) (← links)
- On FO 2 Quantifier Alternation over Words (Q3182951) (← links)
- Games for Temporal Logics on Trees (Q3602814) (← links)
- The succinctness of the cover modality (Q4586149) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence (Q5060192) (← links)
- (Q5232899) (← links)
- On the complexity of existential positive queries (Q5410336) (← links)