Computational complexity of infinite-valued Łukasiewicz propositional logic

MaRDI QIDQ2784792zbMATH OpenFDO

Authors 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)

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 Łukasiewicz logic
• Resolution and model building in the infinite-valued calculus of Łukasiewicz

Cited in

(15)

• Complexity issues in Basic Logic
• Automated theorem proving for Łukasiewicz logics
• The complexity of admissible rules of Łukasiewicz logic
• ON LOWER BOUNDS FOR COMPLEXITY OVER INFINITE BASISES FOR FUNCTIONS OF MULTI-VALUED LOGIC
• Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
• Application of Łukasiewicz logics to algorithm design
• New complexity results for Łukasiewicz logic
• The complexity of 3-valued Łukasiewicz rules
• The coherence of Łukasiewicz assessments is NP-complete
• On the Expressive Power of Cost Logics over Infinite Words
• Implicit definability of truth constants in Łukasiewicz logic
• scientific article; zbMATH DE number 3888910 (Why is no real title available?)
• Finite-valued reductions of infinite-valued logics
• Finiteness in infinite-valued Łukasiewicz 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)