On n-syntactic equational theories

DOI10.1007/BFB0013843MaRDI QIDQ4246724zbMATH OpenFDO

Authors Alexandre Boudet, Evelyne Contejean

Publication date 29 July 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0013843

Mathematics Subject Classification ID

Logic in computer science (03B70) Equational classes, universal algebra in model theory (03C05) Logic programming (68N17) Grammars and rewriting systems (68Q42)

Recommendations

• Undecidable properties of syntactic theories
• Syntacticness, cycle-syntacticness and shallow theories
• Unification and matching in hierarchical combinations of syntactic theories
• Finite acyclic theories are unitary

Cited in

(5)

• Nested semantics over finite trees are equationally hard (invited talk)
• Unification and matching in hierarchical combinations of syntactic theories
• EQUATIONAL THEORIES GENERATED BY HYPERSUBSTITUTIONS OF TYPE (n)
• scientific article; zbMATH DE number 2087210 (Why is no real title available?)
• More problems in rewriting

This page was built for publication: On \(n\)-syntactic equational theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246724)