1. Adams, W. W., Boyle, A., Loustaunau, P.: Transitivity for weak and strong Gröbner bases. J. Symb. Comp.15/1, 49?65 (1993)
2. Becker, T., Weispfenning, V., Kredel, H.: Gröbner Bases. A Computational Approach to Commutative Algebra. Graduate Texts in Mathematics. Berlin Heidelberg New York: Springer 1993
3. Buchberger, B.: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Glei-chungssystems. Aequ. Math.4/3, 374?383 (1970).
4. Gianni, P.: Properties of Gröbner bases under specializations. In: Davenport, J. H. (ed.) EUROCAL ?87, European Conference on Computer Algebra. Lecture Notes in Computer Science vol. 378, 293?297. Berlin Heidelberg New York: Springer 1987
5. Gianni, P., Trager, B., Zacharias, G.: Gröbner bases and primary decomposition of polynomial ideals. J. Symb. Comp.6/2, 3, 149?167 (1988)