Determining whether the logic of a finite reduced matrix is algebraizable, weakly algebraizable, equivalential, protoalgebraic, or order algebraizable is EXPTIME-complete; for truth-equational logic it is EXPTIME-hard.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the complexity of the Leibniz hierarchy
Determining whether the logic of a finite reduced matrix is algebraizable, weakly algebraizable, equivalential, protoalgebraic, or order algebraizable is EXPTIME-complete; for truth-equational logic it is EXPTIME-hard.