2024-03-28T10:33:31Zhttp://digital.csic.es/dspace-oai/requestoai:digital.csic.es:10261/1609672020-12-10T07:26:55Zcom_10261_60com_10261_4col_10261_313
Savicky, Petr
Cignoli, Roberto
Esteva, Francesc
Godo, Lluis
Noguera, Carles
2018-02-19T18:10:25Z
2018-02-19T18:10:25Z
2006
Journal of Logic and Computation 16: 205- 225 (2006)
http://hdl.handle.net/10261/160967
10.1093/logcom/exi075
http://dx.doi.org/10.13039/501100003339
Product Logic Π 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 <rmacr> for each r in a countable Π-subalgebra <Cscr> of [0, 1]) and by adding the corresponding book-keeping axioms for the truthconstants. We first show that the corresponding logics Π(<Cscr>) are algebraizable, and hence complete with respect to the variety of Π(<Cscr>)-algebras. The main result of the paper is the canonical standard completeness of these logics, that is, theorems of Π(<Cscr>) 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 Π-formulas of the kind <rmacr> → φ, where <rmacr> is a truth-constant and φ a formula not containing truth-constants. Finally we consider the logics Π(Δ)(<Cscr>), the expansion of Π(<Cscr>) with the well-known Baaz's projection connective Δ, and we show canonical finite strong standard completeness for them.
eng
openAccess
Standard completeness
Truth-constants
Fuzzy logic
Product logic
Non-classical logic
On product logic with truth-constants
artículo