2 papers
math.LO2019
On the complexity of the Leibniz hierarchy
T. Moraschini
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 a…
math.LO2019
A computational glimpse at the Leibniz and Frege hierarchies
T. Moraschini
In this paper we consider, from a computational point of view, the problem of classifying logics within the Leibniz and Frege hierarchies typical of abstract algebraic logic. The m…