## Complexity of fuzzy probability logics.(English)Zbl 0972.03025

Summary: The satisfiability problem for the logic FP(Ł) (fuzzy probability logic over Łukasiewicz logic) is shown to be NP-complete; satisfiability in FP(Ł$$\Pi$$) (the same over the logic joining Łukasiewicz and product logic) is shown to be in PSPACE.

### MSC:

 03B52 Fuzzy logic; logic of vagueness 68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) 03D15 Complexity of computation (including implicit computational complexity)