Skip Navigation


Journal of Logic and Computation Advance Access originally published online on August 14, 2008
Journal of Logic and Computation 2009 19(2):245-260; doi:10.1093/logcom/exn052
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cintula, P.
Right arrow Articles by Hájek, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Corner Article

Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic

Petr Cintula and Petr Hájek *

Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod Vodárenskou vezí 2, 182 07 Prague, Czech Republic.E-mail: cintula{at}cs.cas.cz, hajek{at}cs.cas.cz

Received 15 December 2007.

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.

Keywords: Lukasiewicz logic; computational complexity; Komori algebras; MV-algebras

*The work of the first author was partly supported by project 1M0545 of the Ministry of Education, Youth and Sports of the Czech Republic and partly by the Institutional Research Plan AV0Z10300504. The work of the second author was partly supported by grant A100300503 of the Grant Agency of the Academy of Sciences of the Czech Republic and partly by the Institutional Research Plan AV0Z10300504.



References

  1. Chang CC. Algebraic analysis of many-valued logics. Transactions American Mathematical Society (1958) 88:456–490.
  2. Cignoli R, D'Ottaviano IML, Mundici D. Algebraic Foundations of Many-Valued Reasoning. In: volume 7 of Trends in Logic (1999) Dordercht: Kluwer.
  3. Cintula P, Esteva F, Gispert J, Godo L, Montagna F, Noguera C. Distinguished algebraic semantics for t-norm based fuzzy logics: Methods and algebraic equivalencies. Submitted for publication.
  4. Gispert J. Universal classes of MV-chains with applications to many-valued logics. Mathematical Logic Quarterly (2002) 48:581–601.[CrossRef][Web of Science]
  5. Gispert J, Mundici D. MV-algebras: a variety for magnitudes with archimedean units. Algebra Universalis (2005) 53:7–43.[CrossRef][Web of Science]
  6. Hájek P. Metamathematics of Fuzzy Logic. In: volume 4 of Trends in Logic (1998) Dordercht: Kluwer.
  7. Hájek P. Fuzzy logic and arithmetical hierarchy III. Studia Logica (2001) 68:129–142.[CrossRef]
  8. Hájek P, Cintula P. On theories and models in fuzzy predicate logics. Journal of Symbolic Logic (2006) 71:863–880.[CrossRef][Web of Science]
  9. Hájek P, Cintula P. Triangular norm predicate fuzzy logics. Fuzzy Logic and Related Structures: Proceedings of Linz Seminar—Gottwald S, Hájek P, Klement EP, eds. (2005) In press.
  10. Komori Y. Super-Lukasiewicz propositional logics. Nagoya Mathematical Journal (1981) 84:119–133.[Web of Science]
  11. Lukasiewicz J. O logice trojwartosciowej (On three-valued logic). Ruch filozoficzny (1920) 5:170–171.
  12. Lukasiewicz J, Tarski A. Untersuchungen über den Aussagenkalkül (Investigations of the propositional calculus). Comptes Rendus des Séances de la Société des Sciences et des Lettres de Varsovie (1930) 23:30–50.
  13. Mundici D. Satisfiability in many-valued sentential logic is NP-complete. Theoretical Computer Science (1987) 52:145–153.[CrossRef][Web of Science]
  14. Ragaz ME. Arithmetische Klassifikation von Formelmengen der unendlichwertigen Logik. In: PhD Thesis (1981) Zurich: ETH.
  15. Rogers H Jr. Theory of Recursive Functions and Effective Computability. (1967) New York: McGraw-Hill.
  16. Rose A, Rosser JB. Fragments of many-valued statement calculi. Transactions of the American Mathematical Society (1958) 87:1–53.[CrossRef]
  17. Scarpellini B. Die Nichtaxiomatisierbarkeit des unendlichwertigen Prädikatenkalküls von Lukasiewicz. Journal of Symbolic Logic (1962) 27:159–170.[CrossRef]
  18. Schrijver A. Theory of Linear and Integral Programming.Wiley-Interscience Series in Discrete Mathematics and Optimization. (1998) Chichester: JohnWilley & Sons.

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 J Logic ComputationHome page
F. Montagna and C. Noguera
Arithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics
J Logic Computation, September 17, 2009; (2009) exp052v1.
[Abstract] [PDF]

This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cintula, P.
Right arrow Articles by Hájek, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?