Complexity of t-tautologies
From MaRDI portal
Publication:5957903
DOI10.1016/S0168-0072(01)00048-3zbMath1006.03022MaRDI QIDQ5957903
Franco Montagna, Helmut Veith, Matthias Baaz, Petr Hájek
Publication date: 6 March 2003
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Fuzzy logic; logic of vagueness (03B52) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (17)
A new interpretation of complex membership grade ⋮ Franco Montagna's work on provability logic and many-valued logic ⋮ Standard algebras for fuzzy propositional calculi ⋮ Linearly ordered semigroups for fuzzy set theory ⋮ Computational complexities of axiomatic extensions of monoidal t-norm based logic ⋮ Fuzzy logics based on \([0,1)\)-continuous uninorms ⋮ The Differential Semantics of Łukasiewicz Syntactic Consequence ⋮ Proof search and co-NP completeness for many-valued logics ⋮ Obituary: Franco Montagna (1948--2015) ⋮ Complexity of some language fragments of fuzzy logics ⋮ Complex Fuzzy Sets and Complex Fuzzy Logic an Overview of Theory and Applications ⋮ Introduction ⋮ Varieties generated by standard BL-algebras ⋮ Computational complexity of t-norm based propositional fuzzy logics with rational truth constants ⋮ The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete ⋮ A classification of BL-algebras ⋮ Complexity issues in Basic Logic
Cites Work
This page was built for publication: Complexity of t-tautologies