RUS  ENG
Full version
PEOPLE

Yablonskii Sergei Vsevolodovich

Publications in Math-Net.Ru

  1. Lower cardinality bounds for the complexity of realization of functions in $P_k$ by schemes consisting of functional elements in an arbitrary basis

    Diskr. Mat., 6:4 (1994),  3–9
  2. The structure of the upper neighborhood for predicate-describable classes in $P_k$

    Dokl. Akad. Nauk SSSR, 218:2 (1974),  304–307
  3. The construction of irredundant multiple experiments for automata

    Trudy Mat. Inst. Steklov., 133 (1973),  263–272
  4. Certain properties of nondegenerate superpositions in $P_k$

    Mat. Zametki, 12:1 (1972),  3–12
  5. Precomplete classes in $k$-valued logics

    Dokl. Akad. Nauk SSSR, 186:3 (1969),  509–512
  6. On the synthesis of self-correcting relay circuits

    Dokl. Akad. Nauk SSSR, 134:3 (1960),  544–547
  7. A device for the investigation of street-traffic control algorithms

    Dokl. Akad. Nauk SSSR, 132:1 (1960),  78–81
  8. On limit logics

    Dokl. Akad. Nauk SSSR, 118:4 (1958),  657–660
  9. Logical methods of control of work of electric schemes

    Trudy Mat. Inst. Steklov., 51 (1958),  270–360
  10. Functional constructions in a $k$-valued logic

    Trudy Mat. Inst. Steklov., 51 (1958),  5–142
  11. On classes of functions of the algebra of logic admitting a simple schematic realization

    Uspekhi Mat. Nauk, 12:6(78) (1957),  189–196
  12. On superpositions of functions of the algebra of logic

    Mat. Sb. (N.S.), 30(72):2 (1952),  329–348

  13. Поправки к статье "О предполных классах в $k$-значных логиках" (ДАН, т. 186, № 3, 1969)

    Dokl. Akad. Nauk SSSR, 199:1 (1971),  90
  14. Preface

    Trudy Mat. Inst. Steklov., 51 (1958),  3


© Steklov Math. Inst. of RAS, 2024