Loading Web-Font TeX/Main/Regular
| Register
\newcommand{\Cat}{{\rm Cat}} \newcommand{\A}{\mathcal A} \newcommand{\freestar}{ \framebox[7pt]{$\star$} }

2. Theory of (D,\le)

    1. Problem 2.1.

      What is the complexity of the theory of the Borel equivalence relation under Borel reducibility?

          Cite this as: AimPL: Invariant descriptive computability theory, available at http://aimpl.org/invdesccomp.