Skip to main content

Dynamic algebras which are not Kripke structures

  • Communications
  • Conference paper
  • First Online:

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

Abstract

The first example of a dynamic algebra which is not isomorphic to any Kripke structure was given by Kozen [8]. We analyze properties of dynamic algebras to get general arguments making it possible to construct a lot of other examples.

Dynamic algebras were introduced by Kozen [6] and Pratt [12] to provide models of propositional dynamic logic (PDL); see [12] for motivation, examples and relation to computer science problems. Dynamic algebras include (standard) Kripke structures, the traditional models of PDL. They are axiomatized in a purely algebraic way in [12] and in a nearly algebraic way in [6], in contrary to Kripke structures which are a kind of relational structures. A relation between abstract dynamic algebras and Kripke structures was investigated by Kozen; he proved

The aim of the current paper is to present other examples of that kind. In fact, we show that many Boolean algebras are Boolean parts of separable dynamic algebras which are not isomorphic to any Kripke structure.

The paper has five sections. Preliminaries are contained in sections 1 and 2. In section 3 we prove that every Kripke structure fulfils a condition, called relative \(\mathfrak{S}\)-continuity. By means of this result, we show that every Boolean algebra, in which the zero is an infimum of a strictly decreasing sequence, is a Boolean part of a dynamic algebra which is not relatively \(\mathfrak{S}\)-continuous (and hence not isomorphic to any Kripke structure) and the regular part of which has one generator. We also bring examples showing that the Kozen's axiomatization [6] of dynamic algebras is actually stronger than that of Pratt [12]. In section 4, we show that, on the other hand, the \(\mathfrak{S}\)-continuity (and even complete continuity) of a dynamic algebra is not sufficient for it to be isomorphic to a Kripke structure. Section 5 contains remarks concerning dynamic algebras with reversion.

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. Banachowski, L., A. Kreczmar, G. Mirkowska, H. Rasiowa, and A. Salwicki: “An introduction to algorithmic Logic,” in: Mazurkiewicz and Pawlak, eds., Math. Found. of Comp. Sci., Banach Center Publications, Warszaw, 1977.

    Google Scholar 

  2. Berman, F.: A completeness technique for D-axiomatizable semantics, Proc. 11th ACM Symp. on Theory of Comp. (May 1979), 160–166.

    Google Scholar 

  3. Fischer, M.J. and R.E. Ladner: Propositional modal logic of programs, Proc. 9th ACM Symp. on Theory of Comp. (May 197), 286–294.

    Google Scholar 

  4. Halmos, P.R.: Algebraic Logic, Chelsea, New York 1962.

    Google Scholar 

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

    Google Scholar 

  6. Kozen, D.: A representation theorem for models of *-free PDL, manuscript, July 1979.

    Google Scholar 

  7. Kozen, D.: On the duality of dynamic algebras and Kripke models, manuscript, May 1979.

    Google Scholar 

  8. Kozen, D.: On the representation of dynamic algebras, manuscript, October 1979.

    Google Scholar 

  9. Parikh, R.: A completeness result for PDL, Symp. on Math. Found. of Comp. Sci., Warszawa, Springer Verlag 1978.

    Google Scholar 

  10. Pratt, V.R.: A practical decision method for Propositional Dynamic Logic, Proc. 10th ACM Symp. on Theory of Comp. (May 1978), 326–337.

    Google Scholar 

  11. Pratt, V.R.: Models of program logics, Proc. 20th IEEE Symp. on Foundations of Comp. Sci. (October 1979), to appear.

    Google Scholar 

  12. Pratt, V.R.: Dynamic algebras: examples, constructions, applications, manuscript, July 1979.

    Google Scholar 

  13. Salwicki, A.: Formalized Algorithmic Languages, Bull. Acad. Pol. Sci., Sér. Sci. Math. Astr. Phys. Vol. 18 No 5, 1970.

    Google Scholar 

  14. Segerberg, K.: A completeness theorem in the modal logic of programs, Not. AMS 24:6(1977), A-552.

    Google Scholar 

  15. Sikorski, R.: Boolean algebras, Springer Verlag 1964.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

P. Dembiński

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reiterman, J., Trnková, V. (1980). Dynamic algebras which are not Kripke structures. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022530

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10027-0

  • Online ISBN: 978-3-540-38194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics