A t-tautology (triangular tautology) is a propositional formula which is a tautology in all fuzzy logics defined by continuous triangular norms. In this paper we show that the problem of recognizing t-tautologies is coNP complete, and thus decidable. (C) 2002 Published by Elsevier Science B.V.
Baaz, M., Hájek, P., Montagna, F., Veith, H. (2002). Complexity of t-tautologies. ANNALS OF PURE AND APPLIED LOGIC, 113(1-3), 3-12 [10.1016/S0168-0072(01)00048-3].
Complexity of t-tautologies
Montagna F.;
2002-01-01
Abstract
A t-tautology (triangular tautology) is a propositional formula which is a tautology in all fuzzy logics defined by continuous triangular norms. In this paper we show that the problem of recognizing t-tautologies is coNP complete, and thus decidable. (C) 2002 Published by Elsevier Science B.V.
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.
Utilizza questo identificativo per citare o creare un link a questo documento:
https://hdl.handle.net/11365/17613
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo