On representation of dynamic algebras with reversion

  • Jan Reiterman
  • Věra Trnková
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


We investigate the role of the reversion operator in dynamic algebras. We show that all actions in a dynamic algebra with reversion are completely additive. So the considering of the reversion is a way how to axiomatize complete additivity by purely algebraic means. Our main result states that every separable *-continuous dynamic algebra with reversion can be represented as a subalgebra of a full complete dynamic algebra consisting of all completely additive functions on a complete Boolean algebra. We give some corollaries related to the problem of representability of dynamic algebras by Kripke structures. We generalize some results from dynamic algebras with reversion to dynamic algebras with completely additive actions.

Section 1 deals with basic definitions. In Section 2 we introduce and investigate invertible functions. Section 3 contains main results. In Section 4 we discuss generalizations to dynamic algebras without reversion.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Banachowski, L., Kreczmar, A., Mirkowska, G., Rasiowa, H. and Salwicki, A., An introduction to algorithmic logic, In: Mazurkiewicz and Pawlak, eds., Math. Found. Comp. Sci., Banach Center Publications, Warszawa 1977.Google Scholar
  2. 2.
    Harel, D., First order dynamic logic, Lecture Notes in Comp. Sci. 68, Springer Verlag Berlin 1979.Google Scholar
  3. 3.
    Kozen, D., A representation theorem formodels of *-free PDL, manuscript, July 1979.Google Scholar
  4. 4.
    Kozen, D., On the duality of dynamic algebras and Kripke models, manuscript, May 1979.Google Scholar
  5. 5.
    Kozen, D., On the representation of dynamic algebras, manuscript, October 1979.Google Scholar
  6. 6.
    Kozen, D., On the representation of dynamic algebras II, manuscript, May 1980.Google Scholar
  7. 7.
    Pratt, V.R., Dynamic algebras; examples, constructions, applications, MIT/LCS/TM — 138, Laboratory for Comp. Sci. July 1979.Google Scholar
  8. 8.
    Pratt, V.R., Dynamic algebras and the nature of induction, MIT/LCS//TM 138, Laboratory for Comp. Sci. March 1980.Google Scholar
  9. 9.
    Prikry, K., On σ-complete prime ideals in Boolean algebras, Coll. Math. 22 1971, 209–214.Google Scholar
  10. 10.
    Reiterman, J., Trnková, V., Dynamic algebras which are not Kripke structures, Proc. MFCS 1980.Google Scholar
  11. 11.
    Salwicki, A., Formalized algorithmic languages, Bull. Acad. Pol. Sci., Ser. Sci. Math. Astr. Phys. Vol. 18, No 5, 1970.Google Scholar
  12. 12.
    Sikorski, R., Boolean algebras, Springer Verlag Berlin 1964.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Jan Reiterman
    • 1
    • 2
  • Věra Trnková
    • 1
    • 2
  1. 1.Faculty of Nuclear Science and Technical EngineeringTechnical University of PraguePrague 1Czechoslovakia
  2. 2.Faculty of Mathematics and PhysicsCharles University PraguePrague 8Czechoslovakia

Personalised recommendations