|
|
|
Publications in Math-Net.Ru |
Citations |
|
1997 |
| 1. |
A. I. Serebryanyi, “Definability of the set of all true propositions of arithmetic by passage to the limit”, Uspekhi Mat. Nauk, 52:2(314) (1997), 185–186    ; Russian Math. Surveys, 52:2 (1997), 422–423   |
1
|
|
1965 |
| 2. |
A. I. Serebryanyi, “On events representable in finite automata”, Uspekhi Mat. Nauk, 20:2(122) (1965), 203–206 |
|
1964 |
| 3. |
A. I. Serebryanyi, “The position of a command following after a command with a random time of fulfilment for optimal programming”, Zh. Vychisl. Mat. Mat. Fiz., 4:6 (1964), 1131–1134 ; U.S.S.R. Comput. Math. Math. Phys., 4:6 (1964), 222–227 |
|
Contact us: