Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

JLP
2011

favoriteEmaildiscussreport

160views more JLP 2011»

Axiomatizability of representable domain algebras

12 years 12 months ago

Axiomatizability of representable domain algebras

Download www.cs.ucl.ac.uk

The family of domain algebras provide an elegant formal system for automated reasoning about programme veriﬁcation. 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 ﬁnitely axiomatizable. Then we show similar results for extended similarity types of domain algebras.

Robin Hirsch, Szabolcs Mikulás

Real-time Traffic

Automated Reasoning | Domain Algebras | JLP 2011 | Representable Domain Algebras |

claim paper

Related Content

» On weak and strong interpolation in algebraic logics

» Impossibility Results for the Equational Theory of Timed CCS

» DrDoodle A Diagrammatic Theorem Prover

» Direct Isosurface Visualization of HexBased HighOrder Geometry and Attribute Representatio...

» MEBN A language for firstorder Bayesian knowledge bases

» Regularity Criteria for the Topology of Algebraic Curves and Surfaces

» Optimizing data flow graphs to minimize hardware implementation

» A Categorical View on Algebraic Lattices in Formal Concept Analysis

» A Domain Theoretic Account of Eulers Method for Solving Initial Value Problems

Post Info
More Details (n/a)

Added	16 May 2011
Updated	16 May 2011
Type	Journal
Year	2011
Where	JLP
Authors	Robin Hirsch, Szabolcs Mikulás

Comments (0)