Lewis Dichotomies in Many-Valued Logics
- First Online:
- Cite this article as:
- Bova, S. Stud Logica (2012) 100: 1271. doi:10.1007/s11225-012-9450-7
- 122 Downloads
In 1979, H. Lewis shows that the computational complexity of the Boolean satisfiability problem dichotomizes, depending on the Boolean operations available to formulate instances: intractable (NP-complete) if negation of implication is definable, and tractable (in P) otherwise . Recently, an investigation in the same spirit has been extended to nonclassical propositional logics, modal logics in particular [2, 3]. In this note, we pursue this line in the realm of many-valued propositional logics, and obtain complexity classifications for the parameterized satisfiability problem of two pertinent samples, Kleene and Gödel logics.