Literature Cited
V. M. Glushkov, “Theory of automata and formal transformations of microprograms,” Kibernetika, No. 5, 1–9 (1965).
A. A. Letichevskii, “A method of program analysis,” Kibernetika, No. 6, 1–8 (1979).
D. Harel, First-Order Dynamic Logic, Springer-Verlag, Berlin (1979).
S. I. Adyan, Burnside Problem and Identities in Groups [in Russian], Nauka, Moscow (1975).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).
Yu. L. Ershov, E. A. Palyutin, and M. A. Taitslin, Mathematical Logic [in Russian], NGU, Novosibirsk (1973).
A. P. Stolboushkin, “Problems of truth of program formulas on finite models,” in: Sixth National Conference on Mathematical Logic [in Russian], Izd. Tbilis. Univ., Tbilisi (1982), p. 178.
A. P. Stolboushkin, Context-Free and Recursive Program Logics Are Different [in Russian], No. 4643–82 Dep., Manuscript deposited with VINITI, Moscow (1982).
Additional information
Translated from Kibernetika, No. 6, pp. 29–32, November–December, 1984.
Rights and permissions
About this article
Cite this article
Musikaev, I.K., Stolboushkin, A.P. Positive program logics in systems with arithmetic. Cybern Syst Anal 20, 804–808 (1984). https://doi.org/10.1007/BF01072166
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01072166