3 citations · 5 across the 6 of their papers we have counts for
Showing 2004 · math.LOShow all
2 papers · 2 filters
math.LO2004
Definitions with no quantifier alternation
Oleg Pikhurko, Joel Spencer, Oleg Verbitsky
Let be the minimum quantifier depth of a first order sentence that defines a graph up to isomorphism. Let be the version of where we do not allow qua…
math.LO2004
Succinct Definitions in the First Order Theory of Graphs
Oleg Pikhurko, Joel Spencer, Oleg Verbitsky
We say that a first order sentence A defines a graph G if A is true on G but false on any graph non-isomorphic to G. Let L(G) (resp. D(G)) denote the minimum length (resp. quantifi…