Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Fuzzy Sets and Systems
New family of triangular norms via contrapositive symmetrization of residuated implications
Fuzzy Sets and Systems
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
An Algebraic Approach to Propositional Fuzzy Logic
Journal of Logic, Language and Information
The structure of continuous uni-norms
Fuzzy Sets and Systems
On a class of left-continuous t-norms
Fuzzy Sets and Systems - Mathematics
A characterization theorem on the rotation construction for triangular norms
Fuzzy Sets and Systems - Theme: Basic concepts
A note to the definition of the ŁΠ-algebras
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Complexity of Fuzzy Probability Logics
Fundamenta Informaticae
IEEE Transactions on Fuzzy Systems
Distributivity and conditional distributivity of a uninorm and a continuous t-conorm
IEEE Transactions on Fuzzy Systems
Generalized rough approximations in Ł Π12
International Journal of Approximate Reasoning
Uninorms and Non-contradiction
MDAI '08 Sabadell Proceedings of the 5th International Conference on Modeling Decisions for Artificial Intelligence
Fuzzy logics with an additional involutive negation
Fuzzy Sets and Systems
Expanding Basic Fuzzy Logic with truth constants for component delimiters
Fuzzy Sets and Systems
On real-valued evaluation of propositional formulas
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Hi-index | 0.00 |
In this paper, we investigate the definability of classes of t-norms and uninorms in the logic L@P12. In particular we provide a complete characterization of definable continuous t-norms, weak nilpotent minimum t-norms, conjunctive uninorms continuous on [0,1), and idempotent conjunctive uninorms, and give both positive and negative results concerning definability of left-continuous t-norms (and uninorms). We show that the class of definable uninorms is closed under construction methods as annihilation, rotation and rotation-annihilation. Moreover, we prove that every logic based on a definable uninorm is in PSPACE, and that any finitely axiomatizable logic based on a class of definable uninorms is decidable. Finally we show that the Uninorm Mingle Logic (UML) and the Basic Uninorm Logic (BUL) are finitely strongly standard complete w.r.t. the related class of definable left-continuous conjunctive uninorms.