Hirsch, R. and Mikulás, Szabolcs (2011) Axiomatizability of representable domain algebras. Journal of Logic and Algebraic Programming 80 (2), pp. 75-91. ISSN 1567-8326.
Abstract
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.
Metadata
| Item Type: | Article |
|---|---|
| Keyword(s) / Subject(s): | Domain algebras, relation algebras, finite axiomatizability |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Administrator |
| Date Deposited: | 27 Jan 2011 12:08 |
| Last Modified: | 09 Aug 2023 12:30 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/2977 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
