Algebraic Logic and Universal Algebra in Computer Science Conference, Ames, Iowa, USA June 1–4, 1988 Proceedings / edited by Clifford H. Bergman, Roger D. Maddux, Don L. Pigozzi.

Saved in:

Bibliographic Details
Corporate Author:	SpringerLink (Online service)
Other Authors:	Bergman, Clifford H. (Editor), Maddux, Roger D. (Editor), Pigozzi, Don L. (Editor)
Format:	eBook
Language:	English
Published:	New York, NY : Springer New York : Imprint: Springer, 1990.
Edition:	1st ed. 1990.
Series:	Lecture Notes in Computer Science, 425 Springer eBook Collection.
Subjects:	Computer logic. Mathematical logic. Algorithms. Data structures (Computer science). Computer science—Mathematics. Electronic resources (E-books)
Online Access:	Click to view e-book
Holy Cross Note:	Loaded electronically. Electronic access restricted to members of the Holy Cross Community.

Table of Contents:

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.

Similar Items