![](https://www.pdfsearch.io/img/038f9a53bc73a81f422caa1291788695.jpg) Date: 2015-09-03 07:54:10
| | ⊢ (P → (Q → R)) → (P ∧ Q → R) Using a partial truth table I will find out whether (P → (Q → R)) → (P ∧ Q → R) is a tautology. A sentence of the language of propositional logic is a tautology (logicAdd to Reading ListSource URL: logicmanual.philosophy.ox.ac.ukDownload Document from Source Website File Size: 189,74 KBShare Document on Facebook
|