Skip Navigation


Journal of Logic and Computation Advance Access originally published online on July 26, 2006
Journal of Logic and Computation 2006 16(4):423-450; doi:10.1093/logcom/exl002
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
16/4/423    most recent
exl002v1
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 Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (8)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Montagna, F.
Right arrow Articles by Horcík, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

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

Original Articles

On Weakly Cancellative Fuzzy Logics

Franco Montagna

Department of Mathematics and Computer Science, University of Siena.

Carles Noguera

Artificial Intelligence Research Institute (IIIA), Spanish Council for Scientific Research (CSIC). E-mail: cnoguera{at}iiia.csic.es

Rostislav Horcík

Institute of Computer Science, Academy of Sciences of the Czech Republic. E-mail: horcik{at}cs.cas.cz

E-mail: montagna{at}unisi.it

Starting from a decomposition result of monoidal t-norm-based logic (MTL)-chains as ordinal sums, we focus our attention on a particular kind of indecomposable semihoops, namely weakly cancellative semihoops. The weak cancellation property is proved to be the difference between cancellation and pseudocomplementation, so it gives a new axiomatization of product logic and {Pi}MTL. By adding this property, some new fuzzy logics (propositional and first-order) are defined and studied obtaining some results about their (finite) strong standard completeness and other logical and algebraic properties.

Keywords: Algebraic logic; fuzzy logics; left-continuous t-norms; MTL-algebras; residuated lattices; weak cancellation


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]

Home page
 J Logic ComputationHome page
F. Bou, F. Esteva, J. M. Font, A. J. Gil, L. Godo, A. Torrens, and V. Verdu
Logics Preserving Degrees of Truth from Varieties of Residuated Lattices
J Logic Computation, June 26, 2009; (2009) exp030v1.
[Abstract] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.