We prove that the following problem is decidable: given a finite set of relations, decide whether this set admits a near-unanimity function.
生成讲解博客的中文版本
生成AI智能校验的中文版本