In this paper we present an automated proof for the confluence of a rewrite system for integro-differential operators (given in Table 1). We also outline a generic prototype implementation of the integro-differential polynomials—the key tool for this proof—realized using the Theorema system. With its generic functor mechanism—detailed in Section 2—we are able to provide a formalization of the theory of integrodifferential

Abstract. Archives are implemented as an extension of Theorema for representing mathematical repositories in a natural way. An archive can be conceived as one large formula in a language consisting of higher-order predicate logic together with a few constructs for structuring knowledge: attaching labels to subhierarchies, disambiguating symbols by the use of namespaces, importing symbols from other namespaces and specifying the domains of categories and functors as namespaces with variable operations. All these constructs are logic-internal in the sense that they have a natural translation to higher-order logic so that certain aspects of Mathematical Knowledge Management can be realized in the object logic itself. There are a variety of operations on archives, though in this paper we can only sketch a few of them: knowledge retrieval and theory exploration, merging and splitting, insertion and translation to predicate logic.

Integro-differential polynomials are a novel generalization of the well-known differential polynomials extensively used in differential algebra [17]. They were introduced in [29] as a kind of universal extensions of integro-differential algebras and have recently been applied in a confluence proof [34] for the rewrite system

Abstract not found