Fuzzy propositional languages are introduced as sets L of formulas closed with respect to two binary operations, the connectives "and" and "or", and two unary operations, the "diametrical" negation and the "intuitionistic" negation. A classical semantical structure is given by a set of states or worlds S and a logical value function f:LxS-->[0,1]. In this way, to each well formed formula from L we can associate an ordered pair of subsets of S, the certainly-true and the certainly-false domains. The language is so represented into the propositional logic based on the preclusivity space (S,#)
Semantical structures for Fuzzy Logics: an introductory approach
NISTICO', Giuseppe Antonio
1986-01-01
Abstract
Fuzzy propositional languages are introduced as sets L of formulas closed with respect to two binary operations, the connectives "and" and "or", and two unary operations, the "diametrical" negation and the "intuitionistic" negation. A classical semantical structure is given by a set of states or worlds S and a logical value function f:LxS-->[0,1]. In this way, to each well formed formula from L we can associate an ordered pair of subsets of S, the certainly-true and the certainly-false domains. The language is so represented into the propositional logic based on the preclusivity space (S,#)File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
