Suppose that At is a (finite or countable) set of sentence letters, or atomic propositions. The set of well-formed formulas generated from At, denoted L(At), is the smallest set of formulas generated by the following grammar:
p ∣ ¬φ ∣ (φ∧ψ) ∣ □φ
where p∈At.
Additional propositional connectives (e.g., ∨, →, ↔) are defined as usual. The dual modal operator ◊φ is defined as ¬□¬φ. Examples of modal formulas include: □p∨□¬p, □◊(p∨¬p), p→□(q∧r), and □(p→(q∨◊r)).
Definition 1. A neighborhood frame is a tuple ⟨W,N⟩, where W is a non-empty set, elements of which are called states, or possible worlds; and N:W→℘(℘(W)) is a function assigning to each state a set of sets of states (where for any set X, ℘(X) is the powerset of X, i.e., ℘(X)={Y ∣ Y⊆X}).
Definition 2. A neighborhood model is a tuple ⟨W,N,V⟩, where ⟨W,N⟩ is a neighborhood frame and V:At→℘(W) is a valuation function assigning to each atomic formula a subset of W.
Definition 3. Suppose that M=⟨W,N,V⟩ is a neighborhood model and that w∈W. Truth of formulas φ∈L(At) at w is defined by recursion on the structure of φ:
- M,w⊨p iff w∈V(p) where p∈At
- M,w⊨¬φ iff M,w⊨φ
- M,w⊨(φ∧ψ) iff M,w⊨φ and M,w⊨ψ
- M,w⊨□φ iff [[φ]]M∈N(w)
where [[φ]]M={w ∣ M,w⊨φ} is the truth set of φ.
To illustrate the above definitions, suppose that M1=⟨W,N,V⟩ is a neighborhood model with W={w,v,u}, N(w)={{v}}, N(v)=∅, N(u)={∅,{v},W}, V(p)={v,u}, and V(q)={w,v}. Then, we have that:
- M1,w⊨□(p∧q) since [[p∧q]]M1=[[p]]M∩[[q]]M1={v,u}∩{w,v}={v}∈N(w). One can check that [[□(p∧q)]]M1={w,u}
- M1,w⊨□p since [[p]]M1={v,u}∈/N(w). One can check that [[□p]]M1=∅
- M1,v⊨□(p∨¬p) since [[p∨¬p]]M1=[[p]]M∪[[¬p]]M1={v,u}∪{w}={w,v,u}∈/N(v). One can check that [[□(p∨¬p)]]M1={u}
- M1,u⊨□(p∧¬p) since [[p∧¬p]]M1=[[p]]M∩[[¬p]]M1={v,u}∩{w}=∅∈N(u). One can check that [[□(p∧¬p)]]M1={u}
There are other modal operators that can be defined in a neighborhood model. One modal operator that has been discussed in the literature is the following: For any neighborhood model M with a state w,
M,w⊨ ⟨ ]φ iff there is a X∈N(w) such that X⊆[[φ]]M.
The modal operators □ and ⟨ ] validate different formulas. A formula φ is valid on a neighborhood frame F=⟨W,N⟩ if for all models M=⟨W,N,V⟩ based on the frame F, for all w∈W, we have M,w⊨φ
Fact 1. The formula ⟨ ](φ∧ψ)→⟨ ]φ is valid on the class of all neighborhood frames, but □(φ∧ψ)→□φ is not valid on the class of all neighborhood frames.
Proof. Suppose that F=⟨W,N⟩ is a neighborhood frame, M=⟨W,N,V⟩ is a neighborhood model based on F, and w∈W. We will show that M,w⊨⟨ ](φ∧ψ)→⟨ ]φ. Suppose that M,w⊨⟨ ](φ∧ψ). Then, there is some X∈N(w) such that X⊆[[φ∧ψ]]M=[[φ]]M∩[[ψ]]M. Then, since [[φ]]M∩[[ψ]]M⊆[[φ]]M, we have that X⊆[[φ]]M. Hence, M,w⊨⟨ ]φ. To see that □(φ∧ψ)→□φ is not valid, consider the above model M1 and the instance of this formula scheme □(p∧q)→□p. We have that M1,w⊨□(p∧q) and M1,w⊨¬□p, and so M1,w⊨□(p∧q)→□p.
The above two modalities are equivalent when the neighborhood funcations are closed under supersets. A neighborhood frame ⟨W,N⟩ is monotonic when for all w∈W, for all X,Y⊆W, if X∈N(w) and X⊆Y, then Y∈N(w). The simple, but instructive!, proof of the following fact is left to the reader.
Fact 2. The formula □φ↔⟨ ]φ is valid on the class of monotonic neighborhood models.
We conclude this brief overview by clairfying the relationship between neighborhood models and relational models.
Definition 3. A relational frame is a pair ⟨W,R⟩ where W is a non-empty set and R⊆W×W is a relation on W. We write R(w)={v∣wRv} for the set of states accessible from w. A relational model is a tuple ⟨W,R,V⟩ where V:At→℘(W) is a valuation function (cf. Definition 2 above).
Truth for modal formulas at a state w in a relational model M=⟨W,R,V⟩ is defined as in Defition 3 except that the last clause for the modal formulas is replaced with:
- M,w⊨□φ iff R(w)⊆[[φ]]M, where [[φ]]M={w∣M,w⊨φ}
The first observation is that for every relational frame ⟨W,R⟩, there is a neighborhood frame ⟨W,NR⟩ validating the same formulas. Suppose that ⟨W,R⟩ is a relational frame. Let NR:W→℘(℘(W)) be defined as follows: for all w∈W, NR(w)={X∣R(w)⊆X}. Then, it is straightforward to check that ⟨W,R⟩ and ⟨W,NR⟩ validate the same formulas.
The neighborhood frame ⟨W,NR⟩ derived from a relational model satisfies a number properties not satisfied by arbitrary neighborhood frames:
- contains the unit: For all w∈W, W∈NR(w)
- closed under intersection: For all w∈W and X,Y⊆W, if X∈NR(w) and Y∈NR(w), then X∩Y∈NR(w).
- monotonic: For all w∈W and X,Y⊆W, if X∈NR(w) and X⊆Y, then Y∈NR(w).
- contains the core: For all w∈W, ⋂NR(w)∈NR(w)
Any neigbhrood frame satisfying the above conditions is equivalent to a relational model:
Fact 3. Suppose that F=⟨W,N⟩ contains the unit, is closed under conjunction, is monotonic and contains the core. Then the relational model ⟨W,RN⟩ with wRNv iff v∈⋂N(w) validates the same formulas as F.