Increasingness of binary operations on trellises
From MaRDI portal
Cites work
- A characterization of complete trellises of finite length
- A dissection of the monotonicity property of binary operations from a dominance point of view
- Aggregation functions on bounded partially ordered sets and their classification
- Aggregation functions.
- Associative functions. Triangular norms and copulas
- Directional monotonicity of fusion functions
- FULLY ORDERED SEMIGROUPS AND THEIR APPLICATIONS
- scientific article; zbMATH DE number 647713 (Why is no real title available?)
- scientific article; zbMATH DE number 1182701 (Why is no real title available?)
- scientific article; zbMATH DE number 1503641 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 3355081 (Why is no real title available?)
- scientific article; zbMATH DE number 3103212 (Why is no real title available?)
- Some examples of weakly associative lattices
- Totally ordered commutative semigroups
- Trellis theory
- Trellis theory
- Triangular norms on bounded trellises
- Weak and directional monotonicity of functions on Riesz spaces to fuse uncertain data
- Weaker forms of increasingness of binary operations and their role in the characterization of meet and join operations
- Weakly associative lattices and projective planes
This page was built for publication: Increasingness of binary operations on trellises
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7347483)