Algebraic Logic and Universal Algebra in Computer Science

Résumé
The 16 papers and extended abstracts represent a wide range of topics at the interface of algebra and computer science. No index. Annotation copyright Book News, Inc. Portland, Or.

Contenu
Relatively free relation algebras.- The value of free algebras.- Continuations of logic programs.- On cylindric algebraic model theory.- Dynamic algebras as a well-behaved fragment of relation algebras.- All recursive types defined using products and sums can be implemented using pointers.- The abstract Galois theory: A survey.- The implications in conditional logic.- Optimal semantics of data type extensions.- Other logics for (equational) theories.- Mal'cev algebras for universal algebra terms.- Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic.- The resolution rule: An algebraic perspective.- Incremental models of updating data bases.- Noncommutative cylindric algebras and relativizations of cylindric algebras.- On the ?-definable tree operations.