−Table of Contents
Action algebras
Abbreviation: Act
Definition
An \emph{action algebra} is a structure A=⟨A,∨,⊥,⋅,1,∗,∖,/⟩ of type ⟨2,0,2,0,1,2,2⟩ such that
⟨A,∨,⊥,⋅,1,∗⟩ is a Kleene algebra
∖ is the left residual of ⋅: y≤x∖z⟺xy≤z
/ is the right residual of ⋅: x≤z/y⟺xy≤z
Remark: These equivalences can be written equationally.
Morphisms
Let A and B be action algebras. A morphism from A to B is a function h:A→B that is a homomorphism: h(x∨y)=h(x)∨h(y), h(x⋅y)=h(x)⋅h(y), h(x∖y)=h(x)∖h(y), h(x/y)=h(x)/h(y), h(x∗)=h(x)∗, h(⊥)=⊥ and h(1)=1.
Examples
Example 1:
Basic results
Properties
Finite members
f(1)=1f(2)=1f(3)=3f(4)=20f(5)=149f(6)=1488
Subclasses
Superclasses
References
1)
Vaughan Pratt, \emph{Action logic and pure induction},
``Logics in AI (Amsterdam, 1990)'', Lecture Notes in Comput. Sci.,
478, 1991, 97–120, 92d:03016