Information algebras and consequence operators

Logica Universalis 1 (1):139-165 (2007)
  Copy   BIBTEX

Abstract

.  We explore a connection between different ways of representing information in computer science. We show that relational databases, modules, algebraic specifications and constraint systems all satisfy the same ten axioms. A commutative semigroup together with a lattice satisfying these axioms is then called an “information algebra”. We show that any compact consequence operator satisfying the interpolation and the deduction property induces an information algebra. Conversely, each finitary information algebra can be obtained from a consequence operator in this way. Finally we show that arbitrary (not necessarily finitary) information algebras can be represented as some kind of abstract relational database called a tuple system.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
43 (#324,761)

6 months
5 (#246,492)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references