Effective categoricity of equivalence Structures
| dc.creator | Calvert, W. | |
| dc.creator | Cenzer, D. | |
| dc.creator | Harizanov, V. S. | |
| dc.creator | Morozov, A. | |
| dc.date | 2008-05-13 | |
| dc.date.accessioned | 2026-07-07T09:38:38Z | |
| dc.date.available | 2026-07-07T09:38:38Z | |
| dc.description | An equivalence structure is a set with a single binary relation, satisfying sentences stating that the relation is an equivalence relation. A computable structure A is said to be $Δ^0_α$ categorical if for any computable structure B isomorphic to A there is a $Δ^0_α$ function witnessing that the two are isomorphic. The present paper gives an exact characterization of $Δ^0_α$ equivalence structures where $α= 1$ or $α\geq 3$. Extensive results for $α= 2$ are also given, and open cases are exhaustively described. | |
| dc.description | Improved form published | |
| dc.identifier | https://arxiv.org/abs/0805.1887 | |
| dc.identifier | http://arxiv.org/abs/0805.1887 | |
| dc.identifier | Annals of Pure and Applied Logic 141 (2006) 61--78 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/160877 | |
| dc.subject | Logic | |
| dc.subject | 03D45; 03C57 | |
| dc.title | Effective categoricity of equivalence Structures | |
| dc.type | text |