The following pages link to (Q3230355):
Displayed 22 items.
- Inherent complexity of recursive queries (Q696953) (← links)
- Invariance under stuttering in a temporal logic of actions (Q859839) (← links)
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory (Q870360) (← links)
- Computational complexity of determining which statements about causality hold in different space-time models (Q949614) (← links)
- Ramsey properties for classes of relational systems (Q1076045) (← links)
- A group-theoretical invariant for elementary equivalence and its role in representations of elementary classes (Q1162504) (← links)
- The primal framework. II: Smoothness (Q1182429) (← links)
- Infinitary logics and 0-1 laws (Q1193591) (← links)
- On winning strategies in Ehrenfeucht-Fraïssé games (Q1269907) (← links)
- Counting quantifiers, successor relations, and logarithmic space (Q1362332) (← links)
- Local properties of query languages (Q1575140) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Finite information logic (Q1779313) (← links)
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic (Q1854353) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- On winning Ehrenfeucht games and monadic NP (Q1919539) (← links)
- Succinct definitions in the first order theory of graphs (Q2368907) (← links)
- Decomposable graphs and definitions with no quantifier alternation (Q2461780) (← links)
- Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes (Q2540894) (← links)
- The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
- (Q3265664) (← links)
- An undecidable linear order that is \(n\)-decidable for all \(n\) (Q5937834) (← links)