Skip to main content
SpringerLink
Log in

Remarks on comparing expressive power of logics of programs

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1984 (MFCS 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 176))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. Constable, R.L., Gries, D., On classes of program schemata, SIAM J. Comput. vol. 1, no. 1, 1972, 66–118.

    Google Scholar 

  3. Clarke,E.M.,German,S.M.,Halpern,J.Y., Effective axiomatizations of Hoare logics, Research Report, Harvard Univ., 1982.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. Harel, D., First-Order Dynamic Logic, Lecture Notes in Comp.Sci. vol.68, Springer-Verlag, Berlin, 1979.

    Google Scholar 

  6. Kfoury, A.J., Translatability of schemes over restricted interpretations, J.Comput.Sys.Sci., 8,1974,387–408.

    Google Scholar 

  7. Kfoury, A.J., Definability by programs in first-order structures, Theoret.Comput.Sci., 25,1983,1–66.

    Google Scholar 

  8. Lipton,R.J., A necessary and sufficient condition for the existence of Hoare logics, in: Proc. 18th IEEE Symp.on FoCS, 1977.

    Google Scholar 

  9. Meyer,A.R.,Tiuryn,J., A note on equivalences among logics of programs, to appear in J.Comput.Sys.Sci.

    Google Scholar 

  10. Stolboushkin,A.P.,Taitslin,M.A., DDL is strictly weaker than DL, to appear in Inform.Control.

    Google Scholar 

  11. Tiuryn,J., An introduction to first-order programming logics, a course given at Inter-University Centre for Postgraduate studies, Dubrovnik, 1983, to appear.

    Google Scholar 

  12. Tiuryn,J.,Urzyczyn,P., Some relationships between logics of programs and complexity theory, in: Proc. 24th IEEE Symp. on FoCS, 1983.

    Google Scholar 

  13. Urzyczyn,P., Nontrivial definability by flow-chart programs, to appear in Inform.Control.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Warsaw PKiN, 00-901, Warszawa, Poland

    Jerzy Tiuryn & Paweł Urzyczyn

Authors
  1. Jerzy Tiuryn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paweł Urzyczyn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation