Completeness of the hyperarithmetic isomorphism equivalence relation (Q2143655)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Completeness of the hyperarithmetic isomorphism equivalence relation |
scientific article |
Statements
Completeness of the hyperarithmetic isomorphism equivalence relation (English)
0 references
31 May 2022
0 references
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.
0 references
hyperarithmetic isomorphism
0 references
true stages, equivalence relations
0 references