The negation elimination from syntactic equational formula is decidable

DOI10.1007/978-3-662-21551-7_24MaRDI QIDQ5055804zbMATH OpenOpenAlexFDO

Authors Mohamed Tajine

Publication date 9 December 2022

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-21551-7_24

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Decidability of theories and sets of sentences (03B25) Equational classes, universal algebra in model theory (03C05)

Recommendations

• scientific article; zbMATH DE number 1670857
• Negation elimination in equational formulae (extended abstract)
• Negation elimination in empty or permutative theories
• AC complement problems: Satisfiability and negation elimination
• scientific article; zbMATH DE number 176121

Cites work

• scientific article; zbMATH DE number 3649012 (Why is no real title available?)
• scientific article; zbMATH DE number 176121 (Why is no real title available?)
• A Machine-Oriented Logic Based on the Resolution Principle
• An Efficient Unification Algorithm
• An almost linear Robinson unification algorithm
• Automatic proofs by induction in theories without constructors
• Explicit representation of terms defined by counter examples
• Linear unification
• The algebraic specification of abstract data types

Cited in

(6)

• scientific article; zbMATH DE number 176121 (Why is no real title available?)
• Explicit versus implicit representations of subsets of the Herbrand universe.
• Equational formulas and pattern operations in initial order-sorted algebras
• Negation elimination in equational formulae (extended abstract)
• More problems in rewriting
• scientific article; zbMATH DE number 1670857 (Why is no real title available?)

This page was built for publication: The negation elimination from syntactic equational formula is decidable

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