Satisfiability in many-valued sentential logic is NP-complete
type: Item
instance of: scholarly article
title: Satisfiability in many-valued sentential logic is NP-complete
zbMATH Open document ID: 0639.03042
DOI: 10.1016/0304-3975(87)90083-1
author: Daniele Mundici
published in: Theoretical Computer Science
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03B50
zbMATH DE Number: 4041894
zbMATH Keywords: NP-completeness
zbMATH Keywords: many-valued sentential logics
zbMATH Keywords: infinite-valued calculus of Łukasiewicz
MaRDI profile type: Publication
full work available at URL: 0304-3975(87)90083-1
OpenAlex ID: W2087171264
cites work: Deterministic propositional dynamic logic: finite models, complexity, and completeness
cites work: Q4747150
cites work: The complexity of theorem-proving procedures
cites work: Q4126264
cites work: Q4198056
cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic
cites work: A theorem about infinite-valued sentential logic
cites work: Mapping Abelian \(\ell\)-groups with strong unit one-one into MV algebras
cites work: Every Abelian \(\ell\)-group with two positive generators is ultrasimplicial
cites work: Interpretation of AF \(C^*\)-algebras in Łukasiewicz sentential calculus
cites work: Q3338105
cites work: Q5667781
cites work: Fragments of Many-Valued Statement Calculi
cites work: The complexity of propositional linear temporal logics
cites work: Intuitionistic propositional logic is polynomial-space complete
description: scientific article; zbMATH DE number 4041894