6 citations · 20 across the 15 of their papers we have counts for
Showing math.LOShow all
3 papers · 1 filter
math.LO2019
Deciding the existence of minority terms
Alexandr Kazda, Jakub Opršal, Matt Valeriote +1
This paper investigates the computational complexity of deciding if a given finite idempotent algebra has a ternary term operation that satisfies the minority equations $m(y,x,…
math.LO2018
The number of clones determined by disjunctions of unary relations
Mike Behrisch, Edith Vargas-García, Dmitriy Zhuk
We consider finitary relations (also known as crosses) that are definable via finite disjunctions of unary relations, i.e. subsets, taken from a fixed finite parameter set . We…
math.LO2011
The existence of a near-unanimity function is decidable
Dmitriy Zhuk
We prove that the following problem is decidable: given a finite set of relations, decide whether this set admits a near-unanimity function.