Algorithm for Generating Finite Totally Ordered Monoids

DOI10.1007/978-3-319-40581-0_43zbMATH Open1455.06008OpenAlexW2480618915MaRDI QIDQ5117232FDOQ5117232

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 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)

Cites Work

• Title not available (Why is that?)
• Monoidal t-norm based logic: Towards a logic for left-continuous t-norms
• Triangular norms on product lattices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Totally ordered commutative monoids
• Quasigroups, nets, and nomograms
• Program for generating fuzzy logical operations and its use in mathematical proofs.
• Residuated lattices of size \(\leq 12\)
• Title not available (Why is that?)
• Rees coextensions of finite, negative tomonoids

Cited In (3)

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

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)