“…In this paper we focus on the following axiomatic extensions of MTL (EMTL will be introduced in Section 3): C 3 MTL, G, DP, GHP, WNM, RDP [7,2,14,1,19,31]. The first five are axiomatized as MTL plus, respectively, the following axioms:…”
Section: Syntaxmentioning
confidence: 99%
“…Concerning DP, we have that: [29,2].) Every DP-chain A with more than two elements has a coatom c. Moreover, the operations * and ⇒ of a such chain are the following ones, for every x, y ∈ A:…”
Section: Semanticsmentioning
confidence: 99%
“…Many of the logics mentioned in the preceding sections enjoy the standard completeness: [23,14,31,1,12,7].) Let L be one of MTL, C 3 MTL, G, GHP, WNM, RDP.…”
Section: Definitionmentioning
confidence: 99%
“…However, we have a weaker notion of standard completeness: as we will see in a moment, this is an approximation of standard completeness. [2].) For c ∈ (0, 1), let [0, 1] c be the DP-chain whose carrier is [0, c] ∪{1}.…”
Section: Definitionmentioning
confidence: 99%
“…In [29,21] the logic S 3 MTL was introduced, and in [2] it was renamed in DP. The reason for the new name is that, even if DP is not t-norm based, the monoidal operation * of every DP-chain is such that x * y = 0, if x, y < 1, and x * y = min{x, y} otherwise, as it happens for * D .…”
“…In this paper we focus on the following axiomatic extensions of MTL (EMTL will be introduced in Section 3): C 3 MTL, G, DP, GHP, WNM, RDP [7,2,14,1,19,31]. The first five are axiomatized as MTL plus, respectively, the following axioms:…”
Section: Syntaxmentioning
confidence: 99%
“…Concerning DP, we have that: [29,2].) Every DP-chain A with more than two elements has a coatom c. Moreover, the operations * and ⇒ of a such chain are the following ones, for every x, y ∈ A:…”
Section: Semanticsmentioning
confidence: 99%
“…Many of the logics mentioned in the preceding sections enjoy the standard completeness: [23,14,31,1,12,7].) Let L be one of MTL, C 3 MTL, G, GHP, WNM, RDP.…”
Section: Definitionmentioning
confidence: 99%
“…However, we have a weaker notion of standard completeness: as we will see in a moment, this is an approximation of standard completeness. [2].) For c ∈ (0, 1), let [0, 1] c be the DP-chain whose carrier is [0, c] ∪{1}.…”
Section: Definitionmentioning
confidence: 99%
“…In [29,21] the logic S 3 MTL was introduced, and in [2] it was renamed in DP. The reason for the new name is that, even if DP is not t-norm based, the monoidal operation * of every DP-chain is such that x * y = 0, if x, y < 1, and x * y = min{x, y} otherwise, as it happens for * D .…”
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.