Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic

DOI10.1093/logcom/exn052zbMath1165.03009OpenAlexW2081347729MaRDI QIDQ3623218

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-algebraŁukasiewicz logiccoNP-completecomplexity of tautology problemKomori varieties

Mathematics Subject Classification ID

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

Related Items (6)

Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras ⋮ Complexity of some language fragments of fuzzy logics ⋮ Introduction ⋮ Triangular norm based predicate fuzzy logics ⋮ Arithmetical complexity of fuzzy predicate logics -- a survey. II. ⋮ On the complexity of validity degrees in Łukasiewicz logic

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