lattice-ordered monoid

  • 1Monoid — This article is about the mathematical concept. For the alien creatures in the Doctor Who adventure, see The Ark (Doctor Who). Coherence law for monoid unit In abstract algebra, a branch of mathematics, a monoid is an algebraic structure with a… …

    Wikipedia

  • 2Refinement monoid — In mathematics, a refinement monoid is a commutative monoid M such that for any elements a0, a1, b0, b1 of M such that a0+a1=b0+b1, there are elements c00, c01, c10, c11 of M such that a0=c00+c01, a1=c10+c11, b0=c00+c10, and b1=c01+c11. A… …

    Wikipedia

  • 3Residuated lattice — In abstract algebra, a residuated lattice is an algebraic structure that is simultaneously a lattice x le; y and a monoid x • y which admits operations x z and z / y loosely analogous to division or implication when x • y is viewed as… …

    Wikipedia

  • 4Congruence lattice problem — In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice. The problem was posed by Robert P. Dilworth, and for many years it was one of the most …

    Wikipedia

  • 5Outline of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… …

    Wikipedia

  • 6List of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… …

    Wikipedia

  • 7Heyting algebra — In mathematics, Heyting algebras are special partially ordered sets that constitute a generalization of Boolean algebras, named after Arend Heyting. Heyting algebras arise as models of intuitionistic logic, a logic in which the law of excluded… …

    Wikipedia

  • 8Ordinal optimization — In mathematical optimization, ordinal optimization is the maximization of functions taking values in a partially ordered set ( poset ). Ordinal optimization has applications in the theory of queuing networks. Contents 1 Mathematical foundations 1 …

    Wikipedia

  • 9List of order topics — This is a list of order topics, by Wikipedia page.An alphabetical list of many notions of order theory can be found in the order theory glossary. See also inequality, extreme value, optimization (mathematics), domain theory.Basic… …

    Wikipedia

  • 10List of order theory topics — Order theory is a branch of mathematics that studies various kinds of binary relations that capture the intuitive notion of ordering, providing a framework for saying when one thing is less than or precedes another. An alphabetical list of many… …

    Wikipedia