In this talk we show a different way of proving such theorems: we convert the hypotheses and conclusion into polynomials and prove their dependency. This kind of computation is very difficult, but we can use a Computer Algebra System such as CoCoA to perform the necessary operations on polynomial ideals.

This approach is not a trivial solution to our problem: some theorems will turn out to be false! In some cases we shall find the missing hypotheses, and in others we shall have to conclude that the theorem is "algebraically false".