Provable formulas
From LLWiki
(Difference between revisions)
(→Distributivities: tens/with added) |
(→Factorizations: plus/par added) |
||
Line 16: | Line 16: | ||
<math>(A\with B)\plus (A\with C) \limp A\with (B\plus C)</math> |
<math>(A\with B)\plus (A\with C) \limp A\with (B\plus C)</math> |
||
+ | |||
+ | <math>(A\parr B)\plus (A\parr C) \limp A\parr (B\plus C)</math> |
||
== Additive structure == |
== Additive structure == |
Revision as of 19:22, 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