Satisfiability in many-valued sentential logic is NP-complete
- 31 December 1987
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 52 (1-2) , 145-153
- https://doi.org/10.1016/0304-3975(87)90083-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Every abelian l-group with two positive generators is ultrasimplicialJournal of Algebra, 1987
- Mapping abelian l-groups with strong unit one-one into MV algebrasJournal of Algebra, 1986
- Interpretation of AF C∗-algebras in Łukasiewicz sentential calculusJournal of Functional Analysis, 1986
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- Deterministic propositional dynamic logic: Finite models, complexity, and completenessJournal of Computer and System Sciences, 1982
- Intuitionistic propositional logic is polynomial-space completeTheoretical Computer Science, 1979
- The Computational Complexity of Provability in Systems of Modal Propositional LogicSIAM Journal on Computing, 1977
- Fragments of many-valued statement calculiTransactions of the American Mathematical Society, 1958
- A theorem about infinite-valued sentential logicThe Journal of Symbolic Logic, 1951