Definition 1.4.14 (Kripke model). Let P be a set of primitive propositions. A Kripke model is a tuple (S,≤,⊩) where (S,≤) is a poset (whose elements are called “worlds” or “states”, and whose ordering is called the “accessibility relation”) and ⊩⊆S×P is a binary relation (“forcing”) satisfying the persistence property: if p∈P is such that s⊩p and s≤s′, then s′⊩p.