Completeness of the hyperarithmetic isomorphism equivalence relation (Q2143655): Difference between revisions

The authors investigate the complexity of the existence of effective Borel isomorphisms between computable structures and prove that the hyperarithmetic isomorphism on computable structures is computably complete for equivalence relations \(\Pi^1_1\) on \(\mathbb{N}\). This uses Montalban's true stages machinery for iterated priority arguments, of which they give a new development.