02.02.2013 Views

Tools and Techniques in Modal Logic Marcus Kracht II ...

Tools and Techniques in Modal Logic Marcus Kracht II ...

Tools and Techniques in Modal Logic Marcus Kracht II ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

7.9. The Lattice of Tense <strong>Logic</strong>s 369<br />

❅■<br />

❅<br />

Figure 7.16. hk<br />

�✒ ❅■<br />

� ❅<br />

· · ·<br />

❅■<br />

❅ ❝<br />

E K4.t even these cases are ruled out. Look at the sequence 〈gl ◦ n : n ∈ ω〉 where gl ◦ n<br />

differs from gl n <strong>in</strong> that n ⋪ n. The maps π <strong>and</strong> ρ def<strong>in</strong>ed by π : gl ◦ n � gl 1 : j ↦→ j<br />

(mod 2) <strong>and</strong> ρ : gl ◦ n � gl 0 : j ↦→ 0 are n–localic with respect to 0. Thus this sequence<br />

subreduces both frames <strong>in</strong> E K4.t <strong>and</strong> <strong>in</strong> E K.t.<br />

Lemma 7.9.11. For no n, Th gl n splits E K.t, E K4.t.<br />

It now rema<strong>in</strong>s to treat the clusters. Here the situation is quite similar to the<br />

situation of the garl<strong>and</strong>s.<br />

Lemma 7.9.12. Suppose g is a cluster. Then Th g splits E K.t <strong>and</strong> E K4.t only if<br />

g � • <strong>and</strong> E S4.t only if g � ◦ .<br />

Proof. Let n := ♯g > 1 <strong>and</strong> hk = 〈hk, ⊳〉 with<br />

hk = {0, . . . , k} × {1, . . . , n} − {〈k, n〉}<br />

<strong>and</strong> 〈i, j〉 ⊳ 〈i ′ , j ′ 〉 iff (i) i is odd, i ′ = i + 1 or i − 1 or (ii) i is even <strong>and</strong> i ′ = i. This can<br />

be visualized by Here, denotes a cluster with n po<strong>in</strong>ts <strong>and</strong> ◦ a cluster with 1 po<strong>in</strong>t.<br />

There is no p–morphism from hk <strong>in</strong>to g as there is no way to map a po<strong>in</strong>t belong<strong>in</strong>g<br />

to an n − 1–po<strong>in</strong>t cluster onto a n–po<strong>in</strong>t cluster.<br />

Now look at the k–transit of 〈0, 0〉 <strong>in</strong> hk; call it e. Let e be its underly<strong>in</strong>g set.<br />

Every po<strong>in</strong>t <strong>in</strong> e is conta<strong>in</strong>ed <strong>in</strong> an n–po<strong>in</strong>t cluster s<strong>in</strong>ce 〈i, j〉 ∈ e iff i < k. Thus<br />

there is a p–morphism π : e → g. Extend π to a map p + : hk � g. p + is k–localic<br />

with respect to 〈0, i〉 for every i. Hence hk is k–consistent with g. It follows that<br />

〈Th hk : k ∈ ω〉 is a subreduction of Th g. �<br />

Now we have collected all the material we need to prove the splitt<strong>in</strong>g theorems.<br />

Notice that a splitt<strong>in</strong>g frame for any of these logics can only be one–po<strong>in</strong>t cluster or<br />

a two–po<strong>in</strong>t garl<strong>and</strong>. We will now show that the frames not excluded by the above<br />

lemmata are <strong>in</strong>deed splitt<strong>in</strong>g frames.<br />

Theorem 7.9.13. Λ splits the lattice ES4.t iff Λ = Th gl1 = Th ◦<br />

Λ = Th gl0 = Th ◦ .<br />

✲◦ or<br />

Proof. (⇐) The nontrivial part is gl 1. We will show E S4.t/gl 1 = S5.t by prov<strong>in</strong>g<br />

that (†) of the Splitt<strong>in</strong>g Theorem holds for m = 1. Therefore let A be an algebra<br />

satisfy<strong>in</strong>g Th A � S5t. Then there is a set c ∈ A of A such that 0 < c ∩ � � − c.<br />

Consequently, <strong>in</strong> the underly<strong>in</strong>g Kripke–frame there are two po<strong>in</strong>ts s ⊳ t such that

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!