Relational and Algebraic Methods in Computer Science

<p>Amalgamation Property for Some Varieties of BL-algebras Generated by one Finite Set of BL-chains with Finitely-many Components.- Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture.- A General Method for Representing Sets of Relations by Vectors.- Contextuality in Distributed Systems.- The Structure of Locally Integral Involutive Po-monoids and Semirings.- Compatibility of Refining and Controlling Plant Automata with Bisimulation Quotients.- Dependences Between Domain Constructions in Heterogeneous Relation Algebras.- Normal Forms for Elements of the *-Continuous Kleene Algebras K (x) C2’.- Representable and Diagonally rRpresentable Weakening Relation Algebras.- Completeness and the Finite Model Property for Kleene Algebra, Reconsidered.- What Else is Undecidable About Loops.- Implication Algebras and Implication Semigroups of Binary Relations.- On the Complexity of Kleene Algebra with Domain.- Enumerating, Cataloguing and Classifying all Quantales on up to Nine Elements.- Duoidally Enriched Freyd Categories.- Towards a Theory of Conversion Relations for Prefixed Units of Measure.- Relational Algebraic Approach to the Real Numbers - The Additive Group.</p>