| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662058 | Annals of Pure and Applied Logic | 2011 | 14 Pages |
Abstract
We study computability theoretic properties of and equivalence structures and how they differ from computable equivalence structures or equivalence structures that belong to the Ershov difference hierarchy. Our investigation includes the complexity of isomorphisms between equivalence structures and between equivalence structures.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
