A complete equational axiomatisation of partial differentiation

06/11/2020

∙

by   Gordon D. Plotkin, et al.

∙

0

∙

share

We formalise the well-known rules of partial differentiation in a version of equational logic with function variables and binding constructs. We prove the resulting theory is complete with respect to polynomial interpretations. The proof makes use of Severi's interpolation theorem that all multivariate Hermite problems are solvable. We also present a number of related results, such as decidability and equational completeness.