Processing math: 100%

BCK-lattices

Abbreviation: BCKlat

Definition

A \emph{BCK-lattice} is a structure A=A,,,,1 of type 2,2,2,0 such that

A,,,1 is a BCK-join-semilattice

A,,,1 is a BCK-meet-semilattice

Remark: xyxy=1 is a partial order, with 1 as greatest element, and , are a join and meet for this order. 1)

Morphisms

Let A and B be BCK-lattices. A morphism from A to B is a function h:AB that is a homomorphism:

h(xy)=h(x)h(y), h(xy)=h(x)h(y), h(xy)=h(x)h(y) and h(1)=1.

Examples

Example 1:

Basic results

Properties

Finite members

f(1)=1f(2)=f(3)=f(4)=f(5)=f(6)=

Subclasses

Superclasses

References


1) Pawel M. Idziak, \emph{Lattice operation in BCK-algebras}, Math. Japon., \textbf{29}, 1984, 839–846 MRreview

QR Code
QR Code bck-lattices (generated for current page)