Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Descriptive Complexity for Counting Complexity Classes   Descriptive Complexity has been very successful in characterizing complexity
classes of decision problems in terms of the properties definable in some
logics. However, descriptive complexity for counting complexity classes, such
as FP and #P, has not been systematically studied, and it is not as developed
as its decision counterpart. In this paper, we propose a framework based on
Weighted Logics to address this issue. Specifically, by focusing on the natural
numbers we obtain a logic called Quantitative Second Order Logics (QSO), and
show how some of its fragments can be used to capture fundamental counting
complexity classes such as FP, #P and FPSPACE, among others. We also use QSO to
define a hierarchy inside #P, identifying counting complexity classes with good
closure and approximation properties, and which admit natural complete
problems. Finally, we add recursion to QSO, and show how this extension
naturally captures lower counting complexity classes such as #L.

2
The categories of this paper are: math
17
The categories of this paper are: q-fin
14
The categories of this paper are: math-ph
12
The categories of this paper are: nucl-th
25
The categories of this paper are: patt-sol
6
The categories of this paper are: astro-ph
35
The categories of this paper are: mtrl-th
19
The categories of this paper are: eess
3
The categories of this paper are: physics
7
The categories of this paper are: hep-th
37
The categories of this paper are: supr-con
29
The categories of this paper are: funct-an
15
The categories of this paper are: nucl-ex
23
The categories of this paper are: solv-int
5
The categories of this paper are: gr-qc
13
The categories of this paper are: quant-ph