Processing math: 100%

Table of Contents

Abbreviation: MA

Definition

A \emph{modal algebra} is a structure A=A,,0,,1,¬, such that

A,,0,,1,¬ is a Boolean algebras

is \emph{join-preserving}: (xy)=xy

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.

Morphisms

Let A and B be modal algebras. A morphism from A to B is a function h:AB that is a Boolean homomorphism and preserves :

h(x)=h(x)

Examples

Example 1:

Basic results

Properties

Finite members

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

Subclasses

Closure algebras

Superclasses

Boolean algebras with operators

References