A logic identifying isomorphic propositions
Résumé
We define a fragment of propositional logic where isomorphic propositions, such as A∧B and B∧A, or A⇒(B∧C) and (A⇒B)∧(A⇒C) are identified. We define System I, a proof language for this logic, and prove the strong normalisation of proof-reduction in this system.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...