Algorithmic problems for differential polynomial algebras

From MaRDI portal




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.



Cites work







This page was built for publication: Algorithmic problems for differential polynomial algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q267385)