On completeness results for predicate lukasiewicz, product, gödel and nilpotent minimum logics expanded with truth-constants
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2099/10931
Tipus de documentArticle
Data publicació2007
EditorUniversitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
In this paper we deal with generic expansions of first-order predicate logics of some left-continuous t-norms with a countable set of truth-constants. Besides already known results for the case of Lukasiewicz logic, we obtain new conservativeness and completeness results for some other expansions. Namely, we prove that the expansions of predicate Product, Gödel and Nilpotent Minimum logics with truth-constants are conservative, which already implies the failure of standard completeness for the case of Product logic. In contrast, the expansions of predicate Gödel and Nilpotent Minimum logics are proved to be strong standard complete but, when the semantics is restricted to the canonical algebra, they are proved to be complete only for tautologies. Moreover, when the language is restricted to evaluated formulae we prove canonical completeness for deductions from finite sets of premises.
CitacióEsteva Massaguer, Francesc; Godo, L.; Noguera, C. On completeness results for predicate lukasiewicz, product, gödel and nilpotent minimum logics expanded with truth-constants. "Mathware & Soft Computing", 2007, vol. 14, núm. 3, p. 233-246.
ISSN1134-5632
Col·leccions
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
05_Esteva.pdf | 204,9Kb | Visualitza/Obre |