Processing math: 100%

Dunn monoid

Abbreviation: DunnMon

Definition

A \emph{Dunn monoid} is a commutative distributive residuated lattice L=L,,,,e, such that

is square-increasing: xx2

Remark: Here x2=xx. These algebras were first defined by J.M.Dunn in 1) and were named by R.K. Meyer2).

Morphisms

Let L and M be Dunn monoids. A morphism from L to M is a function h:LM that is a homomorphism:

h(xy)=h(x)h(y), h(xy)=h(x)h(y), h(xy)=h(x)h(y), h(xy)=h(x)h(y), and h(e)=e

Examples

Example 1:

Basic results

Properties

Finite members

$\begin{array}{lr}

f(1)= &1\\
f(2)= &\\
f(3)= &\\
f(4)= &\\
f(5)= &\\

\end{array}\begin{array}{lr}

f(6)= &\\
f(7)= &\\
f(8)= &\\
f(9)= &\\
f(10)= &\\

\end{array}$

Subclasses

Superclasses

References


1) J.M. Dunn: The Algebra of Intensional Logics, PhD thesis, University of Pittsburgh, 1966.
2) R.K. Meyer: Conservative extension in relevant implication, Studia Logica 31 (1972), 39–46.
3) A. Urquhart: The undecidability of entailment and relevant implication, J. Symbolic Logic 49 (1984), 1059–1073.

QR Code
QR Code dunn_monoids (generated for current page)