Title of article
and equivalence structures
Author/Authors
Cenzer، نويسنده , , Douglas and Harizanov، نويسنده , , Valentina and Remmel، نويسنده , , Jeffrey B.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
14
From page
490
To page
503
Abstract
We study computability theoretic properties of Σ 1 0 and Π 1 0 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 Σ 1 0 equivalence structures and between Π 1 0 equivalence structures.
Keywords
computability theory , Equivalence structures , Effective categoricity , Computable model theory
Journal title
Annals of Pure and Applied Logic
Serial Year
2011
Journal title
Annals of Pure and Applied Logic
Record number
1444554
Link To Document