Skip Navigation

Journal of Logic and Computation 2006 16(2):205-225; doi:10.1093/logcom/exi075
This Article
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 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 (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Savicky, P.
Right arrow Articles by Noguera, C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Vol. 16 No. 2, © The Author, 2006. Published by Oxford University Press. All rights reserved.

Original Articles

On Product Logic with Truth-constants

Petr Savicky1, Roberto Cignoli2, Francesc Esteva3, Lluís Godo3 and Carles Noguera3

1 Institute of Computer Science, Academy of Sciences of the Czech Republic, 182 07 Praha 8, Czech Republic. Email: savicky{at}cs.cas.cz, 2 Instituto Argentino de Matemática - CONICET, Saavedra 15, piso 3, C1083ACA Buenos Aires, Argentina. Email: cignoli{at}dm.uba.ar, 3 Institut d'Investigació en Intel·ligència Artificial - CSIC, 08193 Bellaterra, Spain. Email: {esteva,godo,cnoguera}{at}iiia.csic.es

Product Logic {Pi} is an axiomatic extension of Hájek's Basic Fuzzy Logic BL coping with the 1-tautologies when the strong conjunction & and implication -> are interpreted by the product of reals in [0, 1] and its residuum respectively. In this paper we investigate expansions of Product Logic by adding into the language a countable set of truth-constants (one truth-constant r for each r in a countable {Pi}-subalgebra C of [0, 1]) and by adding the corresponding book-keeping axioms for the truthconstants. We first show that the corresponding logics {Pi}(C) are algebraizable, and hence complete with respect to the variety of {Pi}(C)-algebras. The main result of the paper is the canonical standard completeness of these logics, that is, theorems of {Pi}(C) are exactly the 1-tautologies of the algebra defined over the real unit interval where the truth-constants are interpreted as their own values. It is also shown that they do not enjoy the canonical strong standard completeness, but they enjoy it for finite theories when restricted to evaluated {Pi}-formulas of the kind r -> {varphi}, where r is a truth-constant and {varphi} a formula not containing truth-constants. Finally we consider the logics {Pi}{Delta}(C), the expansion of {Pi}(C) with the well-known Baaz's projection connective {Delta}, and we show canonical finite strong standard completeness for them.

Keywords: Non-classical logic, fuzzy logic, Product Logic, truth-constants, standard completeness

Received 2 August 2005.


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
E. Marchioni
On Computational Complexity of Semilinear Varieties
J Logic Computation, June 27, 2008; (2008) exn017v1.
[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.