Computational complexity of infinite-valued Łukasiewicz propositional logic

zbMATH Open0990.03016MaRDI QIDQ2784792FDOQ2784792

H. Wagner

Publication date: 25 July 2002

zbMATH Keywords

consequence relationNP-completenesssatisfiability probleminfinite-valued Łukasiewicz propositional logic

Mathematics Subject Classification ID

Many-valued logic (03B50) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (7)

• Automated theorem proving for Łukasiewicz logics
• ON LOWER BOUNDS FOR COMPLEXITY OVER INFINITE BASISES FOR FUNCTIONS OF MULTI-VALUED LOGIC
• On the Expressive Power of Cost Logics over Infinite Words
• Title not available (Why is that?)
• Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic
• Finiteness in infinite-valued Łukasiewicz logic
• Finite-valued reductions of infinite-valued logics

   Recommendations

• Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic 👍 👎
• The coherence of Łukasiewicz assessments is NP-complete 👍 👎
• Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics 👍 👎
• The complexity of admissible rules of Lukasiewicz logic 👍 👎
• Resolution and model building in the infinite-valued calculus of Łukasiewicz 👍 👎

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)