maximal consistent formulae
-maximal consistent formulae
Given a normal modal logic, , a set, , of formulae is said to be -consistent if , i.e., is not deducible from .
A set, , of formulae is said to be -maximal if it is consistent and, for any either or .
Let , then is a bijection between and the set of ultrafilters of .
This set forms the set of states / worlds for the canonical frame of . The relations are given by
Revised on February 24, 2014 13:17:25
by Toby Bartels