Skip to main content
SpringerLink
Log in
Book cover

Workshop on Logic of Programs

Logic of Programs 1981: Logics of Programs pp 300–310Cite as

The representation theorem for algorithmic algebras

  • Conference paper
  • First Online:

  • 133 Accesses

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

Abstract

Algorithmic algebras form semantical base for semantics of algorithmic logics as Boolean algebras do for propositional calculus. The paper contains the proof of the following statement : every separable algorithmic algebra is representable by an algebra of computations.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Glushkow W., On the problem of minimalization of programs and schemes of algorithms. Kibiernietika, 1966. 5.

    Google Scholar 

  2. Kozen D., On the duality of dynamic algebras and Kripke models, IBM Reports, 10/5/79.

    Google Scholar 

  3. Kozen D., On the representation of dynamic algebras, IBM Reports 10/10/79.

    Google Scholar 

  4. Kozen D., A representation theorem for models of-free PDL, IBM Reports, 9/7/79.

    Google Scholar 

  5. Mirkowska G., Algorithmic logic and its applications in the theory of programs, doctoral dissertation, University of Warsaw 1972.

    Google Scholar 

  6. Mirkowska G., PAL — propositional algorithmic logic. Fundamenta Informaticae 1981.

    Google Scholar 

  7. Pratt V., Dynamic algebras: examples, constructions applications, MIT Reports LCS/TM — 138, 1979.

    Google Scholar 

  8. Pratt V., Dynamic algebras and the nature of induction, 12-th Ann, ACM Symp. on Theory of Computing, Los Angeles CA May 1980.

    Google Scholar 

  9. Rasiowa H., Sikorski R., The Mathematics of metamathematics, PWN Warsaw. 1963.

    Google Scholar 

  10. Reiterman J., Trnkova V., Dynamic algebras which are not Kripke structures. MFCS'80. Lecture Notes in Computer Sci., Springer Verlag 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Warsaw, OQ-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

Dexter Kozen

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mirkowska, G. (1982). The representation theorem for algorithmic algebras. In: Kozen, D. (eds) Logics of Programs. Logic of Programs 1981. Lecture Notes in Computer Science, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025788

Download citation

  • DOI: https://doi.org/10.1007/BFb0025788

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11212-9

  • Online ISBN: 978-3-540-39047-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation