Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic

Authors: Petr Cintula, Petr Hájek
Publication year: 2009
Publication type: Článek v odborném periodiku
Periodical: Journal of Logic and Computation
Projects: Institute for Theoretical Computer Science
Mathematical foundation of inference and decision under uncertainty
Bibliographic citation: CINTULA, Petr, HÁJEK, Petr. Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic. Journal of Logic and Computation. 2009, 19(2), 245-260. ISSN 0955-792X. E-ISSN 1465-363X
Dostupné z: doi:10.1093/logcom/exn052
DOI: 10.1093/logcom/exn052
ID: 310569

Abstract

In this article, the computational complexity of all axiomatic extensions of Lukasiewicz propositional logic L and the arithmetical complexity of both the general and standard semantics of their corresponding predicate logics is determined.