Complexity of t-tautologies

@article{Baaz2001ComplexityOT,
  title={Complexity of t-tautologies},
  author={Matthias Baaz and Petr H{\'a}jek and Franco Montagna and Helmut Veith},
  journal={Ann. Pure Appl. Logic},
  year={2001},
  volume={113},
  pages={3-11}
}
A t-tautology (triangular tautology) is a propositional formula which is a tautology in all fuzzy logics deened by continuous triangular norms. In this paper we show that the problem of recognizing t-tautologies is coNP complete, and thus decidable.