|
|
|
Publications in Math-Net.Ru |
Citations |
|
2002 |
| 1. |
M. F. Raţă, “A formal reduction of the general problem of the expressibility of formulas in the Gödel-Löb provability logic”, Diskr. Mat., 14:2 (2002), 95–106    ; Discrete Math. Appl., 12:3 (2002), 279–290 |
|
2000 |
| 2. |
M. F. Raţă, A. G. Russu, “On some properties of systems, complete with respect to expressibility, of formulas in the Gödel–Löb provability logic”, Diskr. Mat., 12:4 (2000), 63–82 ; Discrete Math. Appl., 10:6 (2000), 553–570 |
|
1983 |
| 3. |
M. F. Raţă, “Unsolvability of the problem of functional expressibility in the modal logic $\mathrm{S}4$”, Dokl. Akad. Nauk SSSR, 268:4 (1983), 814–817 |
1
|
|
1982 |
| 4. |
M. F. Raţă, “Nontabularity of the logic ${\rm S}4$ with respect to
functional completeness”, Algebra Logika, 21:3 (1982), 283–320 |
2
|
|
1979 |
| 5. |
A. V. Kuznetsov, M. F. Raţă, “A criterion for functional completeness in classical first-order predicate logic”, Dokl. Akad. Nauk SSSR, 249:3 (1979), 540–544 |
1
|
|
1971 |
| 6. |
M. F. Raţă, “A criterion for functional completeness in the intuitionistic propositional logic”, Dokl. Akad. Nauk SSSR, 201:4 (1971), 794–797 |
|
1966 |
| 7. |
M. F. Raţă, “A test for functional completeness in the logic corresponding to Jaskowski’s first matrix”, Dokl. Akad. Nauk SSSR, 168:3 (1966), 524–527 |
|
|
|
1986 |
| 8. |
S. I. Adian, V. A. Andrunakievich, O. B. Lupanov, E. V. Paducheva, M. F. Raţă, V. A. Uspenskii, “Aleksandr Vladimirovich Kuznetsov (obituary)”, Uspekhi Mat. Nauk, 41:2(248) (1986), 179–180 ; Russian Math. Surveys, 41:2 (1986), 185–187  |
2
|
|
1972 |
| 9. |
M. F. Raţă, “Поправки к статье “Критерий функциональной полноты в интуционистской логике высказываний”
(ДАН, т. 201, № 4, 1971 г.)”, Dokl. Akad. Nauk SSSR, 206:6 (1972), 775 |
|
| Organisations |
|
| |
|
|
Contact us: