| Register
\(\newcommand{\Cat}{{\rm Cat}} \) \(\newcommand{\A}{\mathcal A} \) \(\newcommand{\freestar}{ \framebox[7pt]{$\star$} }\)

3. Continuous degrees of smooth equivalence relations

    1. Problem 3.1.

      What is the complexity of the theory of the smooth equivalence relations under continuous reducibility?
        • Problem 3.2.

          Does every $\Pi^0_1$ smooth equivalence relation on $\omega^\omega$ continuously reduce to $=^+$? Does every strictly ascending sequence has a supremum?

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