Pages that link to "Item:Q5310637"
From MaRDI portal
The following pages link to The succinctness of first-order logic on linear orders (Q5310637):
Displayed 12 items.
- On the succinctness of some modal logics (Q360052) (← links)
- Expressive power and succinctness of the positive calculus of binary relations (Q2141281) (← links)
- On the Hybrid Extension of CTL and CTL + (Q3182944) (← links)
- On FO 2 Quantifier Alternation over Words (Q3182951) (← links)
- Logical Foundations of XML and XQuery (Q3638998) (← links)
- Model Checking FO(R) over One-Counter Processes and beyond (Q3644768) (← links)
- The succinctness of the cover modality (Q4586149) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)
- Expressive Power and Succinctness of the Positive Calculus of Relations (Q5098722) (← links)
- (Q5232899) (← links)
- On the complexity of existential positive queries (Q5410336) (← links)
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)