Succinct definitions in the first order theory of graphs

Oleg Pikhurko, Joel Spencer, Oleg Verbitsky

Research output: Contribution to journalArticle

Abstract

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. quantifier rank) of such a sentence. We define the succinctness function s(n) (resp. its variant q(n)) to be the minimum L(G) (resp. D(G) over all graphs on n vertices. We prove that s(n) and q(n) may bo so small that for no general recursive function f we can have f(s(n)) ≥ n for all n. However, for the function q*(n) = maxi≤n q(i), which is the least nondecreasing function bounding q(n) from above we have q* = (1 +o(1)) log* n, where log* n equals the minimum number of iterations of the binary logarithm sufficient to lower n to 1 or below. We show an upper bound q(n) < log* n + 5 even under the restriciton of the class of graphs to trees. Under this restriction, for q(n) we laso have a matching lower bound. We show a relationship D(G) ≥ (1 - o(1)) log* L(G) and prove, using the upper bound for q(n), that this relationship is tight. For a non-negative integer a, let Da(G) and qa(n) denote the analogs of D(G) and q(n) for defining formulas in the negation normal form with at most a quantifier alternations in any sequence of nested quantifiers. We show a superrecursive gap between D0(G) and D3(G) and hence between D0(G) and D(G). Despite this, for q0(n) we still have a kind of log-star upper bound: q0(n) ≤ 2 log* n + O(1) for definitely many n.

Original languageEnglish (US)
Pages (from-to)74-109
Number of pages36
JournalAnnals of Pure and Applied Logic
Volume139
Issue number1-3
DOIs
StatePublished - May 2006

Fingerprint

Quantifiers
First-order
Graph in graph theory
Upper bound
Denote
Q-function
Recursive Functions
Alternation
Logarithm
Normal Form
Star
Non-negative
Binary
Sufficient
Lower bound
Restriction
Analogue
Iteration
Integer
Relationships

Keywords

  • Definability
  • Finite graphs
  • First order logic
  • Turing machine simulation

ASJC Scopus subject areas

  • Logic

Cite this

Succinct definitions in the first order theory of graphs. / Pikhurko, Oleg; Spencer, Joel; Verbitsky, Oleg.

In: Annals of Pure and Applied Logic, Vol. 139, No. 1-3, 05.2006, p. 74-109.

Research output: Contribution to journalArticle

Pikhurko, Oleg ; Spencer, Joel ; Verbitsky, Oleg. / Succinct definitions in the first order theory of graphs. In: Annals of Pure and Applied Logic. 2006 ; Vol. 139, No. 1-3. pp. 74-109.
@article{77077efea226482c864918651f5da800,
title = "Succinct definitions in the first order theory of graphs",
abstract = "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. quantifier rank) of such a sentence. We define the succinctness function s(n) (resp. its variant q(n)) to be the minimum L(G) (resp. D(G) over all graphs on n vertices. We prove that s(n) and q(n) may bo so small that for no general recursive function f we can have f(s(n)) ≥ n for all n. However, for the function q*(n) = maxi≤n q(i), which is the least nondecreasing function bounding q(n) from above we have q* = (1 +o(1)) log* n, where log* n equals the minimum number of iterations of the binary logarithm sufficient to lower n to 1 or below. We show an upper bound q(n) < log* n + 5 even under the restriciton of the class of graphs to trees. Under this restriction, for q(n) we laso have a matching lower bound. We show a relationship D(G) ≥ (1 - o(1)) log* L(G) and prove, using the upper bound for q(n), that this relationship is tight. For a non-negative integer a, let Da(G) and qa(n) denote the analogs of D(G) and q(n) for defining formulas in the negation normal form with at most a quantifier alternations in any sequence of nested quantifiers. We show a superrecursive gap between D0(G) and D3(G) and hence between D0(G) and D(G). Despite this, for q0(n) we still have a kind of log-star upper bound: q0(n) ≤ 2 log* n + O(1) for definitely many n.",
keywords = "Definability, Finite graphs, First order logic, Turing machine simulation",
author = "Oleg Pikhurko and Joel Spencer and Oleg Verbitsky",
year = "2006",
month = "5",
doi = "10.1016/j.apal.2005.04.003",
language = "English (US)",
volume = "139",
pages = "74--109",
journal = "Annals of Pure and Applied Logic",
issn = "0168-0072",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Succinct definitions in the first order theory of graphs

AU - Pikhurko, Oleg

AU - Spencer, Joel

AU - Verbitsky, Oleg

PY - 2006/5

Y1 - 2006/5

N2 - 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. quantifier rank) of such a sentence. We define the succinctness function s(n) (resp. its variant q(n)) to be the minimum L(G) (resp. D(G) over all graphs on n vertices. We prove that s(n) and q(n) may bo so small that for no general recursive function f we can have f(s(n)) ≥ n for all n. However, for the function q*(n) = maxi≤n q(i), which is the least nondecreasing function bounding q(n) from above we have q* = (1 +o(1)) log* n, where log* n equals the minimum number of iterations of the binary logarithm sufficient to lower n to 1 or below. We show an upper bound q(n) < log* n + 5 even under the restriciton of the class of graphs to trees. Under this restriction, for q(n) we laso have a matching lower bound. We show a relationship D(G) ≥ (1 - o(1)) log* L(G) and prove, using the upper bound for q(n), that this relationship is tight. For a non-negative integer a, let Da(G) and qa(n) denote the analogs of D(G) and q(n) for defining formulas in the negation normal form with at most a quantifier alternations in any sequence of nested quantifiers. We show a superrecursive gap between D0(G) and D3(G) and hence between D0(G) and D(G). Despite this, for q0(n) we still have a kind of log-star upper bound: q0(n) ≤ 2 log* n + O(1) for definitely many n.

AB - 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. quantifier rank) of such a sentence. We define the succinctness function s(n) (resp. its variant q(n)) to be the minimum L(G) (resp. D(G) over all graphs on n vertices. We prove that s(n) and q(n) may bo so small that for no general recursive function f we can have f(s(n)) ≥ n for all n. However, for the function q*(n) = maxi≤n q(i), which is the least nondecreasing function bounding q(n) from above we have q* = (1 +o(1)) log* n, where log* n equals the minimum number of iterations of the binary logarithm sufficient to lower n to 1 or below. We show an upper bound q(n) < log* n + 5 even under the restriciton of the class of graphs to trees. Under this restriction, for q(n) we laso have a matching lower bound. We show a relationship D(G) ≥ (1 - o(1)) log* L(G) and prove, using the upper bound for q(n), that this relationship is tight. For a non-negative integer a, let Da(G) and qa(n) denote the analogs of D(G) and q(n) for defining formulas in the negation normal form with at most a quantifier alternations in any sequence of nested quantifiers. We show a superrecursive gap between D0(G) and D3(G) and hence between D0(G) and D(G). Despite this, for q0(n) we still have a kind of log-star upper bound: q0(n) ≤ 2 log* n + O(1) for definitely many n.

KW - Definability

KW - Finite graphs

KW - First order logic

KW - Turing machine simulation

UR - http://www.scopus.com/inward/record.url?scp=32644468567&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=32644468567&partnerID=8YFLogxK

U2 - 10.1016/j.apal.2005.04.003

DO - 10.1016/j.apal.2005.04.003

M3 - Article

VL - 139

SP - 74

EP - 109

JO - Annals of Pure and Applied Logic

JF - Annals of Pure and Applied Logic

SN - 0168-0072

IS - 1-3

ER -