Allegories: decidability and graph homomorphisms - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Allegories: decidability and graph homomorphisms


Allegories were introduced by Freyd and Scedrov; they form a fragment of Tarski's calculus of relations. We show that their equational theory is decidable by characterising it in terms of a specific class of graph homomorphisms. We actually do so for an extension of allegories which we prove to be conservative, namely allegories with top. This generalisation makes it possible to exploit the correspondence between terms and K4-free graphs, for which isomorphism was known to be finitely axiomatisable.
Fichier principal
Vignette du fichier
allegories.pdf (695.64 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01703906 , version 1 (08-02-2018)
hal-01703906 , version 2 (27-04-2018)



Damien Pous, Valeria Vignudelli. Allegories: decidability and graph homomorphisms. Logic in Computer Science, Jul 2018, Oxford, United Kingdom. ⟨10.1145/3209108.3209172⟩. ⟨hal-01703906v2⟩
191 View
950 Download



Gmail Mastodon Facebook X LinkedIn More