Algorithm for Generating Finite Totally Ordered Monoids

DOI10.1007/978-3-319-40581-0_43zbMath1455.06008OpenAlexW2480618915MaRDI QIDQ5117232

Milan Petrík, Thomas Vetterlein

Publication date: 20 August 2020

Published in: Information Processing and Management of Uncertainty in Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40581-0_43

zbMATH Keywords

discrete triangular normReidemeister closure conditionRees congruenceRees coextensiontomonoid partitionfinite negative totally ordered monoid

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Ordered semigroups and monoids (06F05)

Related Items (1)

Continuous weakly cancellative triangular subnorms. I: Their web-geometric properties

Cites Work

• Residuated lattices of size \(\leq 12\)
• Triangular norms on product lattices
• Monoidal t-norm based logic: Towards a logic for left-continuous t-norms
• Quasigroups, nets, and nomograms
• Rees coextensions of finite, negative tomonoids
• Totally ordered commutative monoids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithm for Generating Finite Totally Ordered Monoids