Unifiability and admissibility in finite algebras

DOI10.1007/978-3-642-30870-3_49MaRDI QIDQ2904444zbMATH OpenOpenAlexFDO

Authors George Metcalfe, Christoph Röthlisberger

Publication date 14 August 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30870-3_49

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Applications of universal algebra in computer science (08A70)

Recommendations

• Admissibility in finitely generated quasivarieties
• scientific article; zbMATH DE number 1304317
• TAFA -- a tool for admissibility in finite algebras
• scientific article; zbMATH DE number 4089519
• Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras

Cited in

(8)

• scientific article; zbMATH DE number 822095 (Why is no real title available?)
• scientific article; zbMATH DE number 4154512 (Why is no real title available?)
• Special issue on admissible rules and unification
• Decidable properties of finite sets of equations in trivial languages
• Admissibility in finitely generated quasivarieties
• A field guide to equational logic
• Algorithmic recognizability of the finiteness property of finite-definite systems
• TAFA -- a tool for admissibility in finite algebras

This page was built for publication: Unifiability and admissibility in finite algebras

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