Title of article
Complexity of t-tautologies Original Research Article
Author/Authors
Matthias Baaz، نويسنده , , Petr Hajek، نويسنده , , Franco Montagna، نويسنده , , Helmut Veith، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
9
From page
3
To page
11
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.
Journal title
Annals of Pure and Applied Logic
Serial Year
2001
Journal title
Annals of Pure and Applied Logic
Record number
889812
Link To Document