Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
An axiomatic basis for computer programming
Communications of the ACM
A Discipline of Programming
On the theory of programming logics
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Propositional modal logic of programs
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A completeness technique for d-axiomatizable semantics
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
LOGICS OF PROGRAMS: AXIOMATICS AND DESCRIPTIVE POWER
LOGICS OF PROGRAMS: AXIOMATICS AND DESCRIPTIVE POWER
On the composition of processes
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Some results in dynamic model theory
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
A formal language for electronic contracts
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
| Hi-index | 0.00 |
Dynamic algebras constitute the variety (equationally defined class) of models of the Segerberg axioms for propositional dynamic logic. We obtain the following results (to within inseparability). (i) In any dynamic algebra * is reflexive transitive closure. (ii) Every free dynamic algebra can be factored into finite dynamic algebras. (iii) Every finite dynamic algebra is isomorphic to a Kripke structure. (ii) and (iii) imply Parikh's completeness theorem for the Segerberg axioms. We also present an approach to treating the inductive aspect of recursion within dynamic algebras.