This is a preview of subscription content, log in via an institution to check access.
Literature Cited
P. Berman, J. Y. Halpern, and J. Tiuryn, “On the power of nondeterminism in dynamic logic,” in: Automata, Languages, and Programming, Springer-Verlag, Berlin (1982), pp. 48–60.
M. A. Taitslin, “Five problems on program logics,” in: Studies in Model Theory [in Russian], KazGU, Alma-Ata (1982), pp. 61–66.
M. A. Taitslin, “Hierarchy of program logics,” Sib. Mat. Zh.,24, No. 3, 184–192 (1983).
I. Kh. Musikaev and A. P. Stolboushkin, “Positive program logics in systems with arithmetic,” Kibernetika, No. 6, 29–32 (1984).
M. Presburger, “Uber die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt,” in: Comptes Rendus du I Congres des Mathematicies des Pays Slaves, Warsaw (1929), pp. 92–101.
A. V. Aho and J. D. Ullman, Theory of Parsing, Translation and Compiling, Vol. 1, Prentice-Hall (1972).
Additional information
Alma-Ata. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 27, No. 6, pp. 157–162, November–December, 1986.
Rights and permissions
About this article
Cite this article
Musikaev, I.K. A nondeterministic program logic. Sib Math J 27, 914–919 (1986). https://doi.org/10.1007/BF00970010
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00970010