Algebraic Logic and Universal Algebra in Computer Science : Conference, Ames, Iowa, USA June 1–4, 1988 Proceedings
Logic design Computer science Computer software Data structures (Computer scienc Algebra Logic, Symbolic and mathematical 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
Imprint: Springer
1990
1st ed. 1990.
EISBN 0387348042
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.
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.
