Unifiability and admissibility in finite algebras

Authors:
George Metcalfe;Christoph Röthlisberger
Affiliations:
Mathematics Institute, University of Bern, Bern, Switzerland;Mathematics Institute, University of Bern, Bern, Switzerland
Venue:
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Year:
2012

Citing 8
Cited 0

Automated deduction in multiple-valued logics

Automated deduction in multiple-valued logics
The Tableau-based Theorem Prover 3TAP Version 4.0

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Automated deduction for many-valued logics

Handbook of automated reasoning
Admissible Rules of Modal Logics

Journal of Logic and Computation
On unification for bounded distributive lattices

ACM Transactions on Computational Logic (TOCL)
Admissible Rules of Łukasiewicz Logic

Journal of Logic and Computation
A Tableau Method for Checking Rule Admissibility in S4

Electronic Notes in Theoretical Computer Science (ENTCS)
Bases of Admissible Rules of Łukasiewicz Logic

Journal of Logic and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unifiability of finite sets of equations and admissibility of quasiequations in finite algebras are decidable problems, but a naive approach is computationally unfeasible even for small algebras. Algorithms are given here for obtaining more efficient proof systems deciding these problems, and some applications of the algorithms are described.