The existence of a near-unanimity function is decidable
Abstract
We prove that the following problem is decidable: given a finite set of relations, decide whether this set admits a near-unanimity function.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.