Definition With R,X,W as Efficiently Recognizable Languages With R⊂X×W With X as the set of statements With W as the set of Witnesses We say x∈X is true if ∃w∈W,(x,w)∈R. Otherwise, it is false We call R an Effective Relation Examples Discrete Logarithm Language