In this paper we deal with generic expansions of rst-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 completenesss results for some other expansions. Namely, we prove that the expansions of predicate Product, Godel 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 Godel 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.
Esteva, F., Godo, L., NOGUERA CLOFENT, C. (2007). On completeness results for predicate Lukasiewicz, Product, Godel, and Nilpotent Minimum logics expanded with truth-constants. MATHWARE & SOFT COMPUTING, 14(3), 233-246.
On completeness results for predicate Lukasiewicz, Product, Godel, and Nilpotent Minimum logics expanded with truth-constants
Carles Noguera Clofent
2007-01-01
Abstract
In this paper we deal with generic expansions of rst-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 completenesss results for some other expansions. Namely, we prove that the expansions of predicate Product, Godel 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 Godel 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.File | Dimensione | Formato | |
---|---|---|---|
Esteva-Godo-Noguera-MSC-2007.pdf
accesso aperto
Tipologia:
PDF editoriale
Licenza:
Creative commons
Dimensione
219.73 kB
Formato
Adobe PDF
|
219.73 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/1200973