Algorithmic problems for differential polynomial algebras
arXiv:1509.07230
Abstract
We prove that the ideal membership problem and the subalgebra membership problem are algorithmically undecidable for differential polynomial algebras with at least two basic derivation operators.
arXiv comment12 pages