forked from ComputerAidedLL/llwikibook
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlatticeexp.tex
89 lines (69 loc) · 3.77 KB
/
latticeexp.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
\section{Lattice of exponential modalities}\label{lattice-of-exponential-modalities}
\begin{equation*}
\xymatrix{
& & {\wn} \\
& & & & {\wn\oc\wn}\ar[ull] \\
\varepsilon\ar[uurr] & & & {\oc\wn} \ar[ur] & & {\wn\oc} \ar[ul] \\
& & & & {\oc\wn\oc} \ar[ul]\ar[ur] \\
& & {\oc} \ar[uull]\ar[urr]
}
\end{equation*}
An \emph{exponential modality} is an arbitrary (possibly empty) sequence
of the two exponential connectives \(\oc\) and \(\wn\). It can be
considered itself as a unary connective. This leads to the notation
\(\mu A\) for applying an exponential modality \(\mu\) to a formula
\(A\).
There is a preorder relation on exponential modalities defined by
\(\mu\lesssim\nu\) if and only if for any formula \(A\) we have
\(\mu A\vdash \nu A\). It induces an
\hyperref[list-of-equivalences]{equivalence} relation on exponential
modalities by \(\mu \sim \nu\) if and only if \(\mu\lesssim\nu\) and
\(\nu\lesssim\mu\).
\begin{lemma}
For any formula $A$, $\oc{A}\vdash A$ and $A\vdash\wn{A}$.
\end{lemma}
\begin{lemma}[Functoriality]
If $A$ and $B$ are two formulas such that $A\vdash B$ then, for any exponential modality $\mu$, $\mu A\vdash \mu B$.
\end{lemma}
\begin{lemma}
For any formula $A$, $\oc{A}\vdash \oc{\oc{A}}$ and $\wn{\wn{A}}\vdash\wn{A}$.
\end{lemma}
\begin{lemma}
For any formula $A$, $\oc{A}\vdash \oc{\wn{\oc{A}}}$ and $\wn{\oc{\wn{A}}}\vdash\wn{A}$.
\end{lemma}
This allows to prove that any exponential modality is equivalent to one
of the following seven modalities: \(\varepsilon\) (the empty modality),
\(\oc\), \(\wn\), \(\oc\wn\), \(\wn\oc\), \(\oc\wn\oc\) or
\(\wn\oc\wn\). Indeed any sequence of consecutive \(\oc\) or \(\wn\) in
a modality can be simplified into only one occurrence, and then any
alternating sequence of length at least four can be simplified into a
smaller one.
\begin{proof}
We obtain $\oc{\oc{A}}\vdash\oc{A}$ by functoriality from $\oc{A}\vdash A$ (and similarly for $\wn{A}\vdash\wn{\wn{A}}$).
From $\oc{A}\vdash \oc{\wn{\oc{A}}}$, we deduce $\wn{\oc{A}}\vdash \wn{\oc{\wn{\oc{A}}}}$ by functoriality and $\oc{\wn{B}}\vdash \oc{\wn{\oc{\wn{B}}}}$ (with $A=\wn{B}$). In a similar way we have $\oc{\wn{\oc{\wn{A}}}}\vdash \oc{\wn{A}}$ and $\wn{\oc{\wn{\oc{A}}}}\vdash \wn{\oc{A}}$.
\end{proof}
The order relation induced on equivalence classes of exponential
modalities with respect to \(\sim\) can be proved to be the one
represented on the picture in the top of this section. All the represented
relations are valid.
\begin{proof}
We have already seen $\oc{A}\vdash A$ and $\oc{A}\vdash \oc{\wn{\oc{A}}}$. By functoriality we deduce $\oc{\wn{\oc{A}}}\vdash \oc{\wn{A}}$ and by $A=\wn{\oc{B}}$ we deduce $\oc{\wn{\oc{B}}}\vdash \wn{\oc{B}}$.
The others are obtained from these ones by duality: $A\vdash B$ entails $B\orth\vdash A\orth$.
\end{proof}
\begin{lemma}
If $\alpha$ is an atom, $\wn{\alpha}\not\vdash\alpha$ and
$\alpha\not\vdash\wn{\oc{\wn{\alpha}}}$.
\end{lemma}
We can prove that no other relation between classes is true (by relying
on the previous lemma).
\begin{proof}
From the lemma and $A\vdash\wn{A}$, we have $\wn{\alpha}\not\vdash\wn{\oc{\wn{\alpha}}}$.
Then $\wn$ cannot be smaller than any other of the seven modalities (since they are all smaller than $\varepsilon$ or $\wn\oc\wn$). For the same reason, $\varepsilon$ cannot be smaller than $\oc$, $\oc\wn$, $\wn\oc$ or $\oc\wn\oc$. This entails that $\wn\oc\wn$ is only smaller than $\wn$ since it is not smaller than $\varepsilon$ (by duality from $\varepsilon$ not smaller than $\oc\wn\oc$).
From these, $\wn{\oc{\alpha}}\not\vdash\oc{\wn{\alpha}}$ and $\oc{\wn{\alpha}}\not\vdash\wn{\oc{\alpha}}$, we deduce that no other relation is possible.
\end{proof}
The order relation on equivalence classes of exponential modalities is a
lattice.
%%% Local Variables:
%%% mode: latex
%%% TeX-master: "main"
%%% End: