scientific article; zbMATH DE number 1300966

zbMATH Open0925.03159MaRDI QIDQ4246724FDOQ4246724

Authors: Alexandre Boudet, Evelyne Contejean 

Publication date: 29 July 1999

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (5)

• More problems in rewriting
• Title not available (Why is that?)
• Unification and matching in hierarchical combinations of syntactic theories
• Nested semantics over finite trees are equationally hard (invited talk)
• EQUATIONAL THEORIES GENERATED BY HYPERSUBSTITUTIONS OF TYPE (n)

This page was built for publication:

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