The following pages link to (Q3666827):
Displaying 21 items.
- Probabilities of First-Order Sentences about Unary Functions (Q3041164) (← links)
- Efficient First-Order Model-Checking Using Short Labels (Q3507329) (← links)
- Convergence in homogeneous random graphs (Q4845076) (← links)
- (Q5002820) (← links)
- On the Ehrenfeucht-Fraïssé game in theoretical computer science (Q5044763) (← links)
- (Q5091133) (← links)
- (Q5094135) (← links)
- Iterating on multiple collections in synchrony (Q5101923) (← links)
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth (Q5108706) (← links)
- Infinitary logic for computer science (Q5204339) (← links)
- EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES (Q5222519) (← links)
- Conversation and Games (Q5224486) (← links)
- Parametrised Complexity of Satisfiability in Temporal Logic (Q5278205) (← links)
- First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
- (Q5874521) (← links)
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic (Q6104378) (← links)
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes (Q6135763) (← links)
- On testability of first-order properties in bounded-degree graphs and connections to proximity-oblivious testing (Q6573776) (← links)
- When locality meets preservation (Q6649481) (← links)
- Model checking on interpretations of classes of bounded local cliquewidth (Q6649489) (← links)
