Algorithm for Generating Finite Totally Ordered Monoids

DOI10.1007/978-3-319-40581-0_43MaRDI QIDQ5117232zbMATH OpenOpenAlexFDO

Authors 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 normfinite negative totally ordered monoidRees coextensionRees congruenceReidemeister closure conditiontomonoid partition

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3552814 (Why is no real title available?)
• scientific article; zbMATH DE number 2019833 (Why is no real title available?)
• scientific article; zbMATH DE number 774488 (Why is no real title available?)
• scientific article; zbMATH DE number 3031946 (Why is no real title available?)
• Monoidal t-norm based logic: Towards a logic for left-continuous t-norms
• Program for generating fuzzy logical operations and its use in mathematical proofs.
• Quasigroups, nets, and nomograms
• Rees coextensions of finite, negative tomonoids
• Residuated lattices of size \(\leq 12\)
• Totally ordered commutative monoids
• Triangular norms on product lattices

Cited in

(3)

• Continuous weakly cancellative triangular subnorms. I: Their web-geometric properties
• Cutlike semantics for fuzzy logic and its applications
• Generator induction in order sorted algebras

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5117232)