1 problem

Let $\Gamma$ be a constraint language. It has short pp-definitions if every $n$-ary relation pp-definable from $\Gamma$ is definable by a primitive positive formula whose length is…