Pages that link to "Item:Q791548"

The following pages link to On the definability of properties of finite graphs (Q791548):

Displaying 19 items.

• Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic (Q598270) (← links)
• Finite-model theory -- A personal perspective (Q688663) (← links)
• On winning strategies in Ehrenfeucht-Fraïssé games (Q1269907) (← links)
• The closure of monadic NP (Q1577017) (← links)
• Two consequences of the dichotomy theorem on first order definability of graphs. (Q1776035) (← links)
• Arity and alternation in second-order logic (Q1919768) (← links)
• Annotation theories over finite graphs (Q2269516) (← links)
• Succinct definitions in the first order theory of graphs (Q2368907) (← links)
• On winning strategies with unary quantifiers (Q2785670) (← links)
• Properties of Almost All Graphs and Generalized Quantifiers (Q3561218) (← links)
• The Complexity of Defining a Relation on a Finite Graph (Q3778739) (← links)
• Second-order and Inductive Definability on Finite Structures (Q3797174) (← links)
• AN ALTERNATIVE WAY OF DEFINING FINITE GRAPHS (Q5150703) (← links)
• Expressing properties in second- and third-order logic: hypercube graphs and SATQBF (Q5176677) (← links)
• Context-Free Graph Properties via Definable Decompositions (Q5278403) (← links)
• (Q5746636) (← links)
• Some Remarks on Definability of Process Graphs (Q5756607) (← links)
• The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)
• First-order logic axiomatization of metric graph theory (Q6196830) (← links)