Decidable problems in shallow equational theories
- 2 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 255-265
- https://doi.org/10.1109/lics.1992.185538
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Proof transformations for equational theoriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Syntactic theories and unificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The theory of ground rewrite systems is decidablePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Equational inference, canonical proofs, and proof orderingsJournal of the ACM, 1994
- Complete axiomatizations of some quotient term algebrasPublished by Springer Nature ,1991
- SOLVING SYMBOLIC ORDERING CONSTRAINTSInternational Journal of Foundations of Computer Science, 1990
- Unification revisitedPublished by Springer Nature ,1988
- Positive First-Order Logic Is NP-CompleteIBM Journal of Research and Development, 1981
- Complexity of finitely presented algebrasPublished by Association for Computing Machinery (ACM) ,1977
- FrontispieceProceedings of the IEEE, 1963