Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Computable Component-wise Reducibility   We consider equivalence relations and preorders complete for various levels
of the arithmetical hierarchy under computable, component-wise reducibility. We
show that implication in first order logic is a complete preorder for $\SI 1$,
the $\le^P_m$ relation on EXPTIME sets for $\SI 2$ and the embeddability of
computable subgroups of $(\QQ,+)$ for $\SI 3$. In all cases, the symmetric
fragment of the preorder is complete for equivalence relations on the same
level. We present a characterisation of $\PI 1$ equivalence relations which
allows us to establish that equality of polynomial time functions and inclusion
of polynomial time sets are complete for $\PI 1$ equivalence relations and
preorders respectively. We also show that this is the limit of the enquiry: for
$n\geq 2$ there are no $\PI n$ nor $\DE n$-complete equivalence relations.

18
The categories of this paper are: econ
8
The categories of this paper are: hep-ex
14
The categories of this paper are: math-ph
22
The categories of this paper are: chao-dyn
30
The categories of this paper are: q-alg
0
The categories of this paper are: hep-ph
32
The categories of this paper are: atom-ph
25
The categories of this paper are: patt-sol
6
The categories of this paper are: astro-ph
34
The categories of this paper are: chem-ph
24
The categories of this paper are: dg-ga
19
The categories of this paper are: eess
27
The categories of this paper are: comp-gas
37
The categories of this paper are: supr-con
20
The categories of this paper are: acc-phys
21
The categories of this paper are: adap-org