Algebraic Logic and Universal Algebra in Computer Science 1988: Ames, Iowa, USA

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
  
• G. 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