, Andrzej Szalas
(Eds.): Participants Copies for Relational Methods in Logic, Algebra and Computer Science, 4th International Seminar RelMiCS, Warsaw, Poland, Septermber 14-20, 1998.
: Using RELVIEW to solve problems on relation-based discrete structures.
: More on embeddings of residuated semigroups into algebras of binary relations.
: Coping with semilattices of relations in logics with relative accessibility relations.
: Translating relational programs into PROLOG.
H. Peter Gumm
: Equational and implicational classes of co-algebras.
: Relational representation theorems for some algebraic structures.
: Demonic diagrams - towards a graphical refinement calculus.
Burghard von Karger
: Computation calculus = sequential calculus + discreteness and termination.
: A relational approach to association rules and functional dependencies.
: The variety of lambda abstraction algebras does not admit n-permutable congruences for all n.
Renate A. Schmidt
: Decidability by unrefined resolution for propositional modal logics.
: On space-time duality in computing: Imperative programming versus wave computation.
: Representation theorems for residuated groupoids.
: Cylindric algebras for partial relational systems (Quasicylindric algebras).
The information on this page was contributed by Gunther Schmidt