Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Title | Author(s) [non member] | Editor(s) [non member] | Year | Type | |
---|---|---|---|---|---|
$\forall\exists^5$-equational theory of context unification is undecidable In: Theoretical Computer Science [275], 463-479 | Vorobyov, Sergei | 2002 | Journal Article | ||
$\forall\exists^\ast$-Equational Theory of Context Unification is $\Pi_1^0$-Hard In: Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS-98), 597-606 | Vorobyov, Sergei | Brim, Lubos Gruska, Jozef Zlatuska, Jirí | 1998 | Proceedings Article |