Processing math: 100%

FL-algebras

Abbreviation: FL

Definition

A \emph{full Lambek algebra}, or \emph{FL-algebra}, is a structure A=A,,,,1,,/,0 of type 2,0,2,0,2,1,2,2 such that

A,,,,1,,/ is a residuated lattice and

0 is an additional constant (can denote any element).

Morphisms

Let A and B be FL-algebras. 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), h(xy)=h(x)h(y), h(x/y)=h(x)/h(y), h(1)=1, h(0)=0

Examples

Example 1:

Basic results

Properties

Finite members

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

Subclasses

Bounded residuated lattices subvariety

FLe-algebras subvariety

FLw-algebras subvariety

FLc-algebras subvariety

Distributive FL-algebras subvariety

Superclasses

References


1) Hiroakira Ono, Yuichi Komori, \emph{Logics without the contraction rule}, J. Symbolic Logic, \textbf{50}1985, 169–201 MRreview ZMATH implementation

QR Code
QR Code fl-algebras (generated for current page)