Approximation and robustness of fuzzy finite automata
International Journal of Approximate Reasoning
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency
Fuzzy Sets and Systems
Triangular norm based predicate fuzzy logics
Fuzzy Sets and Systems
What is mathematical fuzzy logic
Fuzzy Sets and Systems
Algebraic and proof-theoretic aspects of non-classical logics
A resolution mechanism for Prenex Gödel logic
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Hi-index | 0.00 |
Results on arithmetical complexity of sets of tautologies and satisfiable formulas of various fuzzy logics (with respect to their standard t-norm based semantics as well as with respect to their general BL-algebra based semantics) are surveyed. Some new results are also obtained.