Abstract. The main result is that for every recursively enumerable existential consistent theory (in the usual language of group theory), there exists a finitely presented SQ-univ...
Human beings share a common competence for generating relevant arguments. We therefore hypothesize the existence of a cognitive procedure that enables them to determine the content...
Abstract. We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...
A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and ...
A generative statistical model of dependency syntax is proposed based on 'l'csniSre's classical theory. It provides a stochastic formalization of the original model...