Results 1 -
2 of
2
Process Logic: Expressiveness, Decidability, Completeness
, 1982
"... this paper have natural algebraic and topological interpretations: Let L be the Boolean algebra of formulas of PL modulo the PL axioms of Section 4, and let rim= {nXlXe Z}, fL=/fXlXe m } ..."
Abstract
-
Cited by 36 (1 self)
- Add to MetaCart
this paper have natural algebraic and topological interpretations: Let L be the Boolean algebra of formulas of PL modulo the PL axioms of Section 4, and let rim= {nXlXe Z}, fL=/fXlXe m }
Dynamic Algebras: Examples, Constructions, Applications
- Studia Logica
, 1991
"... Dynamic algebras combine the classes of Boolean (B 0 0) and regular (R [ ; ) algebras into a single finitely axiomatized variety (B R 3) resembling an R-module with "scalar" multiplication 3. The basic result is that is reflexive transitive closure, contrary to the intuition that this con ..."
Abstract
-
Cited by 15 (1 self)
- Add to MetaCart
Dynamic algebras combine the classes of Boolean (B 0 0) and regular (R [ ; ) algebras into a single finitely axiomatized variety (B R 3) resembling an R-module with "scalar" multiplication 3. The basic result is that is reflexive transitive closure, contrary to the intuition that this concept should require quantifiers for its definition. Using this result we give several examples of dynamic algebras arising naturally in connection with additive functions, binary relations, state trajectories, languages, and flowcharts. The main result is that free dynamic algebras are residually finite (i.e. factor as a subdirect product of finite dynamic algebras), important because finite separable dynamic algebras are isomorphic to Kripke structures. Applications include a new completeness proof for the Segerberg axiomatization of propositional dynamic logic, and yet another notion of regular algebra. Key words: Dynamic algebra, logic, program verification, regular algebra. This paper or...

