Abbreviation: MA
A \emph{modal algebra} is a structure A=⟨A,∨,0,∧,1,¬,⋄⟩ such that
⟨A,∨,0,∧,1,¬⟩ is a Boolean algebras
⋄ is \emph{join-preserving}: ⋄(x∨y)=⋄x∨⋄y
⋄ is \emph{normal}: ⋄0=0
Remark: Modal algebras provide algebraic models for modal logic. The operator ⋄ is the \emph{possibility operator}, and the \emph{necessity operator} ◻ is defined as ◻x=¬⋄¬x.
Let A and B be modal algebras. A morphism from A to B is a function h:A→B that is a Boolean homomorphism and preserves ⋄:
h(⋄x)=⋄h(x)
Example 1:
Classtype | variety |
---|---|
Equational theory | decidable |
Quasiequational theory | decidable |
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 | no |
Equationally def. pr. cong. | no |
Discriminator variety | no |
Amalgamation property | yes |
Strong amalgamation property | yes |
Epimorphisms are surjective | yes |
f(1)=1f(2)=f(3)=f(4)=f(5)=f(6)=