A decidable algorithm for inclusion of quasi-algebraic varieties
Jimin Wang · Journal of Lanzhou University · 2002
The problem of deciding inclusion of quasi-algebraic varieties can not be determined by computing their saturated ideals respectively.In this paper by applying some equivalent formulas in first-order logic,this problem is transformed into one which checks whether another quasi-algebraic variety is empty.Thus it can be solved by Grebner bases method.An decidable algorithm and a computational example are given here.