RUS  ENG
Full version
JOURNALS // Chebyshevskii Sbornik // Archive

Chebyshevskii Sb., 2022 Volume 23, Issue 2, Pages 121–150 (Mi cheb1181)

This article is cited in 2 papers

On the papers of O. M. Kasim-Zade in field of complexity theory and theory of multivalued logics

V. V. Kochergin

Lomonosov Moscow State University (Moscow)

Abstract: The paper is an attempt both to give an overview of the results of O M Kasim-Zade, the largest specialist in discrete mathematics and mathematical cybernetics, and to understand his scientific legacy in fields such as research measures the circuit complexity of Boolean functions related to the operation of the circuits, the problems of implicit and parametric expressibility in finite-valued logics, the questions of the depth and the complexity of Boolean functions and functions of multivalued logics in infinite bases.

Keywords: circuits complexity, actiyvity, power, depth, infinite basis, implicit expressibility parametric expressibility.

UDC: 519.71

Received: 08.12.2021
Accepted: 22.06.2022

DOI: 10.22405/2226-8383-2022-23-2-121-150



© Steklov Math. Inst. of RAS, 2025