Vorobyov, Sergei Computational Biology and Applied Algorithmics, MPI for Informatics, Max Planck Society; Programming Logics, MPI for Informatics, Max Planck Society;
Vorobyov, S. (1998). $\forall\exists^\ast$-Equational Theory of Context Unification is $\Pi_1^0$-Hard. In L. Brim, J. Gruska, & J. Zlatuska (Eds.), Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS-98) (pp. 597-606). Berlin, Germany: Springer.