Separable Algorithmic Representations of Classical Systems and their Applications

The main results of the theory of separable algorithmic representations of classical algebraic systems are presented. The most important classes of such systems and their representations in the lower classes of the arithmetic hierarchy — positive and negative — are described. Special attention is paid to the algorithmic, structural and topological properties of separable representations of groups, rings and bodies, as well as to effective analogs of the Maltsev theorem on embedding rings into bodies. The possibilities of using the studied concepts in the framework of theoretical informatics are considered.