This is a preview of subscription content, log in via an institution to check access.
Literature Cited
E. F. Codd, “Relational completeness of data base sublanguages,” in: Data Base Systems, Prentice-Hall, Englewood Cliffs (1972), pp. 65–98.
A. Chandra and D. Harel, “Structures and complexity of relational queries,” Weizmann Inst. Sci. (Preprint CS82-05) (1982).
A. P. Stolboushkin, “Context-free and recursive program logics differ,” Moscow, VINITI, No. 4643-82 (1982).
M. A. Taitslin, “Hierarchy of program logics,” Sib. Mat. Zh.,24, No. 3, 184–192 (1983).
D. Harel, “Logics of programs: axiomatics and descriptive power,” in: M.I.T. Lab. Comp. Sci.,TR-200, 1–152 (1978).
A. R. Meyer and K. Winklmann, “Expressing program looping in regular dynamic logic,” Theor. Comp. Sci.,18, No. 3, 301–323 (1982).
J. Tiuryn, “Review on ‘D. Hare. First-order dynamic logic,’” J. Symbol. Log.,47, No. 2, 453–454 (1982).
A. P. Stolboushkin and M. A. Taitslin, “The comparison of the expressive power of firstorder dynamic logic,” Theor. Comp. Sci.,27, No. 2, 197–209 (1983).
P. Urzyczyn, “Nontrivial definability by iterative and recursive programs,” Extended Abstract, Warsaw University (1982).
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. 49–60.
J. Tiuryn, “A simplified proof of the polynomial-search lemma for deterministic flow-diagrams,” Extended Abstract, Warsaw University (1983).
Additional information
Translated from Sibirskii Matematicheskii Zhurnal, Vol. 28, No. 2, pp. 100–106, March–April, 1987.
Rights and permissions
About this article
Cite this article
Magazov, S.S. Role of determinism in query languages for data bases. Sib Math J 28, 257–262 (1987). https://doi.org/10.1007/BF00970872
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00970872