|
|
Publications in Math-Net.Ru |
Citations |
|
1993 |
1. |
Yu. V. Gavrilenko, “The structure of grounded congruences and the unification of
infinite systems of equations in terms”, Dokl. Akad. Nauk, 329:2 (1993), 128–131 ; Dokl. Math., 47:2 (1993), 196–200 |
|
1992 |
2. |
Yu. V. Gavrilenko, “Congruences on terms and properties of dependence relations
between variables”, Dokl. Akad. Nauk, 323:3 (1992), 389–393 ; Dokl. Math., 45:2 (1992), 338–342 |
|
1991 |
3. |
Yu. V. Gavrilenko, “The structure of principal logical computations and the expansion
of idempotents”, Dokl. Akad. Nauk SSSR, 318:4 (1991), 789–793 ; Dokl. Math., 43:3 (1991), 752–756 |
4. |
Yu. V. Gavrilenko, “Majorants of logic evaluations. Lifting and lowering lemmas in
logic programming”, Dokl. Akad. Nauk SSSR, 318:3 (1991), 528–532 ; Dokl. Math., 43:3 (1991), 716–720 |
5. |
Yu. V. Gavrilenko, “Correct classes of computations in logic programming”, Dokl. Akad. Nauk SSSR, 317:3 (1991), 535–539 ; Dokl. Math., 43:2 (1991), 422–426 |
|
1990 |
6. |
Yu. V. Gavrilenko, “Primitive recursion on finitely decomposable Cooper algebras”, Dokl. Akad. Nauk SSSR, 313:4 (1990), 782–786 ; Dokl. Math., 42:1 (1991), 63–67 |
7. |
Yu. V. Gavrilenko, “Applications of Cooper algebras to the theory of tail recursion in
logic programming”, Dokl. Akad. Nauk SSSR, 312:5 (1990), 1033–1037 ; Dokl. Math., 41:3 (1990), 501–505 |
8. |
Yu. V. Gavrilenko, “Recursion and iteration on Cooper algebras”, Dokl. Akad. Nauk SSSR, 312:2 (1990), 265–269 ; Dokl. Math., 41:3 (1990), 425–429 |
|
1989 |
9. |
Yu. V. Gavrilenko, “Principal solutions and automorphism groups of systems of
equations in terms”, Dokl. Akad. Nauk SSSR, 309:3 (1989), 524–528 ; Dokl. Math., 40:3 (1990), 529–533 |
|
1984 |
10. |
Yu. V. Gavrilenko, “Monotonic theories of feasible numbers”, Dokl. Akad. Nauk SSSR, 276:1 (1984), 18–22 |
1
|
|
1981 |
11. |
Yu. V. Gavrilenko, “Recursive realizability from the intuitionistic point of view”, Dokl. Akad. Nauk SSSR, 256:1 (1981), 18–22 |
|
Organisations |
|
|
|
|