default search action
Algebraic Logic and Universal Algebra in Computer Science 1988: Ames, Iowa, USA
- Clifford Bergman, Roger D. Maddux, Don Pigozzi:
Algebraic Logic and Universal Algebra in Computer Science, Conference, Ames, Iowa, USA, June 1-4, 1988, Proceedings. Lecture Notes in Computer Science 425, Springer 1990, ISBN 3-540-97288-9
Invited Papers
- Hajnal Andréka, Bjarni Jónsson, István Németi:
Relatively free relation algebras. 1-14 - Joel Berman:
The value of free algebras. 15-26 - H. Peter Gumm:
Continuations of logic programs. 27-36 - István Németi:
On cylindric algebraic model theory. 37-75 - Vaughan R. Pratt:
Dynamic algebras as a well-behaved fragment of relation algebras. 77-110 - Eric G. Wagner:
All recursive types defined using products and sums can be implemented using pointers. 111-132
Contributed Papers
- Isidore Fleischer:
The abstract Galois theory: a survey. 133-137 - Fernando Guzmán:
The implications in conditional logic. 139-159 - Lawrence S. Moss, Satish R. Thatte:
Optimal semantics of data type extensions. 161-180 - George C. Nelson:
Other logics for (equational) theories. 181-194 - Ivo G. Rosenberg:
Mal'cev algebras for universal algebra terms. 195-208 - Ildikó Sain:
Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic. 209-225 - Zbigniew Stachniak:
The resolution rule: an algebraic perspective. 227-242 - Marek A. Suchenek:
Incremental models of updating data bases. 243-271 - Richard J. Thompson:
Noncommutative cylindric algebras and relativizations of cylindric algebras. 273-278 - Marek Zaionc:
On the "lambda"-definable tree operations. 279-292
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.