@inproceedings{10.1007/978-3-030-02149-8_6,
    Abstract = {Let S be a subset of the signature of relation algebra. Let R(S) be the closure under isomorphism of the class of proper S-structures and let F(S) be the closure under isomorphism of the class of proper S-structures over finite bases. Based on previous work, we prove that membership of R(S) is undecidable when {\$}{\$}S{\backslash}supseteq {\backslash}{\{}{\backslash}cdot , +, ;{\backslash}{\}},{\backslash}; S{\backslash}supseteq {\backslash}{\{}{\backslash}cdot , {\{}{\}}^{\{}{\backslash}smile {\}}, ;{\backslash}{\}}{\$}{\$}or {\$}{\$}{\{}{\}}^{\{}{\backslash}smile {\}}{\backslash}not {\backslash}in S{\backslash}supseteq {\backslash}{\{}{\backslash}le , -, ;{\backslash}{\}}{\$}{\$}, and for any of these signatures S if converse is excluded from S then membership of F(S) is also undecidable, for finite S-structures.},
    Address = {Cham},
    Author = {Hirsch, Robin},
    BookTitle = {Relational and Algebraic Methods in Computer Science},
    Editor = {Desharnais, Jules and Guttmann, Walter and Joosten, Stef},
    File = {Decidability of Equational Theories for Subsignatures of Relation Algebra - Hirsch2018\_Chapter\_DecidabilityOfEquationalTheori.pdf},
    ISBN = {978-3-030-02149-8},
    Pages = {87--96},
    Publisher = {Springer International Publishing},
    Title = {Decidability of Equational Theories for Subsignatures of Relation Algebra},
    Year = {2018},
    date-added = {2022-02-17 10:39:14 +0100},
    date-modified = {2022-02-17 10:39:14 +0100},
    file-2 = {Decidability of equational theories for subsignatures of relation algebra - Hirsch\_ramics.pdf},
    doi = {10.1007/978-3-030-02149-8_6}
}

@inproceedings{10.1007/978-3-030-02149-8_6, Abstract = {Let S be a subset of the signature of relation algebra. Let R(S) be the closure under isomorphism of the class of proper S-structures and let F(S) be the closure under isomorphism of the class of proper S-structures over finite bases. Based on previous work, we prove that membership of R(S) is undecidable when {\$}{\$}S{\backslash}supseteq {\backslash}{{}{\backslash}cdot , +, ;{\backslash}{}},{\backslash}; S{\backslash}supseteq {\backslash}{{}{\backslash}cdot , {{}{}}^{{}{\backslash}smile {}}, ;{\backslash}{}}{\$}{\$}or {\$}{\$}{{}{}}^{{}{\backslash}smile {}}{\backslash}not {\backslash}in S{\backslash}supseteq {\backslash}{{}{\backslash}le , -, ;{\backslash}{}}{\$}{\$}, and for any of these signatures S if converse is excluded from S then membership of F(S) is also undecidable, for finite S-structures.}, Address = {Cham}, Author = {Hirsch, Robin}, BookTitle = {Relational and Algebraic Methods in Computer Science}, Editor = {Desharnais, Jules and Guttmann, Walter and Joosten, Stef}, File = {Decidability of Equational Theories for Subsignatures of Relation Algebra - Hirsch2018_Chapter_DecidabilityOfEquationalTheori.pdf}, ISBN = {978-3-030-02149-8}, Pages = {87--96}, Publisher = {Springer International Publishing}, Title = {Decidability of Equational Theories for Subsignatures of Relation Algebra}, Year = {2018}, date-added = {2022-02-17 10:39:14 +0100}, date-modified = {2022-02-17 10:39:14 +0100}, file-2 = {Decidability of equational theories for subsignatures of relation algebra - Hirsch_ramics.pdf}, doi = {10.1007/978-3-030-02149-8_6} }