On the complexity of the Leibniz hierarchy
Logic
2019-08-05 v1
Abstract
We prove that the problem of determining whether a finite logical matrix determines an algebraizable logic is complete for EXPTIME. The same result holds for the classes of order algebraizable, weakly algebraizable, equivalential and protoalgebraic logics. Finally, the same problem for the class of truth-equational logic is shown to be hard for EXPTIME.
Keywords
Cite
@article{arxiv.1908.00924,
title = {On the complexity of the Leibniz hierarchy},
author = {T. Moraschini},
journal= {arXiv preprint arXiv:1908.00924},
year = {2019}
}