A proof of standard completeness for non-commutative monoidal t-norm logic

Title:

A proof of standard completeness for non-commutative monoidal t-norm logic

Creator:

Jenei, Sándor and Montagna, Franco

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:41cb8ff6-6a1a-41e5-a617-6f1a6624e3e3
uuid:41cb8ff6-6a1a-41e5-a617-6f1a6624e3e3

Subject:

many-valued logics, non-commutative t-norms, and standard semantics

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

In [6] we proved that tlie monoidal t-norm logic MTL introduced by Esteva and Godo in [4] is the logic of left-continuons t-norms and their residuals. Recently, the Ruinenian school, P. Hájek and others investigated in deep noncommutative t-norms. Tlins it is natural to look for the logic of left-continuons non-commutative t-norms. This is precisely what we do in this paper. The proof is a combination of the inethod used in [6] and of results by .J. Kühn in [13] and by P. Hájek in [9].

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Source:

Neural network world: international journal on neural and mass-parallel computing and information systems | 2003 Volume:13 | Number:5

Harvested from:

CDK

Metadata only:

false