Non-commutative Gröbner bases in algebras of solvable type

Apel, 1988, An extension of Buchberger's algorithm and calculations in enveloping fields of Lie Algebras, J. Symbolic Comp., 6, 361, 10.1016/S0747-7171(88)80053-1 Bergmann, 1978, The diamond lemma in ring theory, Adv. Math., 29, 178, 10.1016/0001-8708(78)90010-5 Boone, 1959, The word problem, Ann. Math., 70, 207, 10.2307/1970103 Buchberger, 1976, Some properties of Gröbner bases for polynomial ideals, ACM SIGSAM Bull., 10, 19, 10.1145/1088222.1088224 Buchberger, 1985, Gröbner bases: an algorithmic method in polynomial ideal theory Dickson, 1913, Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors, Amer. J. Math., 35, 413, 10.2307/2370405 Dixmier, 1974 Eilenberg, 1969, Rational sets in commutative monoids, J. Algebra, 13, 173, 10.1016/0021-8693(69)90070-2 El From, 1983, Sur les algèbres de type résoluble Galligo, 1985, Some algorithmic questions on ideals of differential operators, 204, 413 Gebauer, 1983 Huet, 1980, Confluent reductions: Abstract properties and applications to term rewriting systems, J. ACM, 27, 797, 10.1145/322217.322230 Jacobson, 1962 Kandri-Rody, 1984, Algorithms for computing the Gröbner bases of polynomial ideals over various Euclidean rings, 174, 195 Kandri-Rody, 1984, An algorithm for computing the Gröbner basis of a polynomial ideal over a Euclidean ring, GECRD Report 84CRD045 Kandri-Rody, 1988, An algorithm for computing the Gröbner basis of a polynomial ideal over a Euclidean ring, J. Symb. Comp., 6, 37, 10.1016/S0747-7171(88)80020-8 Lassner, 1985, Symbol representation of non-commutative algebras, 204, 99 Lesieur, 1978, Conditions Noéthériennes dans l'anneau de polynomes de Ore A[X, σ, δ], Séminaire d'algèbre P. Dubreil, Paris 1977–78, Springer LNM, 641, 220 Mayr, 1982, The complexity of the word problem for commutative semigroups and polynomial ideals, Adv. Math., 46, 305, 10.1016/0001-8708(82)90048-2 Mora, 1986, Gröbner bases for non-commutative polynomial rings, 229, 353 Ore, 1933, Theory of non-commutative polynomials, Ann. Math., 34, 480, 10.2307/1968173 van der Waerden, 1967 Weispfenning, 1988, Constructing universal Gröbner bases, 356, 408 Winkler, 1985, An algorithm for constructing canonical bases of polynomial ideals, ACM/TOMS, 11, 66