@inproceedings{f6f9d31ef2fb4750a0c9cbf27b002106,
title = "Implication algebras and implication semigroups of binary relations",
abstract = "Representable implication algebras are known to be axiomatised by a finite number of equations (making the representation and finite representation problems decidable here). We show that this also holds in the context of unary (and binary) relations and present a Stone-style representation theorem. We then show that the (finite) representation decision problem is undecidable for implication semigroups, in stark contrast with implication algebras.",
keywords = "implication algebras, implication semigroups, representability as binary relations",
author = "Andrew Lewis-Smith and Ja{\v s} {\v S}emrl",
year = "2023",
month = mar,
day = "8",
doi = "10.1007/978-3-031-28083-2_12",
language = "English",
isbn = "9783031280825",
series = "Lecture Notes in Computer Science",
publisher = "Springer Cham",
pages = "194--207",
editor = "R. Gl{\"u}ck and L. Santocanale and M. Winter",
booktitle = "Relational and Algebraic Methods in Computer Science. RAMiCS 2023.",
}