Provable formulas

Revision as of 18:55, 28 October 2013

This page is a stub and needs more content.

Important provable formulas are given by isomorphisms and by equivalences.

$A\plus (B\with C) \limp (A\plus B)\with (A\plus C)$

$A\tens (B\parr C) \limp (A\tens B)\parr C$

$(A\with B)\plus (A\with C) \limp A\with (B\plus C)$

$\begin{array}{rcl} A\with B \limp A &\quad& A\with B \limp B\\ A \limp A\plus B &\quad& B \limp A\plus B\\ \end{array}$

Provable formulas involving exponential connectives only provide us with the lattice of exponential modalities.

$\begin{array}{rclcrcl} \oc A &\limp& A &\quad& A&\limp&\wn A\\ \oc A &\limp& 1 &\quad& \bot &\limp& \wn A \end{array}$

$\begin{array}{rcl} \wn(A\parr B) &\limp& \wn A\parr\wn B \\ \oc A\tens\oc B &\limp& \oc(A\tens B) \end{array}$

@@ Line 38: / Line 38: @@
 <math>
-\begin{array}{rclcrcl}
+\begin{array}{rcl}
-  \wn(A\parr B) &\limp& \wn A\parr\wn B &\quad&
+  \wn(A\parr B) &\limp& \wn A\parr\wn B \\
-  \wn\bot &\limp& \bot \\
+  \oc A\tens\oc B &\limp& \oc(A\tens B)
-  \oc A\tens\oc B &\limp& \oc(A\tens B) &\quad&
-  \one &\limp& \oc\one \\
 \end{array}
 </math>