UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Axiomatizability of representable domain algebras

Hirsch, R; Mikulás, S; (2011) Axiomatizability of representable domain algebras. Journal of Logic and Algebraic Programming , 80 (2) pp. 75-91. 10.1016/j.jlap.2010.07.019.

Full text not available from this repository.


The family of domain algebras provide an elegant formal system for automated reasoning about programme verification. Their primary models are algebras of relations, viz. representable domain algebras. We prove that, even for the minimal signature consisting of the domain and composition operations, the class of representable domain algebras is not finitely axiomatizable. Then we show similar results for extended similarity types of domain algebras. © 2010 Elsevier Inc. All rights reserved.

Type: Article
Title: Axiomatizability of representable domain algebras
DOI: 10.1016/j.jlap.2010.07.019
UCL classification: UCL > School of BEAMS
UCL > School of BEAMS > Faculty of Engineering Science
URI: http://discovery.ucl.ac.uk/id/eprint/141321
Downloads since deposit
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item