Invariant Continuation of Discrete Multi-Valued Functions and Their Implementation

The article discusses partially defined discrete functions and investigates the problem of logical continuation of such functions in the class of canonical normal forms. A theorem is proved on the invariant continuation of a multivalued function in the class of canonical forms, which does not depend on the adopted coding. An algorithm for constructing a set of invariant points independent of the adopted encoding and software for such an invariant continuation are constructed.