Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic

DOI10.1093/LOGCOM/EXN052MaRDI QIDQ3623218zbMATH OpenOpenAlexFDO

Authors Petr Hájek, Petr Cintula

Publication date 16 April 2009

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exn052

zbMATH Keywords

MV-algebracoNP-completeŁukasiewicz logiccomplexity of tautology problemKomori varieties

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Many-valued logic (03B50) MV-algebras (06D35) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• On the complexity of validity degrees in Łukasiewicz logic
• New complexity results for Łukasiewicz logic
• The complexity of admissible rules of Łukasiewicz logic
• scientific article; zbMATH DE number 4075030
• Finite axiomatizability in Łukasiewicz logic
• scientific article; zbMATH DE number 3274717
• Computational complexity of infinite-valued Łukasiewicz propositional logic
• Computer Science Logic
• Extensions of the \(\aleph_ 0\)-valued Łukasiewicz propositional logic
• The complexity of the disjunction and existential properties in intuitionistic logic

Cited in

(17)

• Computational complexity of infinite-valued Łukasiewicz propositional logic
• Complexity issues in Basic Logic
• On the complexity of validity degrees in Łukasiewicz logic
• Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras
• The complexity of admissible rules of Łukasiewicz logic
• scientific article; zbMATH DE number 2047465 (Why is no real title available?)
• Computational complexities of axiomatic extensions of monoidal t-norm based logic
• Finite axiomatizability in Łukasiewicz logic
• Chang's Ł^*Logic
• Complexity of t-tautologies
• The coherence of Łukasiewicz assessments is NP-complete
• Arithmetical complexity of fuzzy predicate logics -- a survey. II.
• Triangular norm based predicate fuzzy logics
• Complexity of some language fragments of fuzzy logics
• Introduction
• An asymptotically tight bound on countermodels for Łukasiewicz logic
• A note on minimal axiomatisations of some extensions of MTL

This page was built for publication: Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623218)