@inproceedings{77ff00f213f5457294b91cd151e488ea,
title = "Representable and diagonally representable weakening relation algebras",
abstract = "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.",
keywords = "weakening relation algebra, relevance frames, Sugihara monoids, representation games",
author = "Peter Jipsen and Ja{\v s} {\v S}emrl",
year = "2023",
month = mar,
day = "8",
doi = "10.1007/978-3-031-28083-2_9",
language = "English",
isbn = "9783031280825",
series = "Lecture Notes in Computer Science",
publisher = "Springer Cham",
pages = "140--157",
editor = "R. Gl{\"u}ck and L. Santocanale and M. Winter",
booktitle = "Relational and Algebraic Methods in Computer Science. RAMiCS 2023.",
}