Preview
Unable to display preview. Download preview PDF.
References
Berman, P., Halpern, J.Y., Tiuryn, J., On the power of nondeterminism in Dynamic Logic, in: Proc of 9th ICALP (M. Nielsen and E.M. Schmidt, Eds.), Lecture Notes in Comp.Sci., vol. 140, Springer-Verlag, Berlin, 1982, pp. 48–60.
Constable, R.L., Gries, D., On classes of program schemata, SIAM J. Comput. vol. 1, no. 1, 1972, 66–118.
Clarke,E.M.,German,S.M.,Halpern,J.Y., Effective axiomatizations of Hoare logics, Research Report, Harvard Univ., 1982.
Friedman, H., Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory, in: Logic Colloquium 69 (R.O. Gandy and C.M.F. Yates, Eds.), North Holland, Amsterdam, 1971, pp. 361–389.
Harel, D., First-Order Dynamic Logic, Lecture Notes in Comp.Sci. vol.68, Springer-Verlag, Berlin, 1979.
Kfoury, A.J., Translatability of schemes over restricted interpretations, J.Comput.Sys.Sci., 8,1974,387–408.
Kfoury, A.J., Definability by programs in first-order structures, Theoret.Comput.Sci., 25,1983,1–66.
Lipton,R.J., A necessary and sufficient condition for the existence of Hoare logics, in: Proc. 18th IEEE Symp.on FoCS, 1977.
Meyer,A.R.,Tiuryn,J., A note on equivalences among logics of programs, to appear in J.Comput.Sys.Sci.
Stolboushkin,A.P.,Taitslin,M.A., DDL is strictly weaker than DL, to appear in Inform.Control.
Tiuryn,J., An introduction to first-order programming logics, a course given at Inter-University Centre for Postgraduate studies, Dubrovnik, 1983, to appear.
Tiuryn,J.,Urzyczyn,P., Some relationships between logics of programs and complexity theory, in: Proc. 24th IEEE Symp. on FoCS, 1983.
Urzyczyn,P., Nontrivial definability by flow-chart programs, to appear in Inform.Control.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tiuryn, J., Urzyczyn, P. (1984). Remarks on comparing expressive power of logics of programs. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030337
Download citation
DOI: https://doi.org/10.1007/BFb0030337
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13372-8
Online ISBN: 978-3-540-38929-3
eBook Packages: Springer Book Archive