Reducibilities among equivalence relations induced by recursively enumerable structures.
Theoretical Computer Science(2016)
摘要
In this paper we investigate the dependence of recursively enumerable structures on the equality relation which is fixed to a specific r.e. equivalence relation. We compare r.e. equivalence relations on the natural numbers with respect to the amount of structures they permit to represent from a given class of structures such as algebras, permutations and linear orders. In particular, we show that for various types of structures represented, there are minimal and maximal elements.
更多查看译文
关键词
Recursively enumerable equivalence classes,Algebraic structures,Reducibilities,Degrees,Realisability
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络