Document Type

Conference Proceeding

Publication Date



A binary relation defined on a poset is a weakening relation if the partial order acts as a both-sided compositional identity. This is motivated by the weakening rule in sequent calculi and closely related to models of relevance logic. For a fixed poset the collection of weakening relations is a subreduct of the full relation algebra on the underlying set of the poset. We present a two-player game for the class of representable weakening relation algebras akin to that for the class of representable relation algebras. This enables us to define classes of abstract weakening relation algebras that approximate the quasivariety of representable weakening relation algebras. We give explicit finite axiomatisations for some of these classes. We define the class of diagonally representable weakening relation algebras and prove that it is a discriminator variety. We also provide explicit representations for several small weakening relation algebras.


This is a pre-copy-editing, author-produced PDF of an article accepted for publication in Relational and Algebraic Methods in Computer Science. RAMiCS 2023. Lecture Notes in Computer Science, volume 13896, in 2023. The final publication may differ and is available at Springer via


The authors

Available for download on Friday, March 08, 2024