Degrees of undecidability in term rewriting

Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of undecidability, starting from the arithmetical hierarchy classifying properties using first order arithmetical formulas and continuing into the analytic hierarchy, where also quantification over function variables is allowed. In this paper we consider properties of first order term rewriting systems and classify them in this hierarchy. Most of the standard properties are ¿0/2-complete, that is, of the same level as uniform halting of Turing machines. In this paper we show two exceptions. Weak confluence is S0/1 -complete, and therefore essentially easier than ground weak confluence which is ¿0/2-complete. The most surprising result is on dependency pair problems: we prove this to be ¿1/1-complete, which means that this property exceeds the arithmetical hierarchy and is essentially analytic. A minor variant, dependency pair problems with minimality flag, turns out be ¿0/2-complete again, just like the original termination problem for which dependency pair analysis was developed.