Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the logical complexity of convex polygon dissections   The logical depth of a graph $G$ is the minimum quantifier depth of a first
order sentence defining $G$ up to isomorphism in the language of the adjacency
and the equality relations. We consider the case that $G$ is a dissection of a
convex polygon or, equivalently, a biconnected outerplanar graph. We bound the
logical depth of a such $G$ from above by a function of combinatorial
parameters of the dual tree of $G$.

9
The categories of this paper are: nlin
0
The categories of this paper are: hep-ph
7
The categories of this paper are: hep-th
29
The categories of this paper are: funct-an
13
The categories of this paper are: quant-ph
23
The categories of this paper are: solv-int
24
The categories of this paper are: dg-ga
1
The categories of this paper are: cs
26
The categories of this paper are: bayes-an
32
The categories of this paper are: atom-ph
14
The categories of this paper are: math-ph
27
The categories of this paper are: comp-gas
18
The categories of this paper are: econ
12
The categories of this paper are: nucl-th
5
The categories of this paper are: gr-qc
6
The categories of this paper are: astro-ph