Σ10 and Π10 equivalence structures
Annals of Pure and Applied Logic(2011)
摘要
We study computability theoretic properties of Σ10 and Π10 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 Σ10 equivalence structures and between Π10 equivalence structures.
更多查看译文
关键词
03C57,03D45
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要