Dynamic algebras: Examples, constructions, applications
type: Item
instance of: scholarly article
title: Dynamic algebras: Examples, constructions, applications
zbMATH Open document ID: 0752.03033
DOI: 10.1007/BF00370685
published in: Studia Logica
publication date: 1992-09-27T00:00:00Z
review text: This paper originally appeared more than a decade ago as a technical report to the Laboratory for Computer Science of MIT, and a shortened version of it has already been published under the title ``Dynamic algebra and the nature of induction'' in Proceedings of 12th ACM Symposium on Theory of Computation [Los Angeles, April 1980]. The principal changes to the original draft are the addition of footnotes and some sections at the end on retrospective citations and reflections. The main results of the paper are that the regular operation * is reflexive transitive closure, that free dynamic algebras are residually Boolean- finite, and that free dynamic algebras are residually finite.
reviewed by: Hirokazu Nishimura
Mathematics Subject Classification ID: 03G05
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 06E25
zbMATH DE Number: 58413
zbMATH Keywords: regular algebra
zbMATH Keywords: Boolean algebra
zbMATH Keywords: free dynamic algebras
author: Vaughan R. Pratt
MaRDI profile type: Publication
cites work: Q5532570
cites work: Heterogeneous algebras
cites work: Boolean modules
cites work: Temporal Structures
cites work: Q5639639
cites work: Q5649409
cites work: Q4144755
cites work: Propositional dynamic logic of regular programs
cites work: Q5584402
cites work: Q3282928
cites work: The Logic of Equality
cites work: An axiomatic basis for computer programming
cites work: On sentences which are true of direct unions of algebras
cites work: Q3897035
cites work: Complexity of Boolean algebras
cites work: A completeness theorem for Kleene algebras and the algebra of regular events
cites work: A calculus of communicating systems
cites work: On representable relation algebras
cites work: Every free algebra in the variety generated by the representable dynamic algebras is separable and representable
cites work: Application of modal logic to programming
cites work: A near-optimal method for reasoning about action
cites work: Q4287490
cites work: Q4273477
cites work: Two Complete Axiom Systems for the Algebra of Regular Events
cites work: Q5596237
cites work: Q3337453
cites work: Q4155837
cites work: The Theory of Representation for Boolean Algebras
cites work: On the calculus of relations
cites work: Dynamic algebras with test
full work available at URL: https://doi.org/10.1007/bf00370685
OpenAlex ID: W2022554132
description: scientific article; zbMATH DE number 58413