Abstract

We consider a concept of substitutive structure, called “logos”, in order to study simple substitution, independently of formal or programming languages. We provide a definition of simultaneous substitution in an arbitrary logos and use it to prove a completeness theorem expressing that the equational properties of the usual substitution can be proved from the logos axioms only