In this paper we shall propose a method for the reduction of the problem of decidability in propositional infinite-valued Product Logic to suitably determined finite-valued approximating logics. In order to do so, functions associated with formulas of Product logic are defined and their properties are exploited
Finite-Valued Approximations of Product Logic
2000-01-01
Abstract
In this paper we shall propose a method for the reduction of the problem of decidability in propositional infinite-valued Product Logic to suitably determined finite-valued approximating logics. In order to do so, functions associated with formulas of Product logic are defined and their properties are exploitedFile 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.
