separation algebra






Several generalizations of effect algebras exist, based on the needs of various logics; these may not have a clear relationship to the quantum foundations of effect algebras, but deal with informationally similar situations where the “resources” of the deductions rules are subject to certain restrictions. Separation algebras correspond to separation logic in the way effect algebras correspond to quantum logic, and are often used as models for memory allocation and program modularity, where the outcome of a program must be guaranteed with respect to specified memory states. Separation algebra therefore has a role in certified programming.



((Generalized) Separation Algebra)

A generalized separation algebra (GSA) is a partial monoid satisfying the following equations:

(1) ab=acb=cab = ac \rightarrow b=c,

(2) ab=cba=cab=cb \rightarrow a=c,

and the non-equational formula:

(3) a,b(d:da=bc:ac=b)\forall a, b (\exists d : da=b \iff \exists c : ac = b)

A separation algebra is a commutative GSA, which removes the axiom (3). The real interest of (3) lies in other order-theoretic properties.

This reveals effect algebras to be those separation algebras with the positivity property.

A Family of Partial Algebras



Aside from low-dimensional cases found in a model generator such as Mace, many natural examples which are not effect algebras arise from ordered bisemigroups.




Last revised on March 14, 2019 at 14:44:37. See the history of this page for a list of all contributions to it.