Provable formulas
From LLWiki
Revision as of 20:31, 28 October 2013 by Olivier Laurent (Talk | contribs)
Important provable formulas are given by isomorphisms and by equivalences.
In many of the cases below the converse implication does not hold.
Contents |
Distributivities
Standard distributivities
Linear 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
Commutations