Unifiability and admissibility in finite algebras

DOI10.1007/978-3-642-30870-3_49zbMATH Open1358.03019OpenAlexW202894671MaRDI QIDQ2904444FDOQ2904444

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

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

Mathematics Subject Classification ID

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

Cited In (8)

• Algorithmic recognizability of the finiteness property of finite-definite systems
• A field guide to equational logic
• Special issue on admissible rules and unification
• Title not available (Why is that?)
• Title not available (Why is that?)
• Admissibility in finitely generated quasivarieties
• Decidable properties of finite sets of equations in trivial languages
• 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)