[Home]Implicative lattices

HomePage | RecentChanges | Preferences

Abbreviation: ImpLat

Definition

An implicative lattice is a structure A = (A,∨,∧, → ) such that (A,∨,∧) is a distributive lattice, and  →  is an implication:
x → (yz)  = (x → y)∨(x → z),
x → (yz)  = (x → y)∧(x → z),
(xy) → z  = (x → z)∧(y → z), and
(xy) → z  = (x → z)∨(y → z)

Morphisms

Let A and B be involutive lattices. 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(x → y) = h(x) → h(y).

References

[Nestor G. Martinez, H. A. Priestley, On Priestley spaces of lattice-ordered algebraic structures, Order 15 (1998) 297--323 MRreview]

[Nestor G. Martinez, A simplified duality for implicative lattices and l-groups, Studia Logica 56 (1996) 185--204 MRreview]

Some results

Examples

Properties

Classtypevariety
Equational theory
Quasiequational theory
First-order theory
Locally finiteno
Residual sizeunbounded
Congruence distributiveyes
Congruence modularyes
Congruence n-permutable
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]?:  1
[Size 3]?:  1
[Size 4]?:  
[Size 5]?:  
[Size 6]?:  
[Size 7]?:  
[Size 8]?:  
[Size 9]?:  
[Size 10]?:  

Subclasses

Goedel algebras
MV-algebras
Lattice-ordered groups

Superclasses

Distributive lattices


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