Satisfiability in many-valued sentential logic is NP-complete (Q1100196): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(87)90083-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2087171264
@@ Property / OpenAlex ID: W2087171264 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic propositional dynamic logic: finite models, complexity, and completeness
+Normal rank
@@ Property / cites work @@
+Q4747150
@@ Property / cites work: Q4747150 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4126264
@@ Property / cites work: Q4126264 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Provability in Systems of Modal Propositional Logic
+Normal rank
@@ Property / cites work @@
+A theorem about infinite-valued sentential logic
@@ Property / cites work: A theorem about infinite-valued sentential logic / rank @@
+Normal rank
@@ Property / cites work @@
+Mapping Abelian \(\ell\)-groups with strong unit one-one into MV algebras
+Normal rank
@@ Property / cites work @@
+Every Abelian \(\ell\)-group with two positive generators is ultrasimplicial
+Normal rank
@@ Property / cites work @@
+Interpretation of AF \(C^*\)-algebras in Łukasiewicz sentential calculus
+Normal rank
@@ Property / cites work @@
+Q3338105
@@ Property / cites work: Q3338105 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5667781
@@ Property / cites work: Q5667781 / rank @@
+Normal rank
@@ Property / cites work @@
+Fragments of Many-Valued Statement Calculi
@@ Property / cites work: Fragments of Many-Valued Statement Calculi / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of propositional linear temporal logics
+Normal rank
@@ Property / cites work @@
+Intuitionistic propositional logic is polynomial-space complete
+Normal rank