On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas
We study the complexity of equivalence and isomorphism on primitive positive formulas with respect to a given structure. We study these problems for various fixed structures; we present generic hardness and complexity class containment results, and give classification theorems for the case of two-element (boolean) structures.
equivalence isomorphism primitive positive formulas computational complexity clones