Computational complexity of theories of a binary predicate with a small number of variables

We prove $\Sigma^0_1$-hardness of a number of theories of a binary predicate with three individual variables (in languages without constants or equality). We also show that, in languages with equality and the operators of composition and of transitive closure, theories of a binary predicate are $\Pi_1^1$-hard with only two individual variables.