Arithmetical complexity of fuzzy predicate logics – a survey

Authors:
P. Hájek
Affiliations:
Institute of Computer Science, Academy of Sciences of the Czech Republic, 182 07, Prague, Czech Republic
Venue:
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Year:
2005

Citing 0
Cited 7

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
Notes on strong completeness in łukasiewicz, product and BL logics and in their first-order extensions

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.