{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T10:20:47Z","timestamp":1786011647918,"version":"3.56.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Stud Logica"],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bf00370685","type":"journal-article","created":{"date-parts":[[2004,11,3]],"date-time":"2004-11-03T16:55:22Z","timestamp":1099500922000},"page":"571-605","source":"Crossref","is-referenced-by-count":32,"title":["Dynamic algebras: Examples, constructions, applications"],"prefix":"10.1007","volume":"50","author":[{"given":"Vaughan","family":"Pratt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"G. Birkhoff. On the structure of abstract algebras. Proc. Cambridge Phil. Soc, 31, 1935.","DOI":"10.1017\/S0305004100013463"},{"key":"CR2","unstructured":"G. Birkhoff. Lattice Theory. Volume 25, A.M.S. Colloq. Publications, 1967."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0021-9800(70)80014-X","volume":"8","author":"G. Birkhoff","year":"1970","unstructured":"G. Birkhoff and J.D. Lipson. Heterogeneous algebras. J. of Combinatorial Theory, 8:115?133, 1970.","journal-title":"J. of Combinatorial Theory"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0021-8693(81)90179-4","volume":"71","author":"C. Brink","year":"1981","unstructured":"C. Brink. Boolean modules. Journal of Algebra, 71:291?313, 1981.","journal-title":"Journal of Algebra"},{"key":"CR5","volume-title":"Proc. Conf. on Category Theory and Computer Science, LNCS","author":"R.T Casley","year":"1989","unstructured":"R.T Casley, R.F. Crew, J. Meseguer, and V.R. Pratt. Temporal structures. In Proc. Conf. on Category Theory and Computer Science, LNCS, Springer-Verlag, Manchester, September 1989."},{"key":"CR6","volume-title":"Universal Algebra","author":"P.M. Cohn","year":"1965","unstructured":"P.M. Cohn. Universal Algebra. Harper and Row, New York, 1965."},{"key":"CR7","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"J.H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971."},{"key":"CR8","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"J.H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"R.L. Constable. On the theory of programming logics. In Proc. 9th Annual ACM Symp. on Theory of Computing, pages 269?285, Boulder, Col., May 1977.","DOI":"10.1145\/800105.803417"},{"key":"CR10","unstructured":"J.W. de Bakker and W.P. de Roever. A calculus for recursive program schemes. In M. Nivat, editor, Automata, Languages and Programming, pages 167?196, North Holland, 1972."},{"key":"CR11","volume-title":"A Discipline of Programming","author":"E.W. Dijkstra","year":"1976","unstructured":"E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, N.J., 1976."},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"M.J Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. JCSS, 18(2), 1979.","DOI":"10.1016\/0022-0000(79)90046-1"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"R.W. Floyd. Assigning meanings to programs. In J.T Schwartz, editor, Mathematical Aspects of Computer Science, pages 19?32, 1967.","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"CR14","volume-title":"Universal Algebra","author":"G. Graetzer","year":"1968","unstructured":"G. Graetzer. Universal Algebra. Van Nostrand, Princeton, NJ, 1968."},{"key":"CR15","volume-title":"Algebraic Logic","author":"P.R. Halmos","year":"1962","unstructured":"P.R. Halmos. Algebraic Logic. Chelsea, New York, 1962."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-94-009-6259-0_10","volume-title":"Handbook of Philosophical Logic. II: Extensions of Classical Logic","author":"D. Harel","year":"1984","unstructured":"D. Harel. Dynamic logic. In Handbook of Philosophical Logic. II: Extensions of Classical Logic, pages 497?604, D. Reidel, Boston, 1984."},{"issue":"8","key":"CR17","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/00029890.1977.11994433","volume":"84","author":"L. Henkin","year":"1977","unstructured":"L. Henkin. The logic of equality. Amer. Math. Monthly, 84(8):597?612, October 1977.","journal-title":"Amer. Math. Monthly"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12:576?580, 1969.","journal-title":"Communications of the ACM"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"14","DOI":"10.2307\/2268661","volume":"16","author":"A. Horn","year":"1951","unstructured":"A. Horn. On sentences which are true of direct unions of algebras. J. Symbolic Logic, 16:14?21, 1951.","journal-title":"J. Symbolic Logic"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1515\/9781400882618-002","volume-title":"Automata Studies","author":"S.C. Kleene","year":"1956","unstructured":"S.C. Kleene. Representation of events in nerve nets and finite automata. In Automata Studies, pages 3?42, Princeton University Press, Princeton, NJ, 1956."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"D. Kozen. On the duality of dynamic algebras and Kripke models. In E. Engeler, editor, Proc. Workshop on Logic of Programs 1979, LNCS 125, pages 1?11, Springer-Verlag, 1979.","DOI":"10.1007\/3-540-11160-3_1"},{"key":"CR22","unstructured":"D. Kozen. On the representation of dynamic algebras. Technical Report RC7898, IBM, October 1979."},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"D. Kozen. A representation theorem for models of *-free PDL. May 1979. Manuscript.","DOI":"10.1007\/3-540-10003-2_83"},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"D. Kozen. A representation theorem for models of *-free PDL. Technical Report RC7864, IBM, September 1979.","DOI":"10.1007\/3-540-10003-2_83"},{"key":"CR25","unstructured":"D. Kozen. On the representation of dynamic algebras II. Technical Report RC8290, IBM, May 1980."},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"D. Kozen. A representation theorem for models of *-free PDL. In Proc. 7th Colloq. on Automata, Languages, and Programming, pages 351?362, July 1980.","DOI":"10.1007\/3-540-10003-2_83"},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"D. Kozen. Dynamic algebra: Section in: Propositional dynamic logics of programs: a survey, by R. Parikh. In E. Engeler, editor, Proc. Workshop on Logic of Programs 1979, LNCS 125, pages 102?144, Springer, 1981.","DOI":"10.1007\/3-540-11160-3_4"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"D. Kozen. On induction vs. *-continuity. In D. Kozen, editor, Proc. Workshop on Logics of Programs 1981, LNCS 131, pages 167?176, Spring-Verlag, 1981.","DOI":"10.1007\/BFb0025782"},{"key":"CR29","unstructured":"D. Kozen. A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. Technical Report 90?1123, Cornell U., May 1990."},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"D. Kozen and R. Parikh. A decision procedure for the propositional ?-calculus. In E. Clarke and Kozen D., editors, Proc. Workshop on Logics of Programs 1983, LNCS 164, pages 313?325, Springer-Verlag, 1983.","DOI":"10.1007\/3-540-12896-4_370"},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"R, Milner. Calculus of Communicating Behavior, LNCS 92. Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1307\/mmj\/1028999131","volume":"11","author":"J.D. Monk","year":"1964","unstructured":"J.D. Monk. On representable relation algebras. Michigan Math. J., 11:207?210, 1964.","journal-title":"Michigan Math. J."},{"key":"CR33","doi-asserted-by":"crossref","unstructured":"I. N\ufffdmeti. Dynamic algebras of programs. In Proc. Fundamentals of Computation Theory, LNCS 117, pages 281?290, Springer-Verlag, 1981.","DOI":"10.1007\/3-540-10854-8_31"},{"key":"CR34","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(82)90030-5","volume":"17","author":"I. N\ufffdmeti","year":"1982","unstructured":"I. N\ufffdmeti. Every free algebra in the variety generated by the representable dynamic algebras is separable and representable. Theoretical Computer Science, 17:343?347, 1982.","journal-title":"Theoretical Computer Science"},{"key":"CR35","volume-title":"PhD thesis","author":"K.C. Ng","year":"1984","unstructured":"K.C. Ng. Relation Algebras with Transitive Closure. PhD thesis, University of California, Berkeley, 1984. 157+iv pp."},{"key":"CR36","first-page":"A29","volume":"24","author":"K.C. Ng","year":"1977","unstructured":"K.C. Ng and A. Tarski. Relation algebras with transitive closure, Abstract 742-02-09. Notices Amer. Math. Soc., 24:A29-A30, 1977.","journal-title":"Notices Amer. Math. Soc."},{"key":"CR37","doi-asserted-by":"crossref","unstructured":"R. Parikh. A completeness result for a prepositional dynamic logic. In LNCS 64, pages 403?415, Springer-Verlag, 1978.","DOI":"10.1007\/3-540-08921-7_88"},{"key":"CR38","doi-asserted-by":"crossref","unstructured":"A. Pnueli. The temporal logic of programs. In 18th IEEE Symposium on Foundations of Computer Science, pages 46?57, October 1977.","DOI":"10.1109\/SFCS.1977.32"},{"key":"CR39","doi-asserted-by":"crossref","unstructured":"V.R. Pratt. Semantical considerations on Floyd-Hoare logic. In Proc. 17th Ann. IEEE Symp. on Foundations of Comp. Sci., pages 109?121, October 1976.","DOI":"10.1109\/SFCS.1976.27"},{"key":"CR40","doi-asserted-by":"crossref","unstructured":"V.R. Pratt. Models of program logics. In 20th Symposium on foundations of Computer Science, San Juan, October 1979.","DOI":"10.1109\/SFCS.1979.24"},{"key":"CR41","doi-asserted-by":"crossref","unstructured":"V.R. Pratt. Process logic. In Proc. 6th Ann. ACM Symposium on Principles of Programming Languages, pages 93?100, San Antonio, January 1979.","DOI":"10.1145\/567752.567761"},{"issue":"2\/3","key":"CR42","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF00370324","volume":"34","author":"V.R. Pratt","year":"1980","unstructured":"V.R. Pratt. Application of modal logic to programming. Studia Logica, 34(2\/3):257?274, 1980.","journal-title":"Studia Logica"},{"key":"CR43","doi-asserted-by":"crossref","unstructured":"V.R. Pratt. Dynamic algebras and the nature of induction. In 12th ACM Symposium on Theory of Computation, Los Angeles, April 1980.","DOI":"10.1145\/800141.804649"},{"key":"CR44","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0022-0000(80)90061-6","volume":"2","author":"V.R. Pratt","year":"1980","unstructured":"V.R. Pratt. A near optimal method for reasoning about action. Journal of Computer and System Sciences, 2:231?254, April 1980. Also MIT\/LCS\/TM-113, M.I.T., Sept. 1978.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR45","doi-asserted-by":"crossref","unstructured":"V.R. Pratt. A decidable mu-calculus. In Proc. 22nd IEEE Conference on Foundations of Computer Science, pages 421?427, October 1981.","DOI":"10.1109\/SFCS.1981.4"},{"key":"CR46","doi-asserted-by":"crossref","unstructured":"V.R. Pratt. Using graphs to understand PDL. In D. Kozen, editor, Proc. Workshop on Logics of Programs 1981, LNCS 131, pages 387?396, Spring-Verlag, 1981.","DOI":"10.1007\/BFb0025792"},{"key":"CR47","first-page":"97","volume-title":"Logics in AI, LNCS 478","author":"V.R. Pratt","year":"1990","unstructured":"V.R. Pratt. Action logic and pure induction. In Logics in AI, LNCS 478, pages 97?120, Springer-Verlag, Amsterdam, September 1990."},{"key":"CR48","volume-title":"Algebraic Logic and Universal Algebra in Computer Science, LNCS 425","author":"V.R. Pratt","year":"1988","unstructured":"V.R. Pratt. Dynamic algebras as a well-behaved fragment of relation algebras. In Algebraic Logic and Universal Algebra in Computer Science, LNCS 425, Springer-Verlag, Ames, Iowa, June 1988, 1990."},{"key":"CR49","first-page":"120","volume":"16","author":"V.N. Redko","year":"1964","unstructured":"V.N. Redko. On defining relations for the algebra of regular events (Russian). Ukrain. Mat. Z., 16:120?126, 1964.","journal-title":"Ukrain. Mat. Z."},{"key":"CR50","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"A. Salomaa. Two complete axiom systems for the algebra of regular events. Journal of the ACM, 13:158?169, 1966.","journal-title":"Journal of the ACM"},{"key":"CR51","unstructured":"A. Salwicki. Formalized algorithmic languages. Bull. Acad. Pol. Sci., Ser. Sci. Math. Astr. Phys., 18(5), 1970."},{"issue":"6","key":"CR52","first-page":"A","volume":"24","author":"K. Segerberg","year":"1977","unstructured":"K. Segerberg. A completeness theorem in the modal logic of programs. Notices of the AMS, 24(6):A-552, October 1977.","journal-title":"Notices of the AMS"},{"key":"CR53","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-Theoretic Aspects of Formal Power Series","author":"A. Salomaa","year":"1978","unstructured":"A. Salomaa and M. Soittola. Automata-Theoretic Aspects of Formal Power Series. Springer-Verlag, New York, 1978."},{"key":"CR54","first-page":"37","volume":"40","author":"M. Stone","year":"1936","unstructured":"M. Stone. The theory of representations for Boolean algebras. Trans. Amer. Math. Soc., 40:37?111, 1936.","journal-title":"Trans. Amer. Math. Soc."},{"key":"CR55","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2268577","volume":"6","author":"A. Tarski","year":"1941","unstructured":"A. Tarski. On the calculus of relations. J. Symbolic Logic, 6:73?89, 1941.","journal-title":"J. Symbolic Logic"},{"key":"CR56","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0022-0000(87)90014-6","volume":"35","author":"V. Trnkova","year":"1987","unstructured":"V. Trnkova and J. Reiterman. Dynamic algebras with tests. Journal of Computer and System Sciences, 35:229?242, 1987.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00370685.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00370685\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00370685","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T16:48:53Z","timestamp":1734626933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00370685"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"references-count":56,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1991]]}},"alternative-id":["BF00370685"],"URL":"https:\/\/doi.org\/10.1007\/bf00370685","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"value":"0039-3215","type":"print"},{"value":"1572-8730","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}