scientific article; zbMATH DE number 1765696

MaRDI QIDQ4539637zbMATHFDO

Authors

Publication date 10 July 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2083/20830499

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Complexity of linear standard theories
• scientific article; zbMATH DE number 4041328
• On equational theories, unification, and (un)decidability
• The unification hierarchy is undecidable
• Combination problems for commutative/monoidal theories or how algebra can help in equational unification

Cited in

(5)

• Complexity of linear standard theories
• On the complexity of equational decision problems for finite height complemented and orthocomplemented modular lattices
• Canonical ground Horn theories
• Unions of Equational Monadic Theories
• Variant-Based Satisfiability in Initial Algebras

This page was built for publication:

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