THE TYPE SET OF A VARIETY IS NOT COMPUTABLE

International journal of algebra and computation（2001）

引用 11|浏览2

暂无评分

摘要

Several problems involving the local structure of finite algebras are shown to be unsolvable by interpreting the halting problem of Turing machines. Specifically, these problems are to decide, given a finite algebra A, whether the type-set of the variety generated by A, which is a subset of {1,2,3,4,5}, omits 2, or 3, or 4, or 5, respectively.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要