Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic

DOI10.1093/LOGCOM/EXN052zbMATH Open1165.03009OpenAlexW2081347729MaRDI QIDQ3623218FDOQ3623218

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)

Cited In (7)

• On the complexity of validity degrees in Łukasiewicz logic
• Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras
• 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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The complexity of the disjunction and existential properties in intuitionistic logic 👍 👎
• Computer Science Logic 👍 👎
• The complexity of admissible rules of Lukasiewicz logic 👍 👎
• New complexity results for Łukasiewicz logic 👍 👎
• Finite axiomatizability in Łukasiewicz logic 👍 👎
• Extensions of the \(\aleph_ 0\)-valued Łukasiewicz propositional logic 👍 👎
• On the complexity of validity degrees in Łukasiewicz logic 👍 👎
• Computational complexity of infinite-valued Łukasiewicz propositional logic 👍 👎

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)