[Home]BCK-meet-semilattices

HomePage | RecentChanges | Preferences

Abbreviation: BCKJMlat

Definition

A BCK-meet-semilattice is a structure A = (A,∧,→,1) of type (2,2,0) such that

(1):   (xy)→((yz)→(xz))  = 1
(2):   1→x  = x
(3):   x→1  = 1
(4):   (xy)→y  = 1
(5):   x∧((xy)→y)  = x
is idempotent:   xx  = x
is commutative:   xy  = yx
is associative:   (xy)∧z  = x∧(yz)

Remark: x ≤ y   ⇔   xt y = 1 is a partial order, with 1 as greatest element, and is a meet in this partial order.

[Pawel M. Idziak, Lattice operation in BCK-algebras, Math. Japon. 29 (1984) 839--846 MRreview]

Morphisms

Let A and B be BCK-meet-semilattices. A morphism from A to B is a function h : AB that is a homomorphism: h(xy) = h(x)∧h(y) and h(xy) = h(x)→h(y) and h(1) = 1.

Some results

Examples

Properties

Classtype variety
Equational theory
Quasiequational theory
First-order theory
Locally finite
Residual size
Congruence distributive yes
Congruence modular yes
Congruence n-permutable yes, n = 2
Congruence regular
Congruence uniform
Congruence extension property
Definable principal congruences
Equationally definable principal congruences
Amalgamation property
Strong amalgamation property
Epimorphisms are surjective

Finite members

[Size 1]?:  1
[Size 2]?:  
[Size 3]?:  
[Size 4]?:  
[Size 5]?:  
[Size 6]?:  

Subclasses

BCK-lattices

Superclasses

BCK-algebras


HomePage | RecentChanges | Preferences
This page is read-only | View other revisions
Last edited March 17, 2003 11:26 pm (diff)
Search: