−Table of Contents
Closure algebras
Abbreviation: CloA
Definition
A \emph{closure algebra} is a modal algebra A=⟨A,∨,0,∧,1,¬,⋄⟩ such that
⋄ is \emph{closure operator}: x≤⋄x, ⋄⋄x=⋄x
Remark: Closure algebras provide algebraic models for the modal logic S4. The operator ⋄ is the \emph{possibility operator}, and the \emph{necessity operator} ◻ is defined as ◻x=¬⋄¬x.
Morphisms
Let A and B be closure algebras. A morphism from A to B is a function h:A→B that is a Boolean homomorphism and preserves ⋄:
h(⋄x)=⋄h(x)
Examples
Example 1: ⟨P(X),∪,∅,∩,X,−,cl⟩, where X is any topological space and cl is the closure operator associated with X.
Basic results
Properties
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 | yes |
Equationally def. pr. cong. | yes |
Discriminator variety | no |
Amalgamation property | yes |
Strong amalgamation property | yes |
Epimorphisms are surjective | yes |
Finite members
f(1)=1f(2)=f(3)=f(4)=f(5)=f(6)=