Enumeration of hypercompositional structures defined by binary relations.
From MaRDI portal
Recommendations
- Enumeration of Rosenberg-type hypercompositional structures defined by binary relations.
- scientific article; zbMATH DE number 2128019
- Hyperstructures associated with binary relations
- Compositions and decompositions of binary relations
- scientific article; zbMATH DE number 860101
- Advanced results in enumeration of hyperstructures.
- scientific article; zbMATH DE number 3861227
- scientific article; zbMATH DE number 3841924
- The concept of a binary relation over partial enumerated sets
- Enumerations in computable structure theory
Cited in
(13)- Composition in EL-hyperstructures
- scientific article; zbMATH DE number 2059952 (Why is no real title available?)
- Fully simple semihypergroups.
- Enumeration of Rosenberg-type hypercompositional structures defined by binary relations.
- BinaryTest
- Basic semilinear logics based on \([0,u]\)-continuous uwa-uninorms
- Hyperstructures associated with binary relations
- On EL-semihypergroups.
- Boolean algebras as a tool to implement and analyze hypercompositional structures
- Enumeration of Rosenberg hypergroups.
- \(n\)-ary Cartesian composition of automata
- Weak associative micanorm-based logics: \([0, e]\)-continuous \(\nu\)-weak-associative logics
- Classification of Krasner hyperfields of order 4
This page was built for publication: Enumeration of hypercompositional structures defined by binary relations.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890645)
