Simple Word Problems in Universal Algebras

References

• The algebraic theory of semigroupsA. H. Clifford, G. B. Preston — 1964
• Review: M. H. A. Newman, On Theories with a Combinatorial Definition of "Equivalence."H. E. Vaughan — 1942
• On certain systems which are almost groupsHenry B. Mann — 1944
• Semi-Automated MathematicsJames R. Guard, F. C. Oglesby, James H. Bennett — 1969
• Definitions of a group and a field by independent postulatesL. E. Dickson — 1905
• Notes on central groupoidsDonald E. Knuth — 1970
• A Machine-Oriented Logic Based on the Resolution PrincipleJohn A. Robinson — 1965
• Products of Points—Some Simple Algebras and Their IdentitiesTrevor Evans — 1967
• On Theories with a Combinatorial Definition of "Equivalence"M. H. A. Newman — 1942
• A System Arising from a Weakened Set of Group PostulatesA. H. Clifford — 1933
• On multiplicative systems defined by generators and relationsTrevor Evans — 1951

Cited by

• Finitely Generated Weakly Reductive Commutative SemigroupsJ. C. Rosales, J. I. García-García — 2002
• A Term Rewriting Scheme for Function Symbols with Variable ArityManfred Widera, Christoph Beierle — 2001
• Termination, AC-Termination and Dependency Pairs of Term Rewriting SystemsKeiichirou Kusakari — 2000
• Système de règles de production et calcul de réécriture. (Production Rule Systems and Rewriting calculus)H. Dubois — 2001
• Synthesis by CompletionNachum Dershowitz — 1985
• PolyP—a polytypic programming language extensionPatrik Jansson, Johan Jeuring — 1997
• Decomposition Ordering as a Tool to Prove the Termination of Rewriting SystemsPierre Lescanne — 1981
• Termination of non-simple rewrite systemsNachum Dershowitz, C.G. Hoot — 1996
• A Unified Approach to Theory ReasoningPeter Baumgartner, Ulrich Furbach, Uwe Petermann — 2007
• Réécriture et Modularité pour les Politiques de Sécurité. (Term Rewriting and Modularity for Security Policies)Anderson Santana de Oliveira — 2008
• Associative-Commutative RewritingNachum Dershowitz, Jieh Hsiang, N. Alan Josephson — 1983
• An Implementation Kernel for Theorem Proving with Equality ClausesRobert Nieuwenhuis, José Miguel Rivero, Miguel A. Vallejo — 1996
• Complete Presentations of Direct Products of GroupsM. A. Borges-Trenard, Hebert Pérez‐Rosés — 1999
• Practical aspects of automated first-order reasoningKrystof Hoder — 2012
• Stari: a technique for high-bandwidth communicationMark R. Greenstreet — 1993
• Inductive Synt quat ionalNachum Dershowitz, Eli Pinchover — 1999
• The ZINC experiment : an economical implementation of the ML languageXavier Leroy — 1990
• Application of Automatic Transformations to Program VerificationRobert Veroff, Lawrence J. Henschen — 1981
• Termination of programs with strategy annotationsSalvador Lucas — 2003
• Rewriting Systems and Geometric Three-ManifoldsSusan Hermiller, Michael Shapiro — 1999

Related papers

No related papers recorded.