Back to Search Start Over

Exact Unification and Admissibility

Authors :
Metcalfe, George
Cabrer, Leonardo
Source :
Logical Methods in Computer Science, Volume 11, Issue 3 (September 28, 2015) lmcs:1599
Publication Year :
2015

Abstract

A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rules for equational classes and non-classical logics. In this setting, unifiers of identities in an equational class are preordered, not by instantiation, but rather by inclusion over the corresponding sets of unified identities. Minimal complete sets of unifiers under this new preordering always have a smaller or equal cardinality than those provided by the standard instantiation preordering, and in significant cases a dramatic reduction may be observed. In particular, the classes of distributive lattices, idempotent semigroups, and MV-algebras, which all have nullary unification type, have unitary or finitary exact type. These results are obtained via an algebraic interpretation of exact unification, inspired by Ghilardi's algebraic approach to equational unification.<br />Comment: arXiv admin note: substantial text overlap with arXiv:1410.5583

Details

Database :
arXiv
Journal :
Logical Methods in Computer Science, Volume 11, Issue 3 (September 28, 2015) lmcs:1599
Publication Type :
Report
Accession number :
edsarx.1508.04360
Document Type :
Working Paper
Full Text :
https://doi.org/10.2168/LMCS-11(3:23)2015