Algebraic Logic and Universal Algebra in Computer Science [electronic resource] : Conference, Ames, Iowa, USA June 1–4, 1988 Proceedings /

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.

Saved in:
Bibliographic Details
Main Authors: Bergman, Clifford H. editor., Maddux, Roger D. editor., Pigozzi, Don L. editor., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: New York, NY : Springer New York, 1990
Subjects:Computer science., Data structures (Computer science)., Algorithms., Computer logic., Mathematical logic., Computer science, Computer Science., Logics and Meanings of Programs., Mathematical Logic and Formal Languages., Algorithm Analysis and Problem Complexity., Data Structures., Symbolic and Algebraic Manipulation., Mathematical Logic and Foundations.,
Online Access:http://dx.doi.org/10.1007/BFb0043074
Tags: Add Tag
No Tags, Be the first to tag this record!