The first order theory of primal grammars is decidable

DOI10.1016/j.tcs.2004.04.007zbMath1078.68066OpenAlexW2009051047MaRDI QIDQ1882903

Nicolas Peltier

Publication date: 1 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.04.007

zbMATH Keywords

Primal grammarsTerm schematization

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (2)

Simplified handling of iterated term schemata ⋮ A complete superposition calculus for primal grammars

Cites Work

• Equational problems and disunification
• A method for simultaneous search for refutations and models by equational constraint solving
• Increasing model building capabilities by constraint solving on terms with integer exponents
• Unification of infinite sets of terms schematized by primal grammars
• Negation and constraint logic programming
• On unification of terms with integer exponents
• An improved lower bound for the elementary theories of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The first order theory of primal grammars is decidable