Negation elimination in empty or permutative theories

DOI10.1006/JSCO.1998.0203MaRDI QIDQ1264437zbMATH OpenOpenAlexFDO

Authors Maribel Fernández

Publication date 19 January 1999

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jsco.1998.0203

zbMATH Keywords

equational formulatransformation rulesunification problem

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)

Recommendations

• Negation elimination in equational formulae (extended abstract)
• scientific article; zbMATH DE number 1670857
• The negation elimination from syntactic equational formula is decidable
• scientific article; zbMATH DE number 4080961
• Equational problems and disunification

Cited in

(14)

• Equational problems and disunification
• Explicit versus implicit representations of subsets of the Herbrand universe.
• Nominal equational problems
• Equational formulas and pattern operations in initial order-sorted algebras
• scientific article; zbMATH DE number 1670857 (Why is no real title available?)
• scientific article; zbMATH DE number 176121 (Why is no real title available?)
• The negation elimination from syntactic equational formula is decidable
• Negation elimination in equational formulae (extended abstract)
• Automated Reasoning
• Equational formulas and pattern operations in initial order-sorted algebras
• General algorithms for permutations in equational inference
• Difference of constrained patterns in logically constrained term rewrite systems
• Complete axiomatizations of some quotient term algebras
• A nominal approach to equational problems in languages with binders

This page was built for publication: Negation elimination in empty or permutative theories

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