−Table of Contents
Nonassociative relation algebras
Abbreviation: NA
Definition
A \emph{nonassociative relation algebra} is a structure A=⟨A,∨,0,∧,1,¬,∘,⌣,e⟩ such that
⟨A,∨,0,∧,1,¬⟩ is a Boolean algebra
e is an \emph{identity} for ∘: x∘e=x, e∘x=x
∘ is \emph{join-preserving}: (x∨y)∘z=(x∘z)∨(y∘z)
⌣ is an \emph{involution}: x⌣⌣=x, (x∘y)⌣z=y⌣∘x⌣
⌣ is \emph{join-preserving}: (x∨y)⌣z=x⌣∨y⌣
∘ is residuated: x⌣∘(¬(x∘y))≤¬y
Remark:
Morphisms
Let A and B be relation algebras. A morphism from A to B is a function h:A→B that is a Boolean homomorphism and preserves ∘, ⌣, e:
h(x∘y)=h(x)∘h(y), h(x⌣)=h(x)⌣, h(e)=e
Examples
Example 1:
Basic results
Properties
Classtype | variety |
---|---|
Equational theory | decidable |
Quasiequational theory | undecidable |
First-order theory | undecidable |
Locally finite | no |
Residual size | unbounded |
Congruence distributive | yes |
Congruence modular | yes |
Congruence n-permutable | yes, n=2 |
Congruence regular | yes |
Congruence uniform | yes |
Congruence extension property | yes |
Definable principal congruences | |
Equationally def. pr. cong. | |
Discriminator variety | no |
Amalgamation property | |
Strong amalgamation property | |
Epimorphisms are surjective |
Finite members
f(1)=1f(2)=f(3)=f(4)=f(5)=f(6)=