Computational complexity of infinite-valued Łukasiewicz propositional logic
From MaRDI portal
Publication:2784792
zbMATH Open0990.03016MaRDI QIDQ2784792
Publication date: 25 July 2002
NP-completenessconsequence relationsatisfiability probleminfinite-valued Łukasiewicz propositional logic
Complexity of computation (including implicit computational complexity) (03D15) Many-valued logic (03B50)
Related Items (3)
On the Expressive Power of Cost Logics over Infinite Words ⋮ ON LOWER BOUNDS FOR COMPLEXITY OVER INFINITE BASISES FOR FUNCTIONS OF MULTI-VALUED LOGIC ⋮ Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic
This page was built for publication: Computational complexity of infinite-valued Łukasiewicz propositional logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784792)
