Skip to main content
SpringerLink
Log in

On the propositional algorithmic logic

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

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

Abstract

The aim of propositional algorithmic logic PAL is to investigate properties of program connectives and to develop tools useful in the practice of proving properties of program schemes. The tautologies of PAL become tautologies of algorithmic logic after replacing program variables by programs and propositional variables by formulas.

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. Fisher, M., Ladner, R., Propositional dynamic logic of regular programs. Proc. 9th Ann. ACM Symp., Boulder, Colorado, 1977.

    Google Scholar 

  2. Grabowski, M., The set of tautologies of zero-order algorithmic logic is decidable, Bull.Acad.Pol.Sci. Ser.Math. 20 (1972), 575–582.

    Google Scholar 

  3. Mirkowska, G., On formalized systems of algorithmic logic, ibid. 19, (1971), 421–428.

    Google Scholar 

  4. Mirkowska, G., Algorithmic logic with nondeterministic programs, to appear in Fundamenta Informaticae.

    Google Scholar 

  5. Parikh, R., A completeness result for PDL, MFCS, september 1978.

    Google Scholar 

  6. Pratt, V.R., A practical decision method for propositional dynamic logic, Tenth ACM symposium on Theory of Computing, 1978.

    Google Scholar 

  7. Rasiowa, H., Sikorski, R., The mathematics of metamathematics, PWN, Warsaw 1963.

    Google Scholar 

  8. Segerberg, K., A completeness theorem in the modal logic of programs, Notices of the ACM, 24,6. A-552, 1977.

    Google Scholar 

  9. Yanov, J., On equivalence of operator schemes, Problems of Cybernetics 1, 1–100, 1959.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Grazyna Mirkowska

Authors
  1. Grazyna Mirkowska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mirkowska, G. (1979). On the propositional algorithmic logic. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation