Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic
- 14 August 2008
- journal article
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 19 (2) , 245-260
Abstract
In this article, the computational complexity of all axiomatic extensions of Łukasiewicz propositional logic Ł and the arithmetical complexity of both the general and standard semantics of their corresponding predicate logics is determined.Keywords
This publication has 8 references indexed in Scilit:
- On theories and models in fuzzy predicate logicsThe Journal of Symbolic Logic, 2006
- MV-algebras: a variety for magnitudes with archimedean unitsAlgebra universalis, 2005
- Universal Classes of MV-chains with Applications to Many-valued LogicsMathematical Logic Quarterly, 2002
- Fuzzy Logic and Arithmetical Hierarchy IIIStudia Logica, 2001
- Satisfiability in many-valued sentential logic is NP-completeTheoretical Computer Science, 1987
- Super-Łukasiewicz propositional logicsNagoya Mathematical Journal, 1981
- Die nichtaxiomatisierbarkeit des unendlichwertigen Prädikatenkalküls von ŁukasiewiczThe Journal of Symbolic Logic, 1962
- Fragments of many-valued statement calculiTransactions of the American Mathematical Society, 1958