{"id":49,"date":"2016-12-16T18:14:05","date_gmt":"2016-12-16T18:14:05","guid":{"rendered":"https:\/\/pressbooks.ccconline.org\/introtologic\/chapter\/9-if-and-only-if-using-theorems\/"},"modified":"2025-10-13T18:14:53","modified_gmt":"2025-10-13T18:14:53","slug":"9-if-and-only-if-using-theorems","status":"publish","type":"chapter","link":"https:\/\/pressbooks.ccconline.org\/introtologic\/chapter\/9-if-and-only-if-using-theorems\/","title":{"raw":"\u201c\u2026 if and only if \u2026\u201d, Using Theorems","rendered":"\u201c\u2026 if and only if \u2026\u201d, Using Theorems"},"content":{"raw":"<h2>9.1 \u00a0A historical example<\/h2>\r\nThe philosopher David Hume (1711-1776) is remembered for being a brilliant skeptical empiricist. \u00a0A person is a skeptic about a topic if that person both has very strict standards for what constitutes knowledge about that topic and also believes we cannot meet those strict standards.\r\n\r\nEmpiricism is the view that we primarily gain knowledge through experience, particular experiences of our senses. In his book, <span class=\"em\"><em>An Inquiry Concerning Human Understanding<\/em>,<\/span>\u00a0Hume lays out his principles for knowledge, and then advises us to clean up our libraries:\r\n<blockquote>When we run over libraries, persuaded of these principles, what havoc must we make? If we take in our hand any volume of divinity or school metaphysics, for instance, let us ask, Does it contain any abstract reasoning concerning quantity or number? No. Does it contain any experimental reasoning concerning matter of fact and existence? No. Commit it then to the flames, for it can contain nothing but sophistry and illusion.<sup class=\"super\"><a id=\"ftnt_ref11\" href=\"#ftnt11\">[11]<\/a><\/sup><\/blockquote>\r\nHume felt that the only sources of knowledge were logical or mathematical reasoning (which he calls above \u201cabstract reasoning concerning quantity or number\u201d) or sense experience (\u201cexperimental reasoning concerning matter of fact and existence\u201d). \u00a0Hume is led to argue that any claims not based upon one or the other method is worthless.\r\n\r\nWe can reconstruct Hume\u2019s argument in the following way. \u00a0Suppose <span class=\"em strong\">t<\/span>\u00a0is some topic about which we claim to have knowledge. \u00a0Suppose that we did not get this knowledge from experience or logic. \u00a0Written in English, we can reconstruct his argument in the following way:\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">We have knowledge about <em><strong><span class=\"em strong\">t<\/span>\u00a0<\/strong><\/em>if and only if our claims about <em><strong><span class=\"em strong\">t<\/span>\u00a0<\/strong><\/em>are learned from experimental reasoning or from logic or mathematics.<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">Our claims about <em><strong><span class=\"em strong\">t<\/span>\u00a0<\/strong><\/em>are not learned from experimental reasoning.<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">Our claims about <em><strong><span class=\"em strong\">t<\/span>\u00a0<\/strong><\/em>are not learned from logic or mathematics.<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">_____<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">We do not have knowledge about <em><strong><span class=\"em strong\">t<\/span><\/strong><\/em><span class=\"em\">.<\/span><\/p>\r\nWhat does that phrase \u201cif and only if\u201d mean? \u00a0Philosophers think that it, and several synonymous phrases, are used often in reasoning. \u00a0Leaving \u201cif and only\u201d unexplained for now, we can use the following translation key to write up the argument in a mix of our propositional logic and English.\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span><\/strong>: \u00a0We have knowledge about <em><strong><span class=\"em strong\">t<\/span><\/strong><\/em><span class=\"em\">.<\/span><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">Q<\/span><\/strong>: \u00a0Our claims about <span class=\"em strong\">t<\/span>\u00a0are learned from experimental reasoning.<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">R<\/span><\/strong>: \u00a0Our claims about <span class=\"em strong\">t<\/span>\u00a0are learned from logic or mathematics.<\/p>\r\nAnd so we have:\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span>\u00a0<\/strong>if and only if<strong> <span class=\"strong\">(QvR)<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00acQ<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00acR<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong>_____<\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00acP<\/span><\/strong><\/p>\r\nOur task is to add to our logical language an equivalent to \u201cif and only if\u201d. \u00a0Then we can evaluate this reformulation of Hume\u2019s argument.\r\n<div class=\"textbox textbox--exercises\"><header class=\"textbox__header\">\r\n<p class=\"textbox__title\">Check for Understanding<\/p>\r\n\r\n<\/header>\r\n<div class=\"textbox__content\">\r\n<ol>\r\n \t<li><strong>Critical Thinking Task:\u00a0<\/strong>Create a story\/song\/poem you could use to explain the concept of empiricism to a family member.<\/li>\r\n<\/ol>\r\n<\/div>\r\n<\/div>\r\n<h2>9.2 \u00a0The biconditional<\/h2>\r\n<div class=\"textbox textbox--learning-objectives\"><header class=\"textbox__header\">\r\n<p class=\"textbox__title\">Pre-Reading Questions<\/p>\r\n\r\n<\/header>\r\n<div class=\"textbox__content\">\r\n<ol>\r\n \t<li>What do you think the phrase \"if and only if\" means in everyday language? Can you give an example of a statement that uses this phrase?<\/li>\r\n \t<li>How would you express the meaning of \"P if and only if Q\" by breaking it down into simpler logical statements?<\/li>\r\n<\/ol>\r\n<\/div>\r\n<\/div>\r\n<div class=\"textbox textbox--key-takeaways\"><header class=\"textbox__header\">\r\n<p class=\"textbox__title\">Key Terms<\/p>\r\n\r\n<\/header>\r\n<div class=\"textbox__content\">\r\n<ul>\r\n \t<li><strong>Biconditional<\/strong> - often written as \"p if and only if q\" (or p q), is true when both p and q have the same truth value (both true or both false) and is false otherwise.<\/li>\r\n \t<li><strong>Syntactic Equivalence<\/strong> - two statements or formulas have the same form and structure.<\/li>\r\n \t<li><strong>Modus Tollendo Ponens<\/strong> - also known as Disjunctive Syllogism, is a valid rule of inference in logic. It states that if a disjunction (an \"or\" statement) is true, and one of the disjuncts (the options in the \"or\" statement) is false, then the other disjunct must be true.<\/li>\r\n<\/ul>\r\n<\/div>\r\n<\/div>\r\nBefore we introduce a symbol synonymous with \u201cif and only if\u201d, and then lay out its syntax and semantics, we should start with an observation. \u00a0A phrase like \u201c<strong><span class=\"strong\">P<\/span>\u00a0<\/strong>if and only if <strong><span class=\"strong\">Q<\/span><\/strong>\u201d appears to be an abbreviated way of saying \u201c<strong><span class=\"strong\">P<\/span>\u00a0<\/strong>if <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>only if <strong><span class=\"strong\">Q<\/span><\/strong>\u201d. \u00a0Once we notice this, we do not have to try to discern the meaning of \u201cif and only if\u201d using our expert understanding of English. \u00a0Instead, we can discern the meaning of \u201cif and only if\u201d using our already rigorous definitions of \u201cif\u201d, \u201cand\u201d, and \u201conly if\u201d. \u00a0Specifically, \u201c<strong><span class=\"strong\">P<\/span>\u00a0<\/strong>if <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>only if <strong><span class=\"strong\">Q<\/span><\/strong>\u201d will be translated \u201c<strong><span class=\"strong\">((Q<\/span><span class=\"strong\">\u2192P)^(P\u2192Q))<\/span><\/strong>\u201d. \u00a0(If this is unclear to you, go back and review section 2.2.) \u00a0Now, let us make a truth table for this formula.\r\n<table class=\"grid\">\r\n<tbody>\r\n<tr class=\"border-bottom\">\r\n<td class=\"border\" rowspan=\"1\"><strong><span class=\"strong\">P \u00a0 \u00a0 <\/span><\/strong><\/td>\r\n<td class=\"border-right\"><strong><span class=\"strong\">Q<\/span><\/strong><\/td>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><strong><span class=\"strong\">(Q \u2192 P) \u00a0 \u00a0<\/span><\/strong><\/td>\r\n<td class=\"border strong\"><strong>(P \u2192 Q)<\/strong><\/td>\r\n<td class=\"border strong\"><strong>((Q\u2192P)^(P\u2192Q))<\/strong><\/td>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T \u00a0 \u00a0 <\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T \u00a0<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T \u00a0 \u00a0 <\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T \u00a0<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F \u00a0 \u00a0 <\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F \u00a0\u00a0<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F \u00a0 \u00a0 <\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T\u00a0<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\nWe have settled the semantics for \u201cif and only if\u201d. \u00a0 We can now introduce a new symbol for this expression. \u00a0It is traditional to use the double arrow, \u201c\u2194\u201d. \u00a0We can now express the syntax and semantics of \u201c\u2194\u201d.\r\n\r\nIf <strong><span class=\"strong\">\u03a6<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">\u03a8<\/span>\u00a0<\/strong>are sentences, then\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u03a6\u2194\u03a8)<\/span><\/strong><\/p>\r\nis a sentence. \u00a0This kind of sentence is typically called a \u201cbiconditional\u201d.\r\n\r\nThe semantics is given by the following truth table.\r\n<table class=\"grid\">\r\n<tbody>\r\n<tr class=\"border-bottom\">\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">\u03a6 \u00a0 \u00a0 \u00a0 \u00a0<\/span><\/td>\r\n<td class=\"border-right\"><span class=\"strong\">\u03a8<\/span><\/td>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">(\u03a6<\/span>\u2194<span class=\"strong\">\u03a8)<\/span><\/td>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T \u00a0 \u00a0 \u00a0 \u00a0<\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T<\/span><\/td>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T \u00a0 \u00a0 \u00a0 \u00a0<\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F<\/span><\/td>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F \u00a0 \u00a0 \u00a0 \u00a0<\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F<\/span><\/td>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F \u00a0 \u00a0 \u00a0 \u00a0<\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T<\/span><\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\nOne pleasing result of our account of the biconditional is that it allows us to succinctly explain the syntactic notion of logical equivalence. \u00a0We say that two sentences <strong><span class=\"strong\">\u03a6<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">\u03a8<\/span>\u00a0<\/strong>are \u201cequivalent\u201d or \u201clogically equivalent\u201d if <strong><span class=\"strong\">(\u03a6<\/span>\u2194<span class=\"strong\">\u03a8)<\/span><\/strong>\u00a0is a theorem.\r\n<div class=\"textbox textbox--exercises\"><header class=\"textbox__header\">\r\n<p class=\"textbox__title\">Check for Understanding<\/p>\r\n\r\n<\/header>\r\n<div class=\"textbox__content\">\r\n<ol>\r\n \t<li><strong>Critical Thinking Task:\u00a0<\/strong>Select an image\/song\/artwork to demonstrate the concept of the biconditional. Please explain your selection.<\/li>\r\n<\/ol>\r\n<\/div>\r\n<\/div>\r\n<h2>9.3 How to Recognize a Biconditional in English<\/h2>\r\nIn English, it appears that there are several phrases that usually have the same meaning as the biconditional. \u00a0Each of the following sentences would be translated as<strong> <span class=\"strong\">(P\u2194Q)<\/span><\/strong>.\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span>\u00a0<\/strong>if and only if <strong><span class=\"strong\">Q<\/span><\/strong>.<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span>\u00a0<\/strong>just in case <strong><span class=\"strong\">Q<\/span><\/strong>.<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span>\u00a0<\/strong>is necessary and sufficient for <strong><span class=\"strong\">Q<\/span><\/strong>.<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span>\u00a0<\/strong>is equivalent to <strong><span class=\"strong\">Q<\/span><\/strong>.<\/p>\r\n\r\n<h2>9.4 \u00a0Reasoning with the biconditional<\/h2>\r\nHow can we reason using a biconditional? \u00a0At first, it would seem to offer little guidance. \u00a0If I know that<strong> <span class=\"strong\">(P\u2194Q)<\/span><\/strong>, I know that <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>have the same truth value, but from that sentence alone I do not know if they are both true or both false. \u00a0Nonetheless, we can take advantage of the semantics for the biconditional to observe that if we also know the truth value of one of the sentences constituting the biconditional, then we can derive the truth value of the other sentence. \u00a0This suggests a straightforward set of rules. \u00a0These will actually be four rules, but we will group them together under a single name,\u00a0\u201cequivalence\u201d:\r\n<div class=\"keep\">\r\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">(\u03a6\u2194\u03a8)<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">\u03a6<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">_____<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"margin-bottom: 40px; padding-left: 120px;\"><strong><span class=\"strong\">\u03a8<\/span><\/strong><\/p>\r\n\r\n<\/div>\r\nand\r\n<div class=\"keep\">\r\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">(\u03a6\u2194\u03a8)<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">\u03a8<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">_____<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"margin-bottom: 40px; padding-left: 120px;\"><strong><span class=\"strong\">\u03a6<\/span><\/strong><\/p>\r\n\r\n<\/div>\r\nand\r\n<div class=\"keep\">\r\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">(\u03a6\u2194\u03a8)<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">\u00ac\u03a6<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">_____<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"margin-bottom: 40px; padding-left: 120px;\"><strong><span class=\"strong\">\u00ac\u03a8<\/span><\/strong><\/p>\r\n\r\n<\/div>\r\nand\r\n<div class=\"keep\">\r\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">(\u03a6\u2194\u03a8)<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">\u00ac\u03a8<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">_____<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00ac\u03a6<\/span><\/strong><\/p>\r\n\r\n<\/div>\r\nWhat if we instead are trying to show a biconditional? \u00a0Here we can return to the insight that the biconditional<strong> <span class=\"strong\">(\u03a6\u2194\u03a8)<\/span>\u00a0<\/strong>is equivalent to <strong><span class=\"strong\">((\u03a6\u2192\u03a8)^(\u03a8\u2192\u03a6))<\/span><\/strong>. \u00a0If we could prove both <strong><span class=\"strong\">(\u03a6\u2192\u03a8)<\/span><\/strong>\u00a0and<strong> <span class=\"strong\">(\u03a8\u2192\u03a6)<\/span><\/strong>, we will know that <strong><span class=\"strong\">(\u03a6\u2194\u03a8)<\/span><\/strong>\u00a0must be true.\r\n\r\nWe can call this rule \u201cbicondition\u201d. \u00a0It has the following form:\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u03a6\u2192\u03a8)<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u03a8\u2192\u03a6)<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">_____<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u03a6\u2194\u03a8)<\/span><\/strong><\/p>\r\nThis means that often when we aim to prove a biconditional, we will undertake two conditional derivations to derive two conditionals, and then use the bicondition rule. \u00a0That is, many proofs of biconditionals have the following form:\r\n\r\n<img class=\"size-medium wp-image-371 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120936-204x300.png\" alt=\"\" width=\"204\" height=\"300\" \/>\r\n<h2>9.5 \u00a0Returning to Hume<\/h2>\r\nWe can now see if we are able to prove Hume\u2019s argument. \u00a0Given now the new biconditional symbol, we can begin a direct proof with our three premises.\r\n\r\n<img class=\"size-medium wp-image-372 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121004-300x87.png\" alt=\"\" width=\"300\" height=\"87\" \/>\r\n\r\nWe have already observed that we think <strong><span class=\"strong\">(QvR)<\/span><\/strong>\u00a0is false because <strong><span class=\"strong\">\u00acQ<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">\u00acR<\/span><\/strong>. \u00a0So let\u2019s prove <strong><span class=\"strong\">\u00ac(QvR)<\/span><\/strong>. \u00a0This sentence cannot be proved directly, given the premises we have; and it cannot be proven with a conditional proof, since it is not a conditional. \u00a0So let\u2019s try an indirect proof. \u00a0We believe that <strong><span class=\"strong\">\u00ac(QvR)<\/span><\/strong>\u00a0is true, so we\u2019ll assume the denial of this and show a contradiction.\r\n\r\n<img class=\" wp-image-373 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121027-300x128.png\" alt=\"\" width=\"382\" height=\"163\" \/>\r\n\r\nHume\u2019s argument, at least as we reconstructed it, is valid.\r\n\r\nIs Hume\u2019s argument sound? \u00a0Whether it is sound depends upon the first premise above (since the second and third premises are abstractions about some topic <em><strong><span class=\"em strong\">t<\/span><\/strong><\/em>). \u00a0Most specifically, it depends upon the claim that we have knowledge about something just in case we can show it with experiment or logic. \u00a0Hume argues we should distrust\u2014indeed, we should burn texts containing\u2014claims that are not from experiment and observation, or from logic and math. \u00a0But consider this claim: \u00a0we have knowledge about a topic <span class=\"em strong\">t<\/span>\u00a0if and only if our\u00a0claims about <span class=\"em strong\">t<\/span>\u00a0are learned from experiment or our claims about <span class=\"em strong\">t<\/span>\u00a0are learned from logic or mathematics.\r\n\r\nDid Hume discover this claim through experiments? \u00a0Or did he discover it through logic? \u00a0What fate would Hume\u2019s book suffer, if we took his advice?\r\n<h2>9.6 \u00a0Some examples<\/h2>\r\nIt can be helpful to prove some theorems that make use of the biconditional, in order to illustrate how we can reason with the biconditional.\r\n\r\nHere is a useful principle. \u00a0If two sentences have the same truth value as a third sentence, then they have the same truth value as each other. \u00a0We state this as <strong><span class=\"strong\">(((P\u2194Q)^(R\u2194Q))\u2192(P\u2194R))<\/span><\/strong>. \u00a0To illustrate reasoning with the biconditional, let us prove this theorem.\r\n\r\nThis theorem is a conditional, so it will require a conditional derivation. \u00a0The consequent of the conditional is a biconditional, so we will expect to need two conditional derivations, one to prove <strong><span class=\"strong\">(P\u2192R)<\/span><\/strong>\u00a0and one to prove<strong> <span class=\"strong\">(R\u2192P)<\/span><\/strong>. \u00a0The proof will look like this. \u00a0Study it closely.\r\n\r\n<img class=\" wp-image-374 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121103-300x210.png\" alt=\"\" width=\"466\" height=\"326\" \/>\r\n\r\nWe have mentioned before the principles that we associate with the mathematician Augustus De Morgan (1806-1871), and which today are called \u201cDe Morgan\u2019s Laws\u201d or the \u201cDe Morgan Equivalences\u201d. \u00a0These are the recognition that <strong><span class=\"strong\">\u00ac(PvQ) <\/span><\/strong>and <strong><span class=\"strong\">(\u00acP^\u00acQ)<\/span><\/strong>\u00a0are equivalent, and also that <strong><span class=\"strong\">\u00ac(P^Q) <\/span><\/strong>and <strong><span class=\"strong\">(\u00acPv\u00acQ)<\/span><\/strong>\u00a0are equivalent. \u00a0We can now express these with the biconditional. \u00a0The following are theorems of our logic:\r\n<p style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u00ac(PvQ)\u2194(\u00acP^\u00acQ))<\/span><\/strong><\/p>\r\n<p style=\"padding-left: 120px;\"><strong>(<span class=\"strong\">\u00ac(P^Q)\u2194(\u00acPv\u00acQ))<\/span><\/strong><\/p>\r\nWe will prove the second of these theorems. \u00a0This is perhaps the most difficult proof we have seen; it requires nested indirect proofs, and a fair amount of cleverness in finding what the relevant contradiction will be.\r\n\r\n<img class=\" wp-image-375 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121144-262x300.png\" alt=\"\" width=\"474\" height=\"543\" \/>\r\n<h2>9.7 Using theorems<\/h2>\r\n<div class=\"textbox textbox--key-takeaways\"><header class=\"textbox__header\">\r\n<p class=\"textbox__title\">Key Terms<\/p>\r\n\r\n<\/header>\r\n<div class=\"textbox__content\">\r\n<ul>\r\n \t<li><strong>Tautology<\/strong> - a statement that is always true, regardless of the truth values of its individual components.<\/li>\r\n \t<li><strong>Contradictory Sentence<\/strong> - a statement that is always false due to its logical form, regardless of the truth values of its components.<\/li>\r\n \t<li><strong>Contingent Sentence<\/strong> - one that can be either true or false depending on the specific truth values of its component parts.<\/li>\r\n<\/ul>\r\n<\/div>\r\n<\/div>\r\nEvery sentence of our logic is, in semantic terms, one of three kinds. \u00a0It is either a tautology, a contradictory sentence, or a contingent sentence. \u00a0We have already defined \u201ctautology\u201d (a sentence that must be true) and \u201ccontradictory sentence\u201d (a sentence that must be false). \u00a0A contingent sentence is a sentence that is neither a tautology nor a contradictory sentence. \u00a0Thus, a contingent sentence is a sentence that might be true, or might be false.\r\n\r\nHere is an example of each kind of sentence:\r\n<p style=\"padding-left: 120px;\"><strong><span class=\"strong\">(Pv\u00acP)<\/span><\/strong><\/p>\r\n<p style=\"padding-left: 120px;\"><strong><span class=\"strong\">(P\u2194\u00acP)<\/span><\/strong><\/p>\r\n<p style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span><\/strong><\/p>\r\nThe first is a tautology, the second is a contradictory sentence, and the third is contingent. \u00a0We can see this with a truth table.\r\n<table class=\"grid\">\r\n<tbody>\r\n<tr class=\"border-bottom\">\r\n<td class=\"border-right\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">P\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/td>\r\n<td class=\"border\"><span class=\"strong\">\u00acP<\/span><\/td>\r\n<td class=\"border\"><span class=\"strong\">(Pv\u00acP)<\/span><\/td>\r\n<td class=\"border\"><span class=\"strong\">(P\u2194\u00acP)<\/span><\/td>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">P<\/span><\/td>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border-right\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T<\/span><\/td>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border-right\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F<\/span><\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\nNotice that the negation of a tautology is a contradiction, the negation of a contradiction is a tautology, and the negation of a contingent sentence is a contingent sentence.\r\n<p style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00ac(Pv\u00acP)<\/span><\/strong><\/p>\r\n<p style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00ac(P\u2194\u00acP)<\/span><\/strong><\/p>\r\n<p style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00acP<\/span><\/strong><\/p>\r\n\r\n<table class=\"grid\">\r\n<tbody>\r\n<tr class=\"border-bottom\">\r\n<td class=\"border-right\"><strong>P<\/strong><\/td>\r\n<td class=\"border\"><strong>\u00acP<\/strong><\/td>\r\n<td class=\"border\"><strong>(Pv\u00acP)<\/strong><\/td>\r\n<td class=\"border\"><strong>\u00ac(Pv\u00acP)<\/strong><\/td>\r\n<td class=\"border\"><strong>(P\u2194\u00acP)<\/strong><\/td>\r\n<td class=\"border\"><strong>\u00ac(P\u2194\u00acP)<\/strong><\/td>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\nA moment\u2019s reflection will reveal that it would be quite a disaster if either a contradictory sentence or a contingent sentence were a theorem of our propositional logic. \u00a0Our logic was designed to produce only valid arguments. \u00a0Arguments that have no premises, we observed, should have conclusions that must be true (again, this follows because a sentence that can be proved with no premises could be proved with any premises, and so it had better be true no matter what premises we use). \u00a0If a theorem were contradictory, we would know that we could prove a falsehood. \u00a0If a theorem were contingent, then sometimes we could prove a falsehood (that is, we could prove a sentence that is under some conditions false). \u00a0And, given that we have adopted indirect derivation as a proof method, it follows that once we have a contradiction or a contradictory sentence in an argument, we can prove anything.\r\n\r\nTheorems can be very useful to us in arguments. \u00a0Suppose we know that neither Smith nor Jones will go to London, and we want to prove, therefore, that Jones will not go to London. \u00a0If we allowed ourselves to use one of De Morgan\u2019s theorems, we could make quick work of the argument. \u00a0Assume the following key.\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><span class=\"strong\"><strong>P<\/strong>:<\/span>\u00a0 Smith will go to London.<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><span class=\"strong\"><strong>Q<\/strong>:<\/span>\u00a0 Jones will go to London.<\/p>\r\nAnd we have the following argument:\r\n\r\n<img class=\" wp-image-376 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121230-300x92.png\" alt=\"\" width=\"355\" height=\"109\" \/>\r\n\r\nThis proof was made very easy by our use of the theorem at line 2.\r\n\r\nThere are two things to note about this. \u00a0First, we should allow ourselves to do this, because if we know that a sentence is a theorem, then we know that we could prove that theorem in a subproof. \u00a0That is, we could replace line 2 above with a long subproof that proves <strong><span class=\"strong\">(\u00ac(P v Q)\u2194(\u00acP ^ \u00acQ))<\/span><\/strong>, which we could then use. \u00a0But if we are certain that <strong><span class=\"strong\">(\u00ac(P v Q)\u2194(\u00acP ^ \u00acQ))<\/span><\/strong>\u00a0is a theorem, we should not need to do this proof again and again, each time that we want to make use of the theorem.\r\n\r\nThe second issue that we should recognize is more subtle. \u00a0There are infinitely many sentences of the form of our theorem, and we should be able to use those also. \u00a0For example, the following sentences would each have a proof identical to our proof of the theorem <strong><span class=\"strong\">(\u00ac(P v Q)\u2194(\u00acP ^ \u00acQ))<\/span><\/strong>, except that the letters would be different:\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u00ac(R v S) \u2194 (\u00acR ^ \u00acS))<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u00ac(T v U) \u2194 (\u00acT ^ \u00acU))<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u00ac(V v W) \u2194 (\u00acV ^ \u00acW))<\/span><\/strong><\/p>\r\nThis is hopefully obvious. \u00a0Take the proof of <strong><span class=\"strong\">(\u00ac(P v Q)\u2194(\u00acP ^ \u00acQ))<\/span><\/strong>, and in that proof replace each instance of <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>with <strong><span class=\"strong\">R<\/span>\u00a0<\/strong>and each instance of <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>with <strong><span class=\"strong\">S<\/span><\/strong>, and you would have a proof of <strong><span class=\"strong\">(\u00ac(R v S)\u2194(\u00acR ^ \u00acS))<\/span><\/strong>.\r\n\r\nBut here is something that perhaps is less obvious. \u00a0Each of the following can be thought of as similar to the theorem <strong><span class=\"strong\">(\u00ac(P v Q)\u2194(\u00acP ^ \u00acQ))<\/span><\/strong>.\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u00ac((P^Q) v (R^S))\u2194(\u00ac(P^Q) ^ \u00ac(R^S)))<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u00ac(T v (Q v V))\u2194(\u00acT ^ \u00ac(Q v V))<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u00ac((Q\u2194P) v (\u00acR\u2192\u00acQ))\u2194(\u00ac(Q\u2194P) ^ \u00ac(\u00acR\u2192\u00acQ)))<\/span><\/strong><\/p>\r\nFor example, if one took a proof of <strong><span class=\"strong\">(\u00ac(P v Q)\u2194(\u00acP ^ \u00acQ))<\/span><\/strong>\u00a0and replaced each initial instance of <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>with <strong><span class=\"strong\">(Q\u2194P)<\/span><\/strong>\u00a0and each initial instance of <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>with <strong><span class=\"strong\">(\u00acR\u2192\u00acQ)<\/span><\/strong>, then one would have a proof of the theorem <strong><span class=\"strong\">(\u00ac((Q\u2194P) v (\u00acR\u2192\u00acQ))\u2194(\u00ac(Q\u2194P) ^ \u00ac(\u00acR\u2192\u00acQ)))<\/span><\/strong>.\r\n\r\nWe could capture this insight in two ways. \u00a0We could state theorems of our metalanguage and allow that these have instances. \u00a0Thus, we could take <strong><span class=\"strong\">(\u00ac(\u03a6 v \u03a8) \u2194 (\u00ac\u03a6 ^ \u00ac\u03a8))<\/span><\/strong>\u00a0as a metalanguage theorem, in which we could replace each <strong><span class=\"strong\">\u03a6<\/span>\u00a0<\/strong>with a sentence and each <strong><span class=\"strong\">\u03a8<\/span>\u00a0<\/strong>with a sentence and get a particular instance of a theorem. \u00a0An alternative is to allow that from a theorem we can produce other theorems through substitution. \u00a0For ease, we will take this second strategy.\r\n\r\nOur rule will be this. \u00a0Once we prove a theorem, we can cite it in a proof at any time. \u00a0Our justification is that the claim is a theorem. \u00a0We allow substitution of any atomic sentence in the theorem with any other sentence if and only if we replace each initial instance of that atomic sentence in the theorem with the same sentence.\r\n\r\nBefore we consider an example, it is beneficial to list some useful theorems. \u00a0There are infinitely many theorems of our language, but these ten are often very helpful. \u00a0A few we have proved. \u00a0The others can be proved as an exercise.\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T1 \u00a0<strong><span class=\"strong\">(P v \u00acP)<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T2 <strong>\u00a0<span class=\"strong\">(\u00ac(P\u2192Q) \u2194 (P^\u00acQ))<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T3 \u00a0<strong><span class=\"strong\">(\u00ac(P v Q) \u2194 (\u00acP ^ \u00acQ))<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T4 \u00a0<strong><span class=\"strong\">((\u00acP v \u00acQ) \u2194 \u00ac(P ^ Q))<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T5 <strong>\u00a0<span class=\"strong\">(\u00ac(P \u2194 Q) \u2194 (P \u2194 \u00acQ))<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T6 \u00a0<strong>(<span class=\"strong\">\u00acP \u2192 (P \u2192 Q))<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T7 \u00a0<strong><span class=\"strong\">(P \u2192 (Q \u2192 P))<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T8 \u00a0<strong><span class=\"strong\">((P\u2192(Q\u2192R)) \u2192 ((P\u2192Q) \u2192 (P\u2192R)))<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T9 <strong>\u00a0<span class=\"strong\">((\u00acP\u2192\u00acQ) \u2192 ((\u00acP\u2192Q) \u2192P))<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T10<strong> \u00a0(<span class=\"strong\">(P\u2192Q) \u2192 (\u00acQ\u2192\u00acP))<\/span><\/strong><\/p>\r\nSome examples will make the advantage of using theorems clear. \u00a0Consider a different argument, building on the one above. \u00a0We know that neither is it the case that if Smith goes to London, he will go to Berlin, nor is it the case that if Jones goes to London he will go to Berlin. \u00a0We want to prove that it is not the case that Jones will go to Berlin. \u00a0We add the following to our key:\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><span class=\"strong\"><strong>R<\/strong>:<\/span>\u00a0 Smith will go to Berlin.<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><span class=\"strong\"><strong>S<\/strong>:<\/span>\u00a0 Jones will go to Berlin.<\/p>\r\nAnd we have the following argument:\r\n\r\n<img class=\"size-medium wp-image-377 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121259-300x132.png\" alt=\"\" width=\"300\" height=\"132\" \/>\r\n\r\nUsing theorems made this proof much shorter than it might otherwise be. \u00a0Also, theorems often make a proof easier to follow, since we recognize the theorems as tautologies\u2014as sentences that must be true.\r\n<h2>9.8 \u00a0Problems<\/h2>\r\n<ol>\r\n \t<li>Prove each of the following arguments is valid.\r\n<ol>\r\n \t<li>Premises: <strong><span class=\"strong\">((P^Q) \u2194 R), (P \u2194 S), (S ^ Q)<\/span><\/strong>. Conclusion: <strong><span class=\"strong\">R<\/span><\/strong>.<\/li>\r\n \t<li>Premises:<strong> <span class=\"strong\">(P \u2194 Q)<\/span><\/strong>. Conclusion: <strong>\u00a0<span class=\"strong\">((P \u2192 Q) ^ (Q \u2192 P))<\/span><\/strong>.<\/li>\r\n \t<li>Premises: <strong><span class=\"strong\">P, \u00acQ<\/span><\/strong>. Conclusion: <strong><span class=\"strong\">\u00ac(P \u2194 Q)<\/span><\/strong>.<\/li>\r\n \t<li>Premises: <strong><span class=\"strong\">(\u00acPvQ)<\/span>, <span class=\"strong\">(Pv\u00acQ)<\/span><\/strong>. Conclusion: <strong>\u00a0<span class=\"strong\">(P \u2194 Q)<\/span><\/strong>.<\/li>\r\n \t<li>Premises:<strong> <span class=\"strong\">(P \u2194 Q)<\/span>, <span class=\"strong\">(R \u2194 S)<\/span><\/strong>.\u00a0Conclusion: \u00a0<strong><span class=\"strong\">((P^R) \u2194 (Q^S))<\/span><\/strong>.<\/li>\r\n \t<li>Premises: \u00a0<strong><span class=\"strong\">((PvQ) \u2194 R), \u00ac(P \u2194 Q)<\/span><\/strong>.\u00a0Conclusion: \u00a0<strong><span class=\"strong\">R<\/span><\/strong>.<\/li>\r\n \t<li>Conclusion: <strong>\u00a0<span class=\"strong\">((P \u2194 Q) \u2194 (\u00acP \u2194 \u00acQ))<\/span><\/strong>.<\/li>\r\n \t<li>Conclusion: <strong>\u00a0<span class=\"strong\">((P \u2192 Q) \u2194 (\u00acP v Q))<\/span><\/strong>.<\/li>\r\n<\/ol>\r\n<\/li>\r\n \t<li>Prove each of the following theorems.\r\n<ol>\r\n \t<li>T2<\/li>\r\n \t<li>T3<\/li>\r\n \t<li>T5<\/li>\r\n \t<li>T6<\/li>\r\n \t<li>T7<\/li>\r\n \t<li>T8<\/li>\r\n \t<li>T9<\/li>\r\n \t<li><strong><span class=\"strong\">((P^Q) \u2194 \u00ac(\u00acPv\u00acQ))<\/span><\/strong><\/li>\r\n \t<li><strong><span class=\"strong\">((P\u2192 Q) \u2194 \u00ac(P^\u00acQ))<\/span><\/strong><\/li>\r\n<\/ol>\r\n<\/li>\r\n \t<li>Here are some passages from literature, philosophical works, and important political texts. Hopefully you recognize some of them. Find the best translation into propositional logic. Because these are from diverse texts you will find it easiest to make a new key for each sentence.\r\n<ol>\r\n \t<li>\u201cNeither a borrower nor a lender be.\u201d (Shakespeare, <i>Hamlet<\/i>.)<\/li>\r\n \t<li>\u201cMy copy-book was the board fence, brick wall, and pavement.\u201d (Frederick Douglass, <i>Narrative of the Life of Frederick Douglass<\/i>.)<\/li>\r\n \t<li>\u201cThe bourgeoisie has torn away from the family its sentimental veil, and has reduced the family relation to a mere money relation.\u201d (Marx and Engels, <i>The Communist Manifesto<\/i>.)<\/li>\r\n \t<li>\u201cThe Senate shall chuse their other Officers, and also a President pro tempore, in the Absence of the Vice President, or when he shall exercise the Office of President of the United States.\u201d (The Constitution of the United States.)<\/li>\r\n \t<li>\u201cExcessive bail shall not be required, nor excessive fines imposed, nor cruel and unusual punishments inflicted.\u201d (The Constitution of the United States.)<\/li>\r\n \t<li>\u201cAnnual income twenty pounds, annual expenditure nineteen nineteen and six, result happiness. Annual income twenty pounds, annual expenditure twenty pounds ought and six, result misery.\u201d (Charles Dickens, <i>Great Expectations<\/i>.)<\/li>\r\n \t<li>\u201cThou shalt get kings, though thou be none.\u201d (Shakespeare, <i>Macbeth<\/i>.)<\/li>\r\n \t<li>\u201cIf a faction consists of less than a majority, relief is supplied by the republican principle, which enables the majority to defeat its sinister views by regular vote.\u201d (Federalist Papers.)<\/li>\r\n<\/ol>\r\n<\/li>\r\n \t<li>In normal colloquial English, write your own valid argument with at least two premises, at least one of which is a biconditional. Your argument should just be a paragraph (not an ordered list of sentences or anything else that looks like formal logic). \u00a0Translate it into propositional logic and prove it is valid.<\/li>\r\n \t<li>In normal colloquial English, write your own valid argument with at least two premises, and with a conclusion that is a biconditional. Your argument should just be a paragraph (not an ordered list of sentences or anything else that looks formal like logic). \u00a0Translate it into propositional logic and prove it is valid.<\/li>\r\n \t<li>Here is a passage from Aquinas\u2019s reflections on the law, The Treatise on the Laws. Symbolize this argument and prove it is valid.<\/li>\r\n<\/ol>\r\n<p class=\"marg-left\">A law, properly speaking, regards first and foremost the order to the common good. Now if a law regards the order to the common good, then its making belongs either to the whole people, or to someone who is the viceregent of the whole people. And therefore the making of a law belongs either to the whole people or to the viceregent of the whole people.<\/p>\r\n\r\n<div>\r\n\r\n<hr \/>\r\n\r\n<a id=\"ftnt11\" href=\"#ftnt_ref11\">[11]<\/a>\u00a0From Hume\u2019s <span class=\"em\">Enquiry Concerning Human Understanding,<\/span>\u00a0p.161 in Selby-Bigge and Nidditch (1995 [1777]).\r\n\r\n<\/div>","rendered":"<h2>9.1 \u00a0A historical example<\/h2>\n<p>The philosopher David Hume (1711-1776) is remembered for being a brilliant skeptical empiricist. \u00a0A person is a skeptic about a topic if that person both has very strict standards for what constitutes knowledge about that topic and also believes we cannot meet those strict standards.<\/p>\n<p>Empiricism is the view that we primarily gain knowledge through experience, particular experiences of our senses. In his book, <span class=\"em\"><em>An Inquiry Concerning Human Understanding<\/em>,<\/span>\u00a0Hume lays out his principles for knowledge, and then advises us to clean up our libraries:<\/p>\n<blockquote><p>When we run over libraries, persuaded of these principles, what havoc must we make? If we take in our hand any volume of divinity or school metaphysics, for instance, let us ask, Does it contain any abstract reasoning concerning quantity or number? No. Does it contain any experimental reasoning concerning matter of fact and existence? No. Commit it then to the flames, for it can contain nothing but sophistry and illusion.<sup class=\"super\"><a id=\"ftnt_ref11\" href=\"#ftnt11\">[11]<\/a><\/sup><\/p><\/blockquote>\n<p>Hume felt that the only sources of knowledge were logical or mathematical reasoning (which he calls above \u201cabstract reasoning concerning quantity or number\u201d) or sense experience (\u201cexperimental reasoning concerning matter of fact and existence\u201d). \u00a0Hume is led to argue that any claims not based upon one or the other method is worthless.<\/p>\n<p>We can reconstruct Hume\u2019s argument in the following way. \u00a0Suppose <span class=\"em strong\">t<\/span>\u00a0is some topic about which we claim to have knowledge. \u00a0Suppose that we did not get this knowledge from experience or logic. \u00a0Written in English, we can reconstruct his argument in the following way:<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">We have knowledge about <em><strong><span class=\"em strong\">t<\/span>\u00a0<\/strong><\/em>if and only if our claims about <em><strong><span class=\"em strong\">t<\/span>\u00a0<\/strong><\/em>are learned from experimental reasoning or from logic or mathematics.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">Our claims about <em><strong><span class=\"em strong\">t<\/span>\u00a0<\/strong><\/em>are not learned from experimental reasoning.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">Our claims about <em><strong><span class=\"em strong\">t<\/span>\u00a0<\/strong><\/em>are not learned from logic or mathematics.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">_____<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">We do not have knowledge about <em><strong><span class=\"em strong\">t<\/span><\/strong><\/em><span class=\"em\">.<\/span><\/p>\n<p>What does that phrase \u201cif and only if\u201d mean? \u00a0Philosophers think that it, and several synonymous phrases, are used often in reasoning. \u00a0Leaving \u201cif and only\u201d unexplained for now, we can use the following translation key to write up the argument in a mix of our propositional logic and English.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span><\/strong>: \u00a0We have knowledge about <em><strong><span class=\"em strong\">t<\/span><\/strong><\/em><span class=\"em\">.<\/span><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">Q<\/span><\/strong>: \u00a0Our claims about <span class=\"em strong\">t<\/span>\u00a0are learned from experimental reasoning.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">R<\/span><\/strong>: \u00a0Our claims about <span class=\"em strong\">t<\/span>\u00a0are learned from logic or mathematics.<\/p>\n<p>And so we have:<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span>\u00a0<\/strong>if and only if<strong> <span class=\"strong\">(QvR)<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00acQ<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00acR<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong>_____<\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00acP<\/span><\/strong><\/p>\n<p>Our task is to add to our logical language an equivalent to \u201cif and only if\u201d. \u00a0Then we can evaluate this reformulation of Hume\u2019s argument.<\/p>\n<div class=\"textbox textbox--exercises\">\n<header class=\"textbox__header\">\n<p class=\"textbox__title\">Check for Understanding<\/p>\n<\/header>\n<div class=\"textbox__content\">\n<ol>\n<li><strong>Critical Thinking Task:\u00a0<\/strong>Create a story\/song\/poem you could use to explain the concept of empiricism to a family member.<\/li>\n<\/ol>\n<\/div>\n<\/div>\n<h2>9.2 \u00a0The biconditional<\/h2>\n<div class=\"textbox textbox--learning-objectives\">\n<header class=\"textbox__header\">\n<p class=\"textbox__title\">Pre-Reading Questions<\/p>\n<\/header>\n<div class=\"textbox__content\">\n<ol>\n<li>What do you think the phrase &#8220;if and only if&#8221; means in everyday language? Can you give an example of a statement that uses this phrase?<\/li>\n<li>How would you express the meaning of &#8220;P if and only if Q&#8221; by breaking it down into simpler logical statements?<\/li>\n<\/ol>\n<\/div>\n<\/div>\n<div class=\"textbox textbox--key-takeaways\">\n<header class=\"textbox__header\">\n<p class=\"textbox__title\">Key Terms<\/p>\n<\/header>\n<div class=\"textbox__content\">\n<ul>\n<li><strong>Biconditional<\/strong> &#8211; often written as &#8220;p if and only if q&#8221; (or p q), is true when both p and q have the same truth value (both true or both false) and is false otherwise.<\/li>\n<li><strong>Syntactic Equivalence<\/strong> &#8211; two statements or formulas have the same form and structure.<\/li>\n<li><strong>Modus Tollendo Ponens<\/strong> &#8211; also known as Disjunctive Syllogism, is a valid rule of inference in logic. It states that if a disjunction (an &#8220;or&#8221; statement) is true, and one of the disjuncts (the options in the &#8220;or&#8221; statement) is false, then the other disjunct must be true.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<p>Before we introduce a symbol synonymous with \u201cif and only if\u201d, and then lay out its syntax and semantics, we should start with an observation. \u00a0A phrase like \u201c<strong><span class=\"strong\">P<\/span>\u00a0<\/strong>if and only if <strong><span class=\"strong\">Q<\/span><\/strong>\u201d appears to be an abbreviated way of saying \u201c<strong><span class=\"strong\">P<\/span>\u00a0<\/strong>if <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>only if <strong><span class=\"strong\">Q<\/span><\/strong>\u201d. \u00a0Once we notice this, we do not have to try to discern the meaning of \u201cif and only if\u201d using our expert understanding of English. \u00a0Instead, we can discern the meaning of \u201cif and only if\u201d using our already rigorous definitions of \u201cif\u201d, \u201cand\u201d, and \u201conly if\u201d. \u00a0Specifically, \u201c<strong><span class=\"strong\">P<\/span>\u00a0<\/strong>if <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>only if <strong><span class=\"strong\">Q<\/span><\/strong>\u201d will be translated \u201c<strong><span class=\"strong\">((Q<\/span><span class=\"strong\">\u2192P)^(P\u2192Q))<\/span><\/strong>\u201d. \u00a0(If this is unclear to you, go back and review section 2.2.) \u00a0Now, let us make a truth table for this formula.<\/p>\n<table class=\"grid\">\n<tbody>\n<tr class=\"border-bottom\">\n<td class=\"border\" rowspan=\"1\"><strong><span class=\"strong\">P \u00a0 \u00a0 <\/span><\/strong><\/td>\n<td class=\"border-right\"><strong><span class=\"strong\">Q<\/span><\/strong><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><strong><span class=\"strong\">(Q \u2192 P) \u00a0 \u00a0<\/span><\/strong><\/td>\n<td class=\"border strong\"><strong>(P \u2192 Q)<\/strong><\/td>\n<td class=\"border strong\"><strong>((Q\u2192P)^(P\u2192Q))<\/strong><\/td>\n<\/tr>\n<tr>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T \u00a0 \u00a0 <\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T \u00a0<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<\/tr>\n<tr>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T \u00a0 \u00a0 <\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T \u00a0<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<\/tr>\n<tr>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F \u00a0 \u00a0 <\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F \u00a0\u00a0<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<\/tr>\n<tr>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F \u00a0 \u00a0 <\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T\u00a0<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>We have settled the semantics for \u201cif and only if\u201d. \u00a0 We can now introduce a new symbol for this expression. \u00a0It is traditional to use the double arrow, \u201c\u2194\u201d. \u00a0We can now express the syntax and semantics of \u201c\u2194\u201d.<\/p>\n<p>If <strong><span class=\"strong\">\u03a6<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">\u03a8<\/span>\u00a0<\/strong>are sentences, then<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u03a6\u2194\u03a8)<\/span><\/strong><\/p>\n<p>is a sentence. \u00a0This kind of sentence is typically called a \u201cbiconditional\u201d.<\/p>\n<p>The semantics is given by the following truth table.<\/p>\n<table class=\"grid\">\n<tbody>\n<tr class=\"border-bottom\">\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">\u03a6 \u00a0 \u00a0 \u00a0 \u00a0<\/span><\/td>\n<td class=\"border-right\"><span class=\"strong\">\u03a8<\/span><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">(\u03a6<\/span>\u2194<span class=\"strong\">\u03a8)<\/span><\/td>\n<\/tr>\n<tr>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T \u00a0 \u00a0 \u00a0 \u00a0<\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T<\/span><\/td>\n<\/tr>\n<tr>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T \u00a0 \u00a0 \u00a0 \u00a0<\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F<\/span><\/td>\n<\/tr>\n<tr>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F \u00a0 \u00a0 \u00a0 \u00a0<\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F<\/span><\/td>\n<\/tr>\n<tr>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F \u00a0 \u00a0 \u00a0 \u00a0<\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>One pleasing result of our account of the biconditional is that it allows us to succinctly explain the syntactic notion of logical equivalence. \u00a0We say that two sentences <strong><span class=\"strong\">\u03a6<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">\u03a8<\/span>\u00a0<\/strong>are \u201cequivalent\u201d or \u201clogically equivalent\u201d if <strong><span class=\"strong\">(\u03a6<\/span>\u2194<span class=\"strong\">\u03a8)<\/span><\/strong>\u00a0is a theorem.<\/p>\n<div class=\"textbox textbox--exercises\">\n<header class=\"textbox__header\">\n<p class=\"textbox__title\">Check for Understanding<\/p>\n<\/header>\n<div class=\"textbox__content\">\n<ol>\n<li><strong>Critical Thinking Task:\u00a0<\/strong>Select an image\/song\/artwork to demonstrate the concept of the biconditional. Please explain your selection.<\/li>\n<\/ol>\n<\/div>\n<\/div>\n<h2>9.3 How to Recognize a Biconditional in English<\/h2>\n<p>In English, it appears that there are several phrases that usually have the same meaning as the biconditional. \u00a0Each of the following sentences would be translated as<strong> <span class=\"strong\">(P\u2194Q)<\/span><\/strong>.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span>\u00a0<\/strong>if and only if <strong><span class=\"strong\">Q<\/span><\/strong>.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span>\u00a0<\/strong>just in case <strong><span class=\"strong\">Q<\/span><\/strong>.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span>\u00a0<\/strong>is necessary and sufficient for <strong><span class=\"strong\">Q<\/span><\/strong>.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span>\u00a0<\/strong>is equivalent to <strong><span class=\"strong\">Q<\/span><\/strong>.<\/p>\n<h2>9.4 \u00a0Reasoning with the biconditional<\/h2>\n<p>How can we reason using a biconditional? \u00a0At first, it would seem to offer little guidance. \u00a0If I know that<strong> <span class=\"strong\">(P\u2194Q)<\/span><\/strong>, I know that <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>have the same truth value, but from that sentence alone I do not know if they are both true or both false. \u00a0Nonetheless, we can take advantage of the semantics for the biconditional to observe that if we also know the truth value of one of the sentences constituting the biconditional, then we can derive the truth value of the other sentence. \u00a0This suggests a straightforward set of rules. \u00a0These will actually be four rules, but we will group them together under a single name,\u00a0\u201cequivalence\u201d:<\/p>\n<div class=\"keep\">\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">(\u03a6\u2194\u03a8)<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">\u03a6<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">_____<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"margin-bottom: 40px; padding-left: 120px;\"><strong><span class=\"strong\">\u03a8<\/span><\/strong><\/p>\n<\/div>\n<p>and<\/p>\n<div class=\"keep\">\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">(\u03a6\u2194\u03a8)<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">\u03a8<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">_____<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"margin-bottom: 40px; padding-left: 120px;\"><strong><span class=\"strong\">\u03a6<\/span><\/strong><\/p>\n<\/div>\n<p>and<\/p>\n<div class=\"keep\">\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">(\u03a6\u2194\u03a8)<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">\u00ac\u03a6<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">_____<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"margin-bottom: 40px; padding-left: 120px;\"><strong><span class=\"strong\">\u00ac\u03a8<\/span><\/strong><\/p>\n<\/div>\n<p>and<\/p>\n<div class=\"keep\">\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">(\u03a6\u2194\u03a8)<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">\u00ac\u03a8<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"margin-bottom: 0px; padding-left: 120px;\"><strong><span class=\"strong\">_____<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00ac\u03a6<\/span><\/strong><\/p>\n<\/div>\n<p>What if we instead are trying to show a biconditional? \u00a0Here we can return to the insight that the biconditional<strong> <span class=\"strong\">(\u03a6\u2194\u03a8)<\/span>\u00a0<\/strong>is equivalent to <strong><span class=\"strong\">((\u03a6\u2192\u03a8)^(\u03a8\u2192\u03a6))<\/span><\/strong>. \u00a0If we could prove both <strong><span class=\"strong\">(\u03a6\u2192\u03a8)<\/span><\/strong>\u00a0and<strong> <span class=\"strong\">(\u03a8\u2192\u03a6)<\/span><\/strong>, we will know that <strong><span class=\"strong\">(\u03a6\u2194\u03a8)<\/span><\/strong>\u00a0must be true.<\/p>\n<p>We can call this rule \u201cbicondition\u201d. \u00a0It has the following form:<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u03a6\u2192\u03a8)<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u03a8\u2192\u03a6)<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">_____<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u03a6\u2194\u03a8)<\/span><\/strong><\/p>\n<p>This means that often when we aim to prove a biconditional, we will undertake two conditional derivations to derive two conditionals, and then use the bicondition rule. \u00a0That is, many proofs of biconditionals have the following form:<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"size-medium wp-image-371 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120936-204x300.png\" alt=\"\" width=\"204\" height=\"300\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120936-204x300.png 204w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120936-65x96.png 65w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120936-225x332.png 225w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120936.png 270w\" sizes=\"auto, (max-width: 204px) 100vw, 204px\" \/><\/p>\n<h2>9.5 \u00a0Returning to Hume<\/h2>\n<p>We can now see if we are able to prove Hume\u2019s argument. \u00a0Given now the new biconditional symbol, we can begin a direct proof with our three premises.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"size-medium wp-image-372 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121004-300x87.png\" alt=\"\" width=\"300\" height=\"87\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121004-300x87.png 300w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121004-65x19.png 65w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121004-225x65.png 225w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121004-350x101.png 350w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121004.png 632w\" sizes=\"auto, (max-width: 300px) 100vw, 300px\" \/><\/p>\n<p>We have already observed that we think <strong><span class=\"strong\">(QvR)<\/span><\/strong>\u00a0is false because <strong><span class=\"strong\">\u00acQ<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">\u00acR<\/span><\/strong>. \u00a0So let\u2019s prove <strong><span class=\"strong\">\u00ac(QvR)<\/span><\/strong>. \u00a0This sentence cannot be proved directly, given the premises we have; and it cannot be proven with a conditional proof, since it is not a conditional. \u00a0So let\u2019s try an indirect proof. \u00a0We believe that <strong><span class=\"strong\">\u00ac(QvR)<\/span><\/strong>\u00a0is true, so we\u2019ll assume the denial of this and show a contradiction.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-373 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121027-300x128.png\" alt=\"\" width=\"382\" height=\"163\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121027-300x128.png 300w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121027-768x327.png 768w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121027-65x28.png 65w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121027-225x96.png 225w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121027-350x149.png 350w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121027.png 842w\" sizes=\"auto, (max-width: 382px) 100vw, 382px\" \/><\/p>\n<p>Hume\u2019s argument, at least as we reconstructed it, is valid.<\/p>\n<p>Is Hume\u2019s argument sound? \u00a0Whether it is sound depends upon the first premise above (since the second and third premises are abstractions about some topic <em><strong><span class=\"em strong\">t<\/span><\/strong><\/em>). \u00a0Most specifically, it depends upon the claim that we have knowledge about something just in case we can show it with experiment or logic. \u00a0Hume argues we should distrust\u2014indeed, we should burn texts containing\u2014claims that are not from experiment and observation, or from logic and math. \u00a0But consider this claim: \u00a0we have knowledge about a topic <span class=\"em strong\">t<\/span>\u00a0if and only if our\u00a0claims about <span class=\"em strong\">t<\/span>\u00a0are learned from experiment or our claims about <span class=\"em strong\">t<\/span>\u00a0are learned from logic or mathematics.<\/p>\n<p>Did Hume discover this claim through experiments? \u00a0Or did he discover it through logic? \u00a0What fate would Hume\u2019s book suffer, if we took his advice?<\/p>\n<h2>9.6 \u00a0Some examples<\/h2>\n<p>It can be helpful to prove some theorems that make use of the biconditional, in order to illustrate how we can reason with the biconditional.<\/p>\n<p>Here is a useful principle. \u00a0If two sentences have the same truth value as a third sentence, then they have the same truth value as each other. \u00a0We state this as <strong><span class=\"strong\">(((P\u2194Q)^(R\u2194Q))\u2192(P\u2194R))<\/span><\/strong>. \u00a0To illustrate reasoning with the biconditional, let us prove this theorem.<\/p>\n<p>This theorem is a conditional, so it will require a conditional derivation. \u00a0The consequent of the conditional is a biconditional, so we will expect to need two conditional derivations, one to prove <strong><span class=\"strong\">(P\u2192R)<\/span><\/strong>\u00a0and one to prove<strong> <span class=\"strong\">(R\u2192P)<\/span><\/strong>. \u00a0The proof will look like this. \u00a0Study it closely.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-374 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121103-300x210.png\" alt=\"\" width=\"466\" height=\"326\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121103-300x210.png 300w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121103-768x537.png 768w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121103-65x45.png 65w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121103-225x157.png 225w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121103-350x245.png 350w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121103.png 885w\" sizes=\"auto, (max-width: 466px) 100vw, 466px\" \/><\/p>\n<p>We have mentioned before the principles that we associate with the mathematician Augustus De Morgan (1806-1871), and which today are called \u201cDe Morgan\u2019s Laws\u201d or the \u201cDe Morgan Equivalences\u201d. \u00a0These are the recognition that <strong><span class=\"strong\">\u00ac(PvQ) <\/span><\/strong>and <strong><span class=\"strong\">(\u00acP^\u00acQ)<\/span><\/strong>\u00a0are equivalent, and also that <strong><span class=\"strong\">\u00ac(P^Q) <\/span><\/strong>and <strong><span class=\"strong\">(\u00acPv\u00acQ)<\/span><\/strong>\u00a0are equivalent. \u00a0We can now express these with the biconditional. \u00a0The following are theorems of our logic:<\/p>\n<p style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u00ac(PvQ)\u2194(\u00acP^\u00acQ))<\/span><\/strong><\/p>\n<p style=\"padding-left: 120px;\"><strong>(<span class=\"strong\">\u00ac(P^Q)\u2194(\u00acPv\u00acQ))<\/span><\/strong><\/p>\n<p>We will prove the second of these theorems. \u00a0This is perhaps the most difficult proof we have seen; it requires nested indirect proofs, and a fair amount of cleverness in finding what the relevant contradiction will be.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-375 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121144-262x300.png\" alt=\"\" width=\"474\" height=\"543\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121144-262x300.png 262w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121144-65x75.png 65w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121144-225x258.png 225w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121144-350x401.png 350w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121144.png 620w\" sizes=\"auto, (max-width: 474px) 100vw, 474px\" \/><\/p>\n<h2>9.7 Using theorems<\/h2>\n<div class=\"textbox textbox--key-takeaways\">\n<header class=\"textbox__header\">\n<p class=\"textbox__title\">Key Terms<\/p>\n<\/header>\n<div class=\"textbox__content\">\n<ul>\n<li><strong>Tautology<\/strong> &#8211; a statement that is always true, regardless of the truth values of its individual components.<\/li>\n<li><strong>Contradictory Sentence<\/strong> &#8211; a statement that is always false due to its logical form, regardless of the truth values of its components.<\/li>\n<li><strong>Contingent Sentence<\/strong> &#8211; one that can be either true or false depending on the specific truth values of its component parts.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<p>Every sentence of our logic is, in semantic terms, one of three kinds. \u00a0It is either a tautology, a contradictory sentence, or a contingent sentence. \u00a0We have already defined \u201ctautology\u201d (a sentence that must be true) and \u201ccontradictory sentence\u201d (a sentence that must be false). \u00a0A contingent sentence is a sentence that is neither a tautology nor a contradictory sentence. \u00a0Thus, a contingent sentence is a sentence that might be true, or might be false.<\/p>\n<p>Here is an example of each kind of sentence:<\/p>\n<p style=\"padding-left: 120px;\"><strong><span class=\"strong\">(Pv\u00acP)<\/span><\/strong><\/p>\n<p style=\"padding-left: 120px;\"><strong><span class=\"strong\">(P\u2194\u00acP)<\/span><\/strong><\/p>\n<p style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span><\/strong><\/p>\n<p>The first is a tautology, the second is a contradictory sentence, and the third is contingent. \u00a0We can see this with a truth table.<\/p>\n<table class=\"grid\">\n<tbody>\n<tr class=\"border-bottom\">\n<td class=\"border-right\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">P\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/td>\n<td class=\"border\"><span class=\"strong\">\u00acP<\/span><\/td>\n<td class=\"border\"><span class=\"strong\">(Pv\u00acP)<\/span><\/td>\n<td class=\"border\"><span class=\"strong\">(P\u2194\u00acP)<\/span><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">P<\/span><\/td>\n<\/tr>\n<tr>\n<td class=\"border-right\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T<\/span><\/td>\n<\/tr>\n<tr>\n<td class=\"border-right\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>Notice that the negation of a tautology is a contradiction, the negation of a contradiction is a tautology, and the negation of a contingent sentence is a contingent sentence.<\/p>\n<p style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00ac(Pv\u00acP)<\/span><\/strong><\/p>\n<p style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00ac(P\u2194\u00acP)<\/span><\/strong><\/p>\n<p style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00acP<\/span><\/strong><\/p>\n<table class=\"grid\">\n<tbody>\n<tr class=\"border-bottom\">\n<td class=\"border-right\"><strong>P<\/strong><\/td>\n<td class=\"border\"><strong>\u00acP<\/strong><\/td>\n<td class=\"border\"><strong>(Pv\u00acP)<\/strong><\/td>\n<td class=\"border\"><strong>\u00ac(Pv\u00acP)<\/strong><\/td>\n<td class=\"border\"><strong>(P\u2194\u00acP)<\/strong><\/td>\n<td class=\"border\"><strong>\u00ac(P\u2194\u00acP)<\/strong><\/td>\n<\/tr>\n<tr>\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<\/tr>\n<tr>\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>A moment\u2019s reflection will reveal that it would be quite a disaster if either a contradictory sentence or a contingent sentence were a theorem of our propositional logic. \u00a0Our logic was designed to produce only valid arguments. \u00a0Arguments that have no premises, we observed, should have conclusions that must be true (again, this follows because a sentence that can be proved with no premises could be proved with any premises, and so it had better be true no matter what premises we use). \u00a0If a theorem were contradictory, we would know that we could prove a falsehood. \u00a0If a theorem were contingent, then sometimes we could prove a falsehood (that is, we could prove a sentence that is under some conditions false). \u00a0And, given that we have adopted indirect derivation as a proof method, it follows that once we have a contradiction or a contradictory sentence in an argument, we can prove anything.<\/p>\n<p>Theorems can be very useful to us in arguments. \u00a0Suppose we know that neither Smith nor Jones will go to London, and we want to prove, therefore, that Jones will not go to London. \u00a0If we allowed ourselves to use one of De Morgan\u2019s theorems, we could make quick work of the argument. \u00a0Assume the following key.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><span class=\"strong\"><strong>P<\/strong>:<\/span>\u00a0 Smith will go to London.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><span class=\"strong\"><strong>Q<\/strong>:<\/span>\u00a0 Jones will go to London.<\/p>\n<p>And we have the following argument:<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-376 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121230-300x92.png\" alt=\"\" width=\"355\" height=\"109\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121230-300x92.png 300w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121230-65x20.png 65w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121230-225x69.png 225w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121230-350x107.png 350w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121230.png 674w\" sizes=\"auto, (max-width: 355px) 100vw, 355px\" \/><\/p>\n<p>This proof was made very easy by our use of the theorem at line 2.<\/p>\n<p>There are two things to note about this. \u00a0First, we should allow ourselves to do this, because if we know that a sentence is a theorem, then we know that we could prove that theorem in a subproof. \u00a0That is, we could replace line 2 above with a long subproof that proves <strong><span class=\"strong\">(\u00ac(P v Q)\u2194(\u00acP ^ \u00acQ))<\/span><\/strong>, which we could then use. \u00a0But if we are certain that <strong><span class=\"strong\">(\u00ac(P v Q)\u2194(\u00acP ^ \u00acQ))<\/span><\/strong>\u00a0is a theorem, we should not need to do this proof again and again, each time that we want to make use of the theorem.<\/p>\n<p>The second issue that we should recognize is more subtle. \u00a0There are infinitely many sentences of the form of our theorem, and we should be able to use those also. \u00a0For example, the following sentences would each have a proof identical to our proof of the theorem <strong><span class=\"strong\">(\u00ac(P v Q)\u2194(\u00acP ^ \u00acQ))<\/span><\/strong>, except that the letters would be different:<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u00ac(R v S) \u2194 (\u00acR ^ \u00acS))<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u00ac(T v U) \u2194 (\u00acT ^ \u00acU))<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u00ac(V v W) \u2194 (\u00acV ^ \u00acW))<\/span><\/strong><\/p>\n<p>This is hopefully obvious. \u00a0Take the proof of <strong><span class=\"strong\">(\u00ac(P v Q)\u2194(\u00acP ^ \u00acQ))<\/span><\/strong>, and in that proof replace each instance of <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>with <strong><span class=\"strong\">R<\/span>\u00a0<\/strong>and each instance of <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>with <strong><span class=\"strong\">S<\/span><\/strong>, and you would have a proof of <strong><span class=\"strong\">(\u00ac(R v S)\u2194(\u00acR ^ \u00acS))<\/span><\/strong>.<\/p>\n<p>But here is something that perhaps is less obvious. \u00a0Each of the following can be thought of as similar to the theorem <strong><span class=\"strong\">(\u00ac(P v Q)\u2194(\u00acP ^ \u00acQ))<\/span><\/strong>.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u00ac((P^Q) v (R^S))\u2194(\u00ac(P^Q) ^ \u00ac(R^S)))<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u00ac(T v (Q v V))\u2194(\u00acT ^ \u00ac(Q v V))<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(\u00ac((Q\u2194P) v (\u00acR\u2192\u00acQ))\u2194(\u00ac(Q\u2194P) ^ \u00ac(\u00acR\u2192\u00acQ)))<\/span><\/strong><\/p>\n<p>For example, if one took a proof of <strong><span class=\"strong\">(\u00ac(P v Q)\u2194(\u00acP ^ \u00acQ))<\/span><\/strong>\u00a0and replaced each initial instance of <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>with <strong><span class=\"strong\">(Q\u2194P)<\/span><\/strong>\u00a0and each initial instance of <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>with <strong><span class=\"strong\">(\u00acR\u2192\u00acQ)<\/span><\/strong>, then one would have a proof of the theorem <strong><span class=\"strong\">(\u00ac((Q\u2194P) v (\u00acR\u2192\u00acQ))\u2194(\u00ac(Q\u2194P) ^ \u00ac(\u00acR\u2192\u00acQ)))<\/span><\/strong>.<\/p>\n<p>We could capture this insight in two ways. \u00a0We could state theorems of our metalanguage and allow that these have instances. \u00a0Thus, we could take <strong><span class=\"strong\">(\u00ac(\u03a6 v \u03a8) \u2194 (\u00ac\u03a6 ^ \u00ac\u03a8))<\/span><\/strong>\u00a0as a metalanguage theorem, in which we could replace each <strong><span class=\"strong\">\u03a6<\/span>\u00a0<\/strong>with a sentence and each <strong><span class=\"strong\">\u03a8<\/span>\u00a0<\/strong>with a sentence and get a particular instance of a theorem. \u00a0An alternative is to allow that from a theorem we can produce other theorems through substitution. \u00a0For ease, we will take this second strategy.<\/p>\n<p>Our rule will be this. \u00a0Once we prove a theorem, we can cite it in a proof at any time. \u00a0Our justification is that the claim is a theorem. \u00a0We allow substitution of any atomic sentence in the theorem with any other sentence if and only if we replace each initial instance of that atomic sentence in the theorem with the same sentence.<\/p>\n<p>Before we consider an example, it is beneficial to list some useful theorems. \u00a0There are infinitely many theorems of our language, but these ten are often very helpful. \u00a0A few we have proved. \u00a0The others can be proved as an exercise.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T1 \u00a0<strong><span class=\"strong\">(P v \u00acP)<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T2 <strong>\u00a0<span class=\"strong\">(\u00ac(P\u2192Q) \u2194 (P^\u00acQ))<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T3 \u00a0<strong><span class=\"strong\">(\u00ac(P v Q) \u2194 (\u00acP ^ \u00acQ))<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T4 \u00a0<strong><span class=\"strong\">((\u00acP v \u00acQ) \u2194 \u00ac(P ^ Q))<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T5 <strong>\u00a0<span class=\"strong\">(\u00ac(P \u2194 Q) \u2194 (P \u2194 \u00acQ))<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T6 \u00a0<strong>(<span class=\"strong\">\u00acP \u2192 (P \u2192 Q))<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T7 \u00a0<strong><span class=\"strong\">(P \u2192 (Q \u2192 P))<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T8 \u00a0<strong><span class=\"strong\">((P\u2192(Q\u2192R)) \u2192 ((P\u2192Q) \u2192 (P\u2192R)))<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T9 <strong>\u00a0<span class=\"strong\">((\u00acP\u2192\u00acQ) \u2192 ((\u00acP\u2192Q) \u2192P))<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">T10<strong> \u00a0(<span class=\"strong\">(P\u2192Q) \u2192 (\u00acQ\u2192\u00acP))<\/span><\/strong><\/p>\n<p>Some examples will make the advantage of using theorems clear. \u00a0Consider a different argument, building on the one above. \u00a0We know that neither is it the case that if Smith goes to London, he will go to Berlin, nor is it the case that if Jones goes to London he will go to Berlin. \u00a0We want to prove that it is not the case that Jones will go to Berlin. \u00a0We add the following to our key:<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><span class=\"strong\"><strong>R<\/strong>:<\/span>\u00a0 Smith will go to Berlin.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><span class=\"strong\"><strong>S<\/strong>:<\/span>\u00a0 Jones will go to Berlin.<\/p>\n<p>And we have the following argument:<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"size-medium wp-image-377 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121259-300x132.png\" alt=\"\" width=\"300\" height=\"132\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121259-300x132.png 300w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121259-65x29.png 65w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121259-225x99.png 225w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121259-350x154.png 350w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-121259.png 679w\" sizes=\"auto, (max-width: 300px) 100vw, 300px\" \/><\/p>\n<p>Using theorems made this proof much shorter than it might otherwise be. \u00a0Also, theorems often make a proof easier to follow, since we recognize the theorems as tautologies\u2014as sentences that must be true.<\/p>\n<h2>9.8 \u00a0Problems<\/h2>\n<ol>\n<li>Prove each of the following arguments is valid.\n<ol>\n<li>Premises: <strong><span class=\"strong\">((P^Q) \u2194 R), (P \u2194 S), (S ^ Q)<\/span><\/strong>. Conclusion: <strong><span class=\"strong\">R<\/span><\/strong>.<\/li>\n<li>Premises:<strong> <span class=\"strong\">(P \u2194 Q)<\/span><\/strong>. Conclusion: <strong>\u00a0<span class=\"strong\">((P \u2192 Q) ^ (Q \u2192 P))<\/span><\/strong>.<\/li>\n<li>Premises: <strong><span class=\"strong\">P, \u00acQ<\/span><\/strong>. Conclusion: <strong><span class=\"strong\">\u00ac(P \u2194 Q)<\/span><\/strong>.<\/li>\n<li>Premises: <strong><span class=\"strong\">(\u00acPvQ)<\/span>, <span class=\"strong\">(Pv\u00acQ)<\/span><\/strong>. Conclusion: <strong>\u00a0<span class=\"strong\">(P \u2194 Q)<\/span><\/strong>.<\/li>\n<li>Premises:<strong> <span class=\"strong\">(P \u2194 Q)<\/span>, <span class=\"strong\">(R \u2194 S)<\/span><\/strong>.\u00a0Conclusion: \u00a0<strong><span class=\"strong\">((P^R) \u2194 (Q^S))<\/span><\/strong>.<\/li>\n<li>Premises: \u00a0<strong><span class=\"strong\">((PvQ) \u2194 R), \u00ac(P \u2194 Q)<\/span><\/strong>.\u00a0Conclusion: \u00a0<strong><span class=\"strong\">R<\/span><\/strong>.<\/li>\n<li>Conclusion: <strong>\u00a0<span class=\"strong\">((P \u2194 Q) \u2194 (\u00acP \u2194 \u00acQ))<\/span><\/strong>.<\/li>\n<li>Conclusion: <strong>\u00a0<span class=\"strong\">((P \u2192 Q) \u2194 (\u00acP v Q))<\/span><\/strong>.<\/li>\n<\/ol>\n<\/li>\n<li>Prove each of the following theorems.\n<ol>\n<li>T2<\/li>\n<li>T3<\/li>\n<li>T5<\/li>\n<li>T6<\/li>\n<li>T7<\/li>\n<li>T8<\/li>\n<li>T9<\/li>\n<li><strong><span class=\"strong\">((P^Q) \u2194 \u00ac(\u00acPv\u00acQ))<\/span><\/strong><\/li>\n<li><strong><span class=\"strong\">((P\u2192 Q) \u2194 \u00ac(P^\u00acQ))<\/span><\/strong><\/li>\n<\/ol>\n<\/li>\n<li>Here are some passages from literature, philosophical works, and important political texts. Hopefully you recognize some of them. Find the best translation into propositional logic. Because these are from diverse texts you will find it easiest to make a new key for each sentence.\n<ol>\n<li>\u201cNeither a borrower nor a lender be.\u201d (Shakespeare, <i>Hamlet<\/i>.)<\/li>\n<li>\u201cMy copy-book was the board fence, brick wall, and pavement.\u201d (Frederick Douglass, <i>Narrative of the Life of Frederick Douglass<\/i>.)<\/li>\n<li>\u201cThe bourgeoisie has torn away from the family its sentimental veil, and has reduced the family relation to a mere money relation.\u201d (Marx and Engels, <i>The Communist Manifesto<\/i>.)<\/li>\n<li>\u201cThe Senate shall chuse their other Officers, and also a President pro tempore, in the Absence of the Vice President, or when he shall exercise the Office of President of the United States.\u201d (The Constitution of the United States.)<\/li>\n<li>\u201cExcessive bail shall not be required, nor excessive fines imposed, nor cruel and unusual punishments inflicted.\u201d (The Constitution of the United States.)<\/li>\n<li>\u201cAnnual income twenty pounds, annual expenditure nineteen nineteen and six, result happiness. Annual income twenty pounds, annual expenditure twenty pounds ought and six, result misery.\u201d (Charles Dickens, <i>Great Expectations<\/i>.)<\/li>\n<li>\u201cThou shalt get kings, though thou be none.\u201d (Shakespeare, <i>Macbeth<\/i>.)<\/li>\n<li>\u201cIf a faction consists of less than a majority, relief is supplied by the republican principle, which enables the majority to defeat its sinister views by regular vote.\u201d (Federalist Papers.)<\/li>\n<\/ol>\n<\/li>\n<li>In normal colloquial English, write your own valid argument with at least two premises, at least one of which is a biconditional. Your argument should just be a paragraph (not an ordered list of sentences or anything else that looks like formal logic). \u00a0Translate it into propositional logic and prove it is valid.<\/li>\n<li>In normal colloquial English, write your own valid argument with at least two premises, and with a conclusion that is a biconditional. Your argument should just be a paragraph (not an ordered list of sentences or anything else that looks formal like logic). \u00a0Translate it into propositional logic and prove it is valid.<\/li>\n<li>Here is a passage from Aquinas\u2019s reflections on the law, The Treatise on the Laws. Symbolize this argument and prove it is valid.<\/li>\n<\/ol>\n<p class=\"marg-left\">A law, properly speaking, regards first and foremost the order to the common good. Now if a law regards the order to the common good, then its making belongs either to the whole people, or to someone who is the viceregent of the whole people. And therefore the making of a law belongs either to the whole people or to the viceregent of the whole people.<\/p>\n<div>\n<hr \/>\n<p><a id=\"ftnt11\" href=\"#ftnt_ref11\">[11]<\/a>\u00a0From Hume\u2019s <span class=\"em\">Enquiry Concerning Human Understanding,<\/span>\u00a0p.161 in Selby-Bigge and Nidditch (1995 [1777]).<\/p>\n<\/div>\n","protected":false},"author":158,"menu_order":9,"template":"","meta":{"pb_show_title":"on","pb_short_title":"","pb_subtitle":"","pb_authors":[],"pb_section_license":"cc-by-nc-sa"},"chapter-type":[],"contributor":[],"license":[56],"class_list":["post-49","chapter","type-chapter","status-publish","hentry","license-cc-by-nc-sa"],"part":27,"_links":{"self":[{"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/pressbooks\/v2\/chapters\/49","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/pressbooks\/v2\/chapters"}],"about":[{"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/wp\/v2\/types\/chapter"}],"author":[{"embeddable":true,"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/wp\/v2\/users\/158"}],"version-history":[{"count":12,"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/pressbooks\/v2\/chapters\/49\/revisions"}],"predecessor-version":[{"id":378,"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/pressbooks\/v2\/chapters\/49\/revisions\/378"}],"part":[{"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/pressbooks\/v2\/parts\/27"}],"metadata":[{"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/pressbooks\/v2\/chapters\/49\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/wp\/v2\/media?parent=49"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/pressbooks\/v2\/chapter-type?post=49"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/wp\/v2\/contributor?post=49"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/wp\/v2\/license?post=49"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}