Pre-supposing?

Partiality
• (15) State updates
1. s ⊕w1...wα φ = {w ∈ s : w ∈ {w1 . . . wα} ∪ {w ⊕ φ : w ∈
{w1 . . . wα}}
2. s ⊕ φ = {w ′ : w ∈ s & w ′ = w ⊕ φ}
(13) w ⊑ w ′ iff for all φ, if w |= (resp.|=
) φ, w ′ |= (resp.|=
• (16) s ⊑ s ′ iff there is a bijection f between s and s ′ such that
w ⊑ f(w).
Ex.: s = s ′ , s ′ = s ⊕ φ, s = {w1 . . . wα} and s ′ = {w1 ⊕ φ1 . . . wβ ⊕
φβ, wβ+1 . . . wα}.
40
) φ.