Pages that link to "Item:Q860411"

The following pages link to The first order definability of graphs: Upper bounds for quantifier depth (Q860411):

Displaying 13 items.

• Locality and modular Ehrenfeucht-Fraïssé games (Q420850) (← links)
• Two consequences of the dichotomy theorem on first order definability of graphs. (Q1776035) (← links)
• Succinct definitions in the first order theory of graphs (Q2368907) (← links)
• Decomposable graphs and definitions with no quantifier alternation (Q2461780) (← links)
• The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
• The limits of decidability for first order logic on CPDA graphs (Q2904796) (← links)
• First-order Definable Retraction Problems for Posets and Reflexive Graphs (Q3437257) (← links)
• First-Order Definability of Trees and Sparse Random Graphs (Q3438138) (← links)
• The Complexity of Defining a Relation on a Finite Graph (Q3778739) (← links)
• Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884) (← links)
• The Weisfeiler-Leman algorithm and recognition of graph properties (Q5925529) (← links)
• Segment transit function of the induced path function of graphs and its first-order definability (Q6132572) (← links)
• Combinatorial games on Galton-Watson trees involving several-generation-jump moves (Q6547218) (← links)