Provable formulas
From LLWiki
(Difference between revisions)
(→Factorizations: plus/par added) |
(Promotion principles added) |
||
Line 69: | Line 69: | ||
\wn{(A \with B)} &\limp& \wn{A} \with \wn{B} \\ |
\wn{(A \with B)} &\limp& \wn{A} \with \wn{B} \\ |
||
\oc{A} \plus \oc{B} &\limp& \oc{(A \plus B)} |
\oc{A} \plus \oc{B} &\limp& \oc{(A \plus B)} |
||
+ | \end{array} |
||
+ | </math> |
||
+ | |||
+ | == Promotion principles == |
||
+ | |||
+ | <math> |
||
+ | \begin{array}{rcl} |
||
+ | \oc{A} \tens \wn{B} &\limp& \wn{(A \tens B)} \\ |
||
+ | \oc{(A \parr B)} &\limp& \wn{A} \parr \oc{B} |
||
\end{array} |
\end{array} |
||
</math> |
</math> |
Revision as of 19:25, 28 October 2013
This page is a stub and needs more content.
Important provable formulas are given by isomorphisms and by equivalences.
In many of the cases below the converse implication does not hold.
Contents |
Distributivities
Factorizations
Additive structure
Quantifiers
Exponential structure
Provable formulas involving exponential connectives only provide us with the lattice of exponential modalities.
Monoidality of exponentials
Promotion principles