Article

Separable Algorithmic Representations of Classical Systems and Their Applications

N. Kh. KasymovNational University of Uzbekistan named after M. UlugbekR. N. DadazhanovNational University of Uzbekistan named after M. UlugbekF. N. IbragimovNational University of Uzbekistan named after M. Ulugbek

Contemporary Mathematics Fundamental Directionsjournal2021en

ABI

Abstract

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 in bodies. The possibilities of using the studied concepts in the framework of theoretical informatics are considered.

Topics

Advanced Data Processing Techniques Artificial Intelligence in Education Cognitive Computing and Networks

Identifiers

DOI: 10.22363/2413-3639-2021-67-4-707-754

Citations and references

Cited by 3 10 references

Metrics — AkademScholar · Coming soon