Information algebras and consequence operators

Logica Universalis 1 (1):139-165 (2007)
.  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.
Keywords Theory of information  consequence operators  Craig’s interpolation theorem  relational databases  module algebra  algebraic specification  constraint systems
Categories (categorize this paper)
DOI 10.1007/s11787-006-0007-2
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,848
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index

Total downloads
32 ( #175,384 of 2,210,502 )

Recent downloads (6 months)
1 ( #387,753 of 2,210,502 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature