{"id":47,"date":"2016-12-16T18:14:05","date_gmt":"2016-12-16T18:14:05","guid":{"rendered":"https:\/\/pressbooks.ccconline.org\/introtologic\/chapter\/8-reductio-ad-absurdum\/"},"modified":"2025-10-13T18:07:53","modified_gmt":"2025-10-13T18:07:53","slug":"8-reductio-ad-absurdum","status":"publish","type":"chapter","link":"https:\/\/pressbooks.ccconline.org\/introtologic\/chapter\/8-reductio-ad-absurdum\/","title":{"raw":"Reductio ad Absurdum","rendered":"Reductio ad Absurdum"},"content":{"raw":"<h2>8.1 \u00a0A historical example<\/h2>\r\nIn his book, <span class=\"em\">The Two New Sciences<\/span>,<sup class=\"super\"><a id=\"ftnt_ref10\" href=\"#ftnt10\">[10]<\/a><\/sup>\u00a0Galileo Galilea (1564-1642) gives several arguments meant to demonstrate that there can be no such thing as actual infinities or actual infinitesimals. One of his arguments can be reconstructed in the following way. \u00a0Galileo proposes that we take as a premise that there is an actual infinity of natural numbers (the natural numbers are the positive whole numbers from 1 on):\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">{1,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a02,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a03,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a04,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a05,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a06,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a07, \u00a0\u2026.}<\/p>\r\nHe also proposes that we take as a premise that there is an actual infinity of the squares of the natural numbers.\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">{1,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a04,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a09,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a016,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a025,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a036,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a049, \u00a0\u2026.}<\/p>\r\nNow, Galileo reasons, note that these two groups (today we would call them \u201csets\u201d) have the same size. \u00a0We can see this because we can see that there is a one-to-one correspondence between the two groups.\r\n<table class=\" undefined\">\r\n<tbody>\r\n<tr>\r\n<td style=\"text-align: left;\">{1,<\/td>\r\n<td style=\"text-align: left;\">2,<\/td>\r\n<td style=\"text-align: left;\">3,<\/td>\r\n<td style=\"text-align: left;\">4,<\/td>\r\n<td style=\"text-align: left;\">5,<\/td>\r\n<td style=\"text-align: left;\">6,<\/td>\r\n<td style=\"text-align: left;\">7,\u00a0\u2026.}<\/td>\r\n<\/tr>\r\n<tr>\r\n<td style=\"text-align: left;\">\u00a0<img class=\"no-border alignnone wp-image-256 size-full\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/arrow.png\" alt=\"arrow\" width=\"37\" height=\"84\" \/><\/td>\r\n<td style=\"text-align: left;\">\u00a0<img class=\"no-border alignnone wp-image-256 size-full\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/arrow.png\" alt=\"arrow\" width=\"37\" height=\"84\" \/><\/td>\r\n<td style=\"text-align: left;\">\u00a0<img class=\"no-border alignnone wp-image-256 size-full\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/arrow.png\" alt=\"arrow\" width=\"37\" height=\"84\" \/><\/td>\r\n<td style=\"text-align: left;\"><img class=\"no-border alignnone wp-image-256 size-full\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/arrow.png\" alt=\"arrow\" width=\"37\" height=\"84\" \/><\/td>\r\n<td style=\"text-align: left;\">\u00a0<img class=\"no-border alignnone wp-image-256 size-full\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/arrow.png\" alt=\"arrow\" width=\"37\" height=\"84\" \/><\/td>\r\n<td style=\"text-align: left;\">\u00a0<img class=\"no-border alignnone wp-image-256 size-full\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/arrow.png\" alt=\"arrow\" width=\"37\" height=\"84\" \/><\/td>\r\n<td style=\"text-align: left;\">\u00a0<img class=\"no-border alignnone wp-image-256 size-full\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/arrow.png\" alt=\"arrow\" width=\"37\" height=\"84\" \/><\/td>\r\n<\/tr>\r\n<tr>\r\n<td style=\"text-align: left;\">\u00a0{1,<\/td>\r\n<td style=\"text-align: left;\">\u00a04,<\/td>\r\n<td style=\"text-align: left;\">9,<\/td>\r\n<td style=\"text-align: left;\">16,<\/td>\r\n<td style=\"text-align: left;\">25,<\/td>\r\n<td style=\"text-align: left;\">36,<\/td>\r\n<td style=\"text-align: left;\">49, ...}<\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\nIf we can associate every natural number with one and only one square number, and if we can associate every square number with one and only one natural number, then these sets must be the same size.\r\n\r\nBut wait a moment, Galileo says. \u00a0There are obviously very many more natural numbers than there are square numbers. \u00a0That is, every square number is in the list of natural numbers, but many of the natural numbers are not in the list of square numbers. \u00a0The following numbers are all in the list of natural numbers but not in the list of square numbers.\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\">{2,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a03,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a05,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a06,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a07,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a08,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a010, \u00a0\u2026.}<\/p>\r\nSo, Galileo reasons, if there are many numbers in the group of natural numbers that are not in the group of the square numbers, and if there are no numbers in the group of the square numbers that are not in the naturals numbers, then the natural numbers is bigger than the square numbers. \u00a0And if the group of the natural numbers is bigger than the group of the square numbers, then the natural numbers and the square numbers are not the same size.\r\n\r\nWe have reached two conclusions: \u00a0the set of the natural numbers and the set of the square numbers are the same size; and, the set of the natural numbers and the set of the square numbers are not the same size. \u00a0That\u2019s contradictory.\r\n\r\nGalileo argues that the reason we reached a contradiction is because we assumed that there are actual infinities. \u00a0He concludes, therefore, that there are no actual infinities.\r\n<h2>8.2 \u00a0Indirect proofs<\/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>Reductio Ad Absurdism<\/strong> - a logical argument that disproves a statement by showing that its logical consequences lead to an absurd, contradictory, or false conclusion.<\/li>\r\n \t<li><strong>Contradiction<\/strong> - a statement or set of statements that, when taken together, always result in a false statement.<\/li>\r\n \t<li><strong>Subproof<\/strong> - a proof contained within another, larger proof.<\/li>\r\n \t<li><strong>Deduction Theorem<\/strong> - states that if a formula B can be derived from a set of assumptions \u0393 and an additional assumption A, then the formula A\u2192B (A implies B) can be derived from \u0393 alone.<\/li>\r\n<\/ul>\r\n<\/div>\r\n<\/div>\r\nOur logic is not yet strong enough to prove some valid arguments. \u00a0Consider the following argument as an example.\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(P<\/span><span class=\"strong\">\u2192(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><span class=\"strong\">_____<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00acP<\/span><\/strong><\/p>\r\nThis argument looks valid. \u00a0By the first premise we know: \u00a0if <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>were true, then so would <strong><span class=\"strong\">(Q v R)<\/span><\/strong>\u00a0be true. \u00a0But then either <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>or <strong><span class=\"strong\">R<\/span>\u00a0<\/strong>or both would be true. \u00a0And by the second and third premises we know: <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>is false and <strong><span class=\"strong\">R<\/span>\u00a0<\/strong>is false. \u00a0So it cannot be that <strong><span class=\"strong\">(Q v R)<\/span><\/strong>\u00a0is true, and so it cannot be that <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>is true.\r\n\r\nWe can check the argument using a truth table. \u00a0Our table will be complex because one of our premise is complex.\r\n<table class=\"grid\">\r\n<tbody>\r\n<tr class=\"border\">\r\n<th class=\"border\"><\/th>\r\n<th class=\"border\"><\/th>\r\n<th class=\"border-right\"><\/th>\r\n<th class=\"border\"><\/th>\r\n<td class=\"border\">premise<\/td>\r\n<td class=\"border\">\u00a0premise<\/td>\r\n<td class=\"border\">premise<\/td>\r\n<td class=\"border\">\u00a0conclusion<\/td>\r\n<\/tr>\r\n<tr class=\"border-bottom\">\r\n<th class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">P<\/span><\/th>\r\n<th class=\"border\"><span class=\"strong\">Q<\/span><\/th>\r\n<th class=\"border-right\"><span class=\"strong\">R<\/span><\/th>\r\n<th class=\"border\" style=\"text-align: center;\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">(QvR)<\/span><\/th>\r\n<th class=\"border\">(P\u2192(QvR))<\/th>\r\n<th class=\"border\">\u00acQ<\/th>\r\n<th class=\"border\">\u00acR<\/th>\r\n<th class=\"border\">\u00acP<\/th>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T <\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\" style=\"text-align: center;\" colspan=\"1\" rowspan=\"1\"><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\">F<\/span><\/td>\r\n<\/tr>\r\n<tr>\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-right\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\" style=\"text-align: center;\" colspan=\"1\" rowspan=\"1\"><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\">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\">T<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F <\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\" style=\"text-align: center;\" colspan=\"1\" rowspan=\"1\"><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\">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<\/tr>\r\n<tr>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\" style=\"text-align: center;\" colspan=\"1\" rowspan=\"1\"><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<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<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\" style=\"text-align: center;\" colspan=\"1\" rowspan=\"1\"><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<tr>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\" style=\"text-align: center;\" 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\">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<\/tr>\r\n<tr>\r\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"border\" style=\"text-align: center;\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">\u00a0T \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\"><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\">F<\/span><\/td>\r\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"border\" style=\"text-align: center;\"><span class=\"em strong\">F<\/span><\/td>\r\n<td class=\"shaded\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"shaded\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"shaded\"><span class=\"em strong\">T<\/span><\/td>\r\n<td class=\"shaded\"><span class=\"em strong\">T<\/span><\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\nIn any kind of situation in which all the premises are true, the conclusion is true. \u00a0That is: \u00a0the premises are all true only in the last row. For that row, the conclusion is also true. \u00a0So, this is a valid argument.\r\n\r\nBut take a minute and try to prove this argument. \u00a0We begin with\r\n\r\n<img class=\"size-medium wp-image-362 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120131-300x80.png\" alt=\"\" width=\"300\" height=\"80\" \/>\r\n\r\nAnd now we are stopped. \u00a0We cannot apply any of our rules. \u00a0Here is a valid argument that we have not made our reasoning system strong enough to prove.\r\n\r\nThere are several ways to rectify this problem and to make our reasoning system strong enough. \u00a0One of the oldest solutions is to introduce a new proof method, traditionally called \u201creductio ad absurdum\u201d, which means <span class=\"em\">a reduction to absurdity<\/span>. \u00a0This method is also often called an \u201cindirect proof\u201d or \u201cindirect derivation\u201d.\r\n\r\nThe idea is that we assume the denial of our conclusion, and then show that a contradiction results. \u00a0A <strong>contradiction<\/strong> is shown when we prove some sentence <strong><span class=\"strong\">\u03a8<\/span><\/strong>, and its negation <strong><span class=\"strong\">\u00ac\u03a8<\/span><\/strong>. \u00a0This can be any sentence. \u00a0The point is that, given the principle of bivalence, we must have proven something false. \u00a0For if <strong><span class=\"strong\">\u03a8<\/span>\u00a0<\/strong>is true, then <strong><span class=\"strong\">\u00ac\u03a8<\/span><\/strong>\u00a0is false; and if <strong><span class=\"strong\">\u00ac\u03a8<\/span><\/strong>\u00a0is true, then <strong><span class=\"strong\">\u03a8<\/span>\u00a0<\/strong>is false. \u00a0We don\u2019t need to know which is false (<strong><span class=\"strong\">\u03a8<\/span>\u00a0<\/strong>or <strong><span class=\"strong\">\u00ac\u03a8<\/span><\/strong>); it is enough to know that one of them must be.\r\n\r\nRemember that we have built our logical system so that it cannot produce a falsehood from true statements. \u00a0The source of the falsehood that we produce in the indirect derivation must, therefore, be some falsehood that we added to our argument. \u00a0And what we added to our argument is the denial of the conclusion. \u00a0Thus, the conclusion must be true.\r\n\r\nThe shape of the argument is like this:\r\n\r\n<img class=\"size-full wp-image-363 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120157.png\" alt=\"\" width=\"199\" height=\"227\" \/>\r\n\r\nTraditionally, the assumption for indirect derivation has also been commonly called \u201cthe assumption for reductio\u201d.\r\n\r\nAs a concrete example, we can prove our perplexing case.\r\n\r\n<img class=\" wp-image-364 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120224-300x120.png\" alt=\"\" width=\"400\" height=\"160\" \/>\r\n\r\nWe assumed the denial of our conclusion on line 4. \u00a0The conclusion we believed was correct was <strong><span class=\"strong\">\u00acP<\/span><\/strong>, and the denial of this is <strong><span class=\"strong\">\u00ac\u00acP<\/span><\/strong>. \u00a0In line 7,\u00a0we proved <strong><span class=\"strong\">R<\/span><\/strong>. \u00a0Technically, we are done at that point, but we would like to be kind to anyone trying to understand our proof, so we repeat line 3 so that the sentences <strong><span class=\"strong\">R<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">\u00acR<\/span><\/strong>\u00a0are side by side, and it is very easy to see that something has gone wrong. \u00a0That is, if we have proven both <strong><span class=\"strong\">R<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">\u00acR<\/span><\/strong>, then we have proven something false.\r\n\r\nOur reasoning now goes like this. \u00a0What went wrong? \u00a0Line 8 is a correct use of repetition; line 7 comes from a correct use of modus tollendo ponens; line 6 from a correct use of modus ponens; line 5 from a correct use of double negation. \u00a0So,\u00a0we did not make a mistake in our reasoning. \u00a0We used lines 1, 2, and 3, but those are premises that we agreed to assume are correct. \u00a0This leaves line 4. \u00a0That must be the source of my contradiction. \u00a0It must be false. \u00a0If line 4 is false, then <strong><span class=\"strong\">\u00acP<\/span><\/strong>\u00a0is true.\r\n\r\nSome people consider indirect proofs less strong than direct proofs. \u00a0There are many, and complex, reasons for this. \u00a0But,\u00a0for our propositional logic, none of these reasons apply. \u00a0This is because it is possible to prove that our propositional logic is consistent. \u00a0This means, it is possible to prove that our propositional logic cannot prove a falsehood unless one first introduces a falsehood into the system. \u00a0(It is generally not possible to prove that more powerful and advanced logical or mathematical systems are consistent, from inside those systems; for example, one cannot prove in arithmetic that arithmetic is consistent.)\r\n\r\nGiven that we can be certain of the consistency of the propositional logic, we can be certain that in our propositional logic an indirect proof is a good form of reasoning. \u00a0We know that if we prove a falsehood, we must have put a falsehood in; and if we are confident about all the other assumptions (that is, the premises) of our proof except for the assumption for indirect derivation, then we can be confident that this assumption for indirect derivation must be the source of the falsehood.\r\n\r\nA note about terminology is required here. \u00a0The word \u201ccontradiction\u201d gets used ambiguously in most logic discussions. \u00a0It can mean a situation like we see above, where two sentences are asserted, and these sentences cannot both be true. \u00a0Or it can mean a single sentence that cannot be true. \u00a0An example of such a sentence is<strong> <span class=\"strong\">(P^\u00acP)<\/span><\/strong>. \u00a0The truth table for this sentence is:\r\n<div class=\"keep\">\r\n<table class=\"grid\">\r\n<tbody>\r\n<tr class=\"border-bottom\">\r\n<th class=\"border-right\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">P<\/span><\/th>\r\n<th class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">\u00acP \u00a0 \u00a0 \u00a0\u00a0<\/span><\/th>\r\n<th class=\"border\"><span class=\"strong\">\u00a0(P ^ \u00acP)<\/span><\/th>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border-right\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T<\/span><\/td>\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\"><span class=\"em strong\">F<\/span><\/td>\r\n<\/tr>\r\n<tr>\r\n<td class=\"border-right\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F<\/span><\/td>\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\"><span class=\"em strong\">F<\/span><\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<\/div>\r\nThus, this kind of sentence can never be true, regardless of the meaning of <span class=\"strong\">P<\/span>.\r\n\r\nTo avoid ambiguity, in this text, we will always call a single sentence that cannot be true a \u201ccontradictory sentence\u201d. \u00a0Thus,<strong> <span class=\"strong\">(P^\u00acP)<\/span><\/strong>\u00a0is a contradictory sentence. \u00a0Situations where two sentences are asserted that cannot both be true will be called a \u201ccontradiction\u201d.\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>Define \"reductio ad absurdum\" in your own words and explain its logical foundation.<\/li>\r\n \t<li>Create your own valid argument that would require an indirect proof method to demonstrate its validity.<\/li>\r\n \t<li><strong>Critical Thinking Task:\u00a0<\/strong>Provide an image that represents an indirect derivation in a visual format. Explain why this image is appropriate for describing this proof method.<\/li>\r\n<\/ol>\r\n<\/div>\r\n<\/div>\r\n<h2>8.3 \u00a0Our example, and other examples<\/h2>\r\nWe can reconstruct a version of Galileo\u2019s argument now. \u00a0We will use the following key.\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span><\/strong>: There are actual infinities (including the natural numbers and the square numbers).<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">Q<\/span><\/strong>: There is a one-to-one correspondence between the natural numbers and the square numbers.<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">R<\/span><\/strong>: The size of the set of the natural numbers and the size of the set of the square numbers are the same.<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">S<\/span><\/strong>: All the square numbers are natural numbers.<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">T<\/span><\/strong>: Some of the natural numbers are not square numbers.<\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">U<\/span><\/strong>: There are more natural numbers than square numbers.<\/p>\r\nWith this key, the argument will be translated:\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(P\u2192Q)<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(Q\u2192R)<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(P\u2192(S^T))<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">((S^T)\u2192U)<\/span><\/strong><\/p>\r\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(U\u2192\u00acR)<\/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\">\u00acP<\/span><\/strong><\/p>\r\nAnd we can prove this is a valid argument by using indirect derivation:\r\n\r\n<img class=\" wp-image-365 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120419-300x164.png\" alt=\"\" width=\"410\" height=\"224\" \/>\r\n\r\nOn line 6, we assumed <strong><span class=\"strong\">\u00ac\u00acP<\/span><\/strong>\u00a0because Galileo believed that <strong><span class=\"strong\">\u00acP<\/span><\/strong>\u00a0and aimed to prove that <strong><span class=\"strong\">\u00acP<\/span><\/strong>. \u00a0That is, he believed that there are no actual infinities, and so assumed that it was false to believe that it is not the case that there are no actual infinities. \u00a0This falsehood will lead to other falsehoods, exposing itself.\r\n\r\nFor those who are interested: \u00a0Galileo concluded that there are no actual infinities but there are potential infinities. \u00a0Thus, he reasoned, it is not the case that all the natural numbers exist (in some sense of \u201cexist\u201d), but it is true that you could count natural numbers forever. \u00a0Many philosophers before and after Galileo held this view; it is similar to a view held by Aristotle, who was an important logician and philosopher writing nearly two thousand years before Galileo.\r\n\r\nNote that in an argument like this, you could reason that not the assumption for indirect derivation, but rather one of the premises was the source of the contradiction. \u00a0Today, most mathematicians believe this about Galileo\u2019s argument. \u00a0A logician and mathematician named Georg Cantor (1845-1918), the inventor of set theory, argued that infinite sets can have proper subsets of the same size.\r\n\r\nThat is, Cantor denied premise 4 above: \u00a0even though all the square numbers are natural numbers, and not all natural numbers are square numbers, it is not the case that these two sets are of different size. \u00a0Cantor accepted however premise 2 above, and, therefore, believed that the size of the set of natural numbers and the size of the set of square numbers is the same. \u00a0Today, using Cantor\u2019s reasoning, mathematicians and logicians study infinity, and have developed a large body of knowledge about the nature of infinity. \u00a0If this interests you, see section 17.5.\r\n\r\nLet us consider another example to illustrate indirect derivation. \u00a0A very useful set of theorems are today called \u201cDe Morgan\u2019s Theorems\u201d, after the logician Augustus De Morgan (1806\u20131871). \u00a0We cannot state these fully until chapter 9, but we can state their equivalent in English: \u00a0DeMorgan observed that <strong><span class=\"strong\">\u00ac(PvQ) <\/span><\/strong>and <strong><span class=\"strong\">(\u00acP^\u00acQ)<\/span><\/strong>\u00a0are equivalent, and also that <span class=\"strong\"><strong>\u00ac(P^Q)<\/strong> <\/span>and <strong><span class=\"strong\">(\u00acPv\u00acQ)<\/span><\/strong>\u00a0are equivalent. \u00a0Given this, it should be a theorem of our language that <strong><span class=\"strong\">(\u00ac(PvQ)<\/span><span class=\"strong\">\u2192(\u00acP^\u00acQ))<\/span><\/strong>. \u00a0Let\u2019s prove this.\r\n\r\nThe whole formula is a conditional, so we will use a conditional derivation. \u00a0Our proof must thus begin:\r\n\r\n<img class=\"size-medium wp-image-366 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120447-300x61.png\" alt=\"\" width=\"300\" height=\"61\" \/>\r\n\r\nTo complete the conditional derivation, we must prove <strong><span class=\"strong\">(\u00acP^\u00acQ)<\/span><\/strong>. \u00a0This is a conjunction, and our rule for showing conjunctions is adjunction. \u00a0Since using this rule might be our best way to show <strong><span class=\"strong\">(\u00acP^\u00acQ)<\/span><\/strong>, we can aim to show <strong><span class=\"strong\">\u00acP<\/span><\/strong>\u00a0and then show <strong><span class=\"strong\">\u00acQ<\/span><\/strong>, and then perform adjunction. \u00a0But, we obviously have very little to work with\u2014just line 1, which is a negation. \u00a0In such a case, it is typically wise to attempt an indirect proof. \u00a0Start with an indirect proof of <strong><span class=\"strong\">\u00acP<\/span><\/strong>.\r\n\r\n<img class=\" wp-image-367 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120510-300x98.png\" alt=\"\" width=\"343\" height=\"112\" \/>\r\n\r\nWe now need to find a contradiction\u2014any contradiction. \u00a0But there is an obvious one already. \u00a0Line 1 says that neither <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>nor <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>is true. \u00a0But line 3 says that <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>is true. \u00a0We must make this contradiction explicit by finding\u00a0a formula and its denial. \u00a0We can do this using addition.\r\n\r\n<img class=\" wp-image-368 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120535-300x110.png\" alt=\"\" width=\"363\" height=\"133\" \/>\r\n\r\nTo complete the proof, we will use this strategy again.\r\n\r\n<img class=\" wp-image-369 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120601-300x175.png\" alt=\"\" width=\"425\" height=\"248\" \/>\r\n\r\nWe will prove De Morgan\u2019s theorems as problems for chapter 9.\r\n\r\nHere is a general rule of thumb for doing proofs: \u00a0When proving a conditional, always do conditional derivation; otherwise, try direct derivation; if that fails, then, try indirect derivation.\r\n<h2>8.4 \u00a0Problems<\/h2>\r\n<ol class=\"lst-kix_list_22-0 start\" start=\"1\">\r\n \t<li>Complete the following proofs. \u00a0Each will require an indirect derivation. \u00a0The last two are challenging.\r\n<ol class=\"lst-kix_list_22-0 start\" start=\"1\">\r\n \t<li>Premises: \u00a0<strong><span class=\"strong\">(P \u2192 R)<\/span>, <span class=\"strong\">(Q \u2192 R)<\/span>, <span class=\"strong\">(PvQ)<\/span><\/strong>. Conclusion: \u00a0<strong><span class=\"strong\">R<\/span><\/strong>.<\/li>\r\n \t<li>Premises: \u00a0<strong><span class=\"strong\">((PvQ) \u2192 R)<\/span>, <span class=\"strong\">\u00acR<\/span><\/strong>. \u00a0Conclusion: <strong><span class=\"strong\">\u00acP<\/span><\/strong>.<\/li>\r\n \t<li>Premise:\u00a0<strong><span class=\"strong\">(\u00acP^\u00acQ)<\/span><\/strong>. \u00a0Conclusion: <strong><span class=\"strong\">\u00ac(PvQ)<\/span><\/strong>.<\/li>\r\n \t<li>Premise:\u00a0<strong><span class=\"strong\">\u00ac(P^Q)<\/span><\/strong>. \u00a0Conclusion: <strong><span class=\"strong\">(\u00acPv\u00acQ)<\/span><\/strong>.<\/li>\r\n \t<li>Premise:\u00a0<strong><span class=\"strong\">(\u00acPv\u00acQ)<\/span><\/strong>. \u00a0Conclusion: <strong><span class=\"strong\">\u00ac(P^Q)<\/span><\/strong>.<\/li>\r\n \t<li>Premise:\u00a0<strong><span class=\"strong\">(P \u2192 R)<\/span>, <span class=\"strong\">(Q \u2192 S)<\/span>, <span class=\"strong\">\u00ac(R ^ S)<\/span><\/strong>. Conclusion: \u00a0<strong><span class=\"strong\">\u00ac(P ^ Q)<\/span><\/strong>.<\/li>\r\n \t<li>Premise: \u00a0<strong><span class=\"strong\">\u00acR<\/span>, (<span class=\"strong\">(P \u2192 R) v (Q \u2192 R))<\/span><\/strong>. \u00a0Conclusion:<span class=\"strong\">\u00a0<strong>(\u00acP v \u00acQ)<\/strong><\/span>.<\/li>\r\n \t<li>Premise: \u00a0<strong><span class=\"strong\">\u00ac(R v S)<\/span>, <span class=\"strong\">(P<\/span><span class=\"strong\">\u2192<\/span><span class=\"strong\">R)<\/span>, <span class=\"strong\">(Q<\/span><span class=\"strong\">\u2192<\/span><span class=\"strong\">S)<\/span><\/strong>. \u00a0Conclusion:<span class=\"strong\">\u00a0<strong>\u00ac(P v Q)<\/strong><\/span>.<\/li>\r\n<\/ol>\r\n<\/li>\r\n \t<li>Prove the following are theorems.\r\n<ol class=\"lst-kix_list_22-0 start\" start=\"1\">\r\n \t<li><strong><span class=\"strong\">\u00ac(P^\u00acP)<\/span>.<\/strong><\/li>\r\n \t<li><strong>(<span class=\"strong\">\u00acP \u2192 \u00ac(P^Q))<\/span>.<\/strong><\/li>\r\n \t<li><strong><span class=\"strong\">((P^\u00acQ) \u2192 \u00ac(P \u2192 Q))<\/span>.<\/strong><\/li>\r\n \t<li><strong><span class=\"strong\">((P \u2192 Q) \u2192 \u00ac(P ^ \u00acQ))<\/span>.<\/strong><\/li>\r\n \t<li><strong><span class=\"strong\">(\u00ac(P v Q) \u2192 \u00acP)<\/span>.<\/strong><\/li>\r\n \t<li><strong><span class=\"strong\">((\u00acP ^ \u00acQ) \u2192 \u00ac(P v Q))<\/span>.<\/strong><\/li>\r\n \t<li><strong><span class=\"strong\">((\u00acP v \u00acQ) \u2192 \u00ac(P ^ Q))<\/span>.<\/strong><\/li>\r\n \t<li><strong><span class=\"strong\">(\u00ac(P ^ Q) \u2192 (\u00acP v \u00acQ))<\/span>.<\/strong><\/li>\r\n \t<li><strong><span class=\"strong\">\u00ac((P \u2192 \u00acP)^(\u00acP \u2192 P))<\/span>.<\/strong><\/li>\r\n \t<li><strong><span class=\"strong\">(P v \u00acP)<\/span>.<\/strong><\/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. 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 using an indirect derivation.<\/li>\r\n \t<li>Translate the following argument into English, and then prove it is valid using an indirect proof.<\/li>\r\n<\/ol>\r\n<p class=\"marg-left\">Either Beneke or Meinong conned Dodgson with marked cards. But either Beneke didn't do it or the marked cards are in the car. But also, if Meinong did it, the marked cards are in the car. So, regardless of whether Beneke or Meinong conned Dodgson, the cards are in the car.<\/p>\r\n\r\n<div>\r\n\r\n<hr \/>\r\n\r\n<a id=\"ftnt10\" href=\"#ftnt_ref10\">[10]<\/a>\u00a0This translation of the title of Galileo\u2019s book has become the most common, although a more literal one would have been <span class=\"em\">Mathematical Discourses and Demonstrations. \u00a0<\/span>Translations of the book include Drake (1974).\r\n\r\n<\/div>","rendered":"<h2>8.1 \u00a0A historical example<\/h2>\n<p>In his book, <span class=\"em\">The Two New Sciences<\/span>,<sup class=\"super\"><a id=\"ftnt_ref10\" href=\"#ftnt10\">[10]<\/a><\/sup>\u00a0Galileo Galilea (1564-1642) gives several arguments meant to demonstrate that there can be no such thing as actual infinities or actual infinitesimals. One of his arguments can be reconstructed in the following way. \u00a0Galileo proposes that we take as a premise that there is an actual infinity of natural numbers (the natural numbers are the positive whole numbers from 1 on):<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">{1,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a02,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a03,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a04,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a05,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a06,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a07, \u00a0\u2026.}<\/p>\n<p>He also proposes that we take as a premise that there is an actual infinity of the squares of the natural numbers.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">{1,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a04,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a09,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a016,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a025,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a036,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a049, \u00a0\u2026.}<\/p>\n<p>Now, Galileo reasons, note that these two groups (today we would call them \u201csets\u201d) have the same size. \u00a0We can see this because we can see that there is a one-to-one correspondence between the two groups.<\/p>\n<table class=\"undefined\">\n<tbody>\n<tr>\n<td style=\"text-align: left;\">{1,<\/td>\n<td style=\"text-align: left;\">2,<\/td>\n<td style=\"text-align: left;\">3,<\/td>\n<td style=\"text-align: left;\">4,<\/td>\n<td style=\"text-align: left;\">5,<\/td>\n<td style=\"text-align: left;\">6,<\/td>\n<td style=\"text-align: left;\">7,\u00a0\u2026.}<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: left;\">\u00a0<img loading=\"lazy\" decoding=\"async\" class=\"no-border alignnone wp-image-256 size-full\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/arrow.png\" alt=\"arrow\" width=\"37\" height=\"84\" \/><\/td>\n<td style=\"text-align: left;\">\u00a0<img loading=\"lazy\" decoding=\"async\" class=\"no-border alignnone wp-image-256 size-full\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/arrow.png\" alt=\"arrow\" width=\"37\" height=\"84\" \/><\/td>\n<td style=\"text-align: left;\">\u00a0<img loading=\"lazy\" decoding=\"async\" class=\"no-border alignnone wp-image-256 size-full\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/arrow.png\" alt=\"arrow\" width=\"37\" height=\"84\" \/><\/td>\n<td style=\"text-align: left;\"><img loading=\"lazy\" decoding=\"async\" class=\"no-border alignnone wp-image-256 size-full\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/arrow.png\" alt=\"arrow\" width=\"37\" height=\"84\" \/><\/td>\n<td style=\"text-align: left;\">\u00a0<img loading=\"lazy\" decoding=\"async\" class=\"no-border alignnone wp-image-256 size-full\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/arrow.png\" alt=\"arrow\" width=\"37\" height=\"84\" \/><\/td>\n<td style=\"text-align: left;\">\u00a0<img loading=\"lazy\" decoding=\"async\" class=\"no-border alignnone wp-image-256 size-full\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/arrow.png\" alt=\"arrow\" width=\"37\" height=\"84\" \/><\/td>\n<td style=\"text-align: left;\">\u00a0<img loading=\"lazy\" decoding=\"async\" class=\"no-border alignnone wp-image-256 size-full\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/arrow.png\" alt=\"arrow\" width=\"37\" height=\"84\" \/><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: left;\">\u00a0{1,<\/td>\n<td style=\"text-align: left;\">\u00a04,<\/td>\n<td style=\"text-align: left;\">9,<\/td>\n<td style=\"text-align: left;\">16,<\/td>\n<td style=\"text-align: left;\">25,<\/td>\n<td style=\"text-align: left;\">36,<\/td>\n<td style=\"text-align: left;\">49, &#8230;}<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>If we can associate every natural number with one and only one square number, and if we can associate every square number with one and only one natural number, then these sets must be the same size.<\/p>\n<p>But wait a moment, Galileo says. \u00a0There are obviously very many more natural numbers than there are square numbers. \u00a0That is, every square number is in the list of natural numbers, but many of the natural numbers are not in the list of square numbers. \u00a0The following numbers are all in the list of natural numbers but not in the list of square numbers.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\">{2,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a03,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a05,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a06,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a07,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a08,\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a010, \u00a0\u2026.}<\/p>\n<p>So, Galileo reasons, if there are many numbers in the group of natural numbers that are not in the group of the square numbers, and if there are no numbers in the group of the square numbers that are not in the naturals numbers, then the natural numbers is bigger than the square numbers. \u00a0And if the group of the natural numbers is bigger than the group of the square numbers, then the natural numbers and the square numbers are not the same size.<\/p>\n<p>We have reached two conclusions: \u00a0the set of the natural numbers and the set of the square numbers are the same size; and, the set of the natural numbers and the set of the square numbers are not the same size. \u00a0That\u2019s contradictory.<\/p>\n<p>Galileo argues that the reason we reached a contradiction is because we assumed that there are actual infinities. \u00a0He concludes, therefore, that there are no actual infinities.<\/p>\n<h2>8.2 \u00a0Indirect proofs<\/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>Reductio Ad Absurdism<\/strong> &#8211; a logical argument that disproves a statement by showing that its logical consequences lead to an absurd, contradictory, or false conclusion.<\/li>\n<li><strong>Contradiction<\/strong> &#8211; a statement or set of statements that, when taken together, always result in a false statement.<\/li>\n<li><strong>Subproof<\/strong> &#8211; a proof contained within another, larger proof.<\/li>\n<li><strong>Deduction Theorem<\/strong> &#8211; states that if a formula B can be derived from a set of assumptions \u0393 and an additional assumption A, then the formula A\u2192B (A implies B) can be derived from \u0393 alone.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<p>Our logic is not yet strong enough to prove some valid arguments. \u00a0Consider the following argument as an example.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(P<\/span><span class=\"strong\">\u2192(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><span class=\"strong\">_____<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">\u00acP<\/span><\/strong><\/p>\n<p>This argument looks valid. \u00a0By the first premise we know: \u00a0if <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>were true, then so would <strong><span class=\"strong\">(Q v R)<\/span><\/strong>\u00a0be true. \u00a0But then either <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>or <strong><span class=\"strong\">R<\/span>\u00a0<\/strong>or both would be true. \u00a0And by the second and third premises we know: <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>is false and <strong><span class=\"strong\">R<\/span>\u00a0<\/strong>is false. \u00a0So it cannot be that <strong><span class=\"strong\">(Q v R)<\/span><\/strong>\u00a0is true, and so it cannot be that <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>is true.<\/p>\n<p>We can check the argument using a truth table. \u00a0Our table will be complex because one of our premise is complex.<\/p>\n<table class=\"grid\">\n<tbody>\n<tr class=\"border\">\n<th class=\"border\"><\/th>\n<th class=\"border\"><\/th>\n<th class=\"border-right\"><\/th>\n<th class=\"border\"><\/th>\n<td class=\"border\">premise<\/td>\n<td class=\"border\">\u00a0premise<\/td>\n<td class=\"border\">premise<\/td>\n<td class=\"border\">\u00a0conclusion<\/td>\n<\/tr>\n<tr class=\"border-bottom\">\n<th class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">P<\/span><\/th>\n<th class=\"border\"><span class=\"strong\">Q<\/span><\/th>\n<th class=\"border-right\"><span class=\"strong\">R<\/span><\/th>\n<th class=\"border\" style=\"text-align: center;\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">(QvR)<\/span><\/th>\n<th class=\"border\">(P\u2192(QvR))<\/th>\n<th class=\"border\">\u00acQ<\/th>\n<th class=\"border\">\u00acR<\/th>\n<th class=\"border\">\u00acP<\/th>\n<\/tr>\n<tr>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T <\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\" style=\"text-align: center;\" colspan=\"1\" rowspan=\"1\"><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\">F<\/span><\/td>\n<\/tr>\n<tr>\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-right\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\" style=\"text-align: center;\" colspan=\"1\" rowspan=\"1\"><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\">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\">T<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F <\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\" style=\"text-align: center;\" colspan=\"1\" rowspan=\"1\"><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\">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<\/tr>\n<tr>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\" style=\"text-align: center;\" colspan=\"1\" rowspan=\"1\"><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<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<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\" style=\"text-align: center;\" colspan=\"1\" rowspan=\"1\"><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<tr>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\" style=\"text-align: center;\" 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\">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<\/tr>\n<tr>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\" style=\"text-align: center;\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">\u00a0T \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\"><span class=\"em strong\">T<\/span><\/td>\n<\/tr>\n<tr>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border-right\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\" style=\"text-align: center;\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"shaded\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"shaded\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"shaded\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"shaded\"><span class=\"em strong\">T<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>In any kind of situation in which all the premises are true, the conclusion is true. \u00a0That is: \u00a0the premises are all true only in the last row. For that row, the conclusion is also true. \u00a0So, this is a valid argument.<\/p>\n<p>But take a minute and try to prove this argument. \u00a0We begin with<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"size-medium wp-image-362 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120131-300x80.png\" alt=\"\" width=\"300\" height=\"80\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120131-300x80.png 300w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120131-65x17.png 65w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120131-225x60.png 225w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120131-350x93.png 350w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120131.png 596w\" sizes=\"auto, (max-width: 300px) 100vw, 300px\" \/><\/p>\n<p>And now we are stopped. \u00a0We cannot apply any of our rules. \u00a0Here is a valid argument that we have not made our reasoning system strong enough to prove.<\/p>\n<p>There are several ways to rectify this problem and to make our reasoning system strong enough. \u00a0One of the oldest solutions is to introduce a new proof method, traditionally called \u201creductio ad absurdum\u201d, which means <span class=\"em\">a reduction to absurdity<\/span>. \u00a0This method is also often called an \u201cindirect proof\u201d or \u201cindirect derivation\u201d.<\/p>\n<p>The idea is that we assume the denial of our conclusion, and then show that a contradiction results. \u00a0A <strong>contradiction<\/strong> is shown when we prove some sentence <strong><span class=\"strong\">\u03a8<\/span><\/strong>, and its negation <strong><span class=\"strong\">\u00ac\u03a8<\/span><\/strong>. \u00a0This can be any sentence. \u00a0The point is that, given the principle of bivalence, we must have proven something false. \u00a0For if <strong><span class=\"strong\">\u03a8<\/span>\u00a0<\/strong>is true, then <strong><span class=\"strong\">\u00ac\u03a8<\/span><\/strong>\u00a0is false; and if <strong><span class=\"strong\">\u00ac\u03a8<\/span><\/strong>\u00a0is true, then <strong><span class=\"strong\">\u03a8<\/span>\u00a0<\/strong>is false. \u00a0We don\u2019t need to know which is false (<strong><span class=\"strong\">\u03a8<\/span>\u00a0<\/strong>or <strong><span class=\"strong\">\u00ac\u03a8<\/span><\/strong>); it is enough to know that one of them must be.<\/p>\n<p>Remember that we have built our logical system so that it cannot produce a falsehood from true statements. \u00a0The source of the falsehood that we produce in the indirect derivation must, therefore, be some falsehood that we added to our argument. \u00a0And what we added to our argument is the denial of the conclusion. \u00a0Thus, the conclusion must be true.<\/p>\n<p>The shape of the argument is like this:<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"size-full wp-image-363 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120157.png\" alt=\"\" width=\"199\" height=\"227\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120157.png 199w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120157-65x74.png 65w\" sizes=\"auto, (max-width: 199px) 100vw, 199px\" \/><\/p>\n<p>Traditionally, the assumption for indirect derivation has also been commonly called \u201cthe assumption for reductio\u201d.<\/p>\n<p>As a concrete example, we can prove our perplexing case.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-364 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120224-300x120.png\" alt=\"\" width=\"400\" height=\"160\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120224-300x120.png 300w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120224-768x307.png 768w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120224-65x26.png 65w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120224-225x90.png 225w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120224-350x140.png 350w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120224.png 867w\" sizes=\"auto, (max-width: 400px) 100vw, 400px\" \/><\/p>\n<p>We assumed the denial of our conclusion on line 4. \u00a0The conclusion we believed was correct was <strong><span class=\"strong\">\u00acP<\/span><\/strong>, and the denial of this is <strong><span class=\"strong\">\u00ac\u00acP<\/span><\/strong>. \u00a0In line 7,\u00a0we proved <strong><span class=\"strong\">R<\/span><\/strong>. \u00a0Technically, we are done at that point, but we would like to be kind to anyone trying to understand our proof, so we repeat line 3 so that the sentences <strong><span class=\"strong\">R<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">\u00acR<\/span><\/strong>\u00a0are side by side, and it is very easy to see that something has gone wrong. \u00a0That is, if we have proven both <strong><span class=\"strong\">R<\/span>\u00a0<\/strong>and <strong><span class=\"strong\">\u00acR<\/span><\/strong>, then we have proven something false.<\/p>\n<p>Our reasoning now goes like this. \u00a0What went wrong? \u00a0Line 8 is a correct use of repetition; line 7 comes from a correct use of modus tollendo ponens; line 6 from a correct use of modus ponens; line 5 from a correct use of double negation. \u00a0So,\u00a0we did not make a mistake in our reasoning. \u00a0We used lines 1, 2, and 3, but those are premises that we agreed to assume are correct. \u00a0This leaves line 4. \u00a0That must be the source of my contradiction. \u00a0It must be false. \u00a0If line 4 is false, then <strong><span class=\"strong\">\u00acP<\/span><\/strong>\u00a0is true.<\/p>\n<p>Some people consider indirect proofs less strong than direct proofs. \u00a0There are many, and complex, reasons for this. \u00a0But,\u00a0for our propositional logic, none of these reasons apply. \u00a0This is because it is possible to prove that our propositional logic is consistent. \u00a0This means, it is possible to prove that our propositional logic cannot prove a falsehood unless one first introduces a falsehood into the system. \u00a0(It is generally not possible to prove that more powerful and advanced logical or mathematical systems are consistent, from inside those systems; for example, one cannot prove in arithmetic that arithmetic is consistent.)<\/p>\n<p>Given that we can be certain of the consistency of the propositional logic, we can be certain that in our propositional logic an indirect proof is a good form of reasoning. \u00a0We know that if we prove a falsehood, we must have put a falsehood in; and if we are confident about all the other assumptions (that is, the premises) of our proof except for the assumption for indirect derivation, then we can be confident that this assumption for indirect derivation must be the source of the falsehood.<\/p>\n<p>A note about terminology is required here. \u00a0The word \u201ccontradiction\u201d gets used ambiguously in most logic discussions. \u00a0It can mean a situation like we see above, where two sentences are asserted, and these sentences cannot both be true. \u00a0Or it can mean a single sentence that cannot be true. \u00a0An example of such a sentence is<strong> <span class=\"strong\">(P^\u00acP)<\/span><\/strong>. \u00a0The truth table for this sentence is:<\/p>\n<div class=\"keep\">\n<table class=\"grid\">\n<tbody>\n<tr class=\"border-bottom\">\n<th class=\"border-right\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">P<\/span><\/th>\n<th class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"strong\">\u00acP \u00a0 \u00a0 \u00a0\u00a0<\/span><\/th>\n<th class=\"border\"><span class=\"strong\">\u00a0(P ^ \u00acP)<\/span><\/th>\n<\/tr>\n<tr>\n<td class=\"border-right\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T<\/span><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F \u00a0 \u00a0 \u00a0 \u00a0<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<\/tr>\n<tr>\n<td class=\"border-right\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">F<\/span><\/td>\n<td class=\"border\" colspan=\"1\" rowspan=\"1\"><span class=\"em strong\">T \u00a0 \u00a0 \u00a0 \u00a0<\/span><\/td>\n<td class=\"border\"><span class=\"em strong\">F<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<p>Thus, this kind of sentence can never be true, regardless of the meaning of <span class=\"strong\">P<\/span>.<\/p>\n<p>To avoid ambiguity, in this text, we will always call a single sentence that cannot be true a \u201ccontradictory sentence\u201d. \u00a0Thus,<strong> <span class=\"strong\">(P^\u00acP)<\/span><\/strong>\u00a0is a contradictory sentence. \u00a0Situations where two sentences are asserted that cannot both be true will be called a \u201ccontradiction\u201d.<\/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>Define &#8220;reductio ad absurdum&#8221; in your own words and explain its logical foundation.<\/li>\n<li>Create your own valid argument that would require an indirect proof method to demonstrate its validity.<\/li>\n<li><strong>Critical Thinking Task:\u00a0<\/strong>Provide an image that represents an indirect derivation in a visual format. Explain why this image is appropriate for describing this proof method.<\/li>\n<\/ol>\n<\/div>\n<\/div>\n<h2>8.3 \u00a0Our example, and other examples<\/h2>\n<p>We can reconstruct a version of Galileo\u2019s argument now. \u00a0We will use the following key.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">P<\/span><\/strong>: There are actual infinities (including the natural numbers and the square numbers).<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">Q<\/span><\/strong>: There is a one-to-one correspondence between the natural numbers and the square numbers.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">R<\/span><\/strong>: The size of the set of the natural numbers and the size of the set of the square numbers are the same.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">S<\/span><\/strong>: All the square numbers are natural numbers.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">T<\/span><\/strong>: Some of the natural numbers are not square numbers.<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">U<\/span><\/strong>: There are more natural numbers than square numbers.<\/p>\n<p>With this key, the argument will be translated:<\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(P\u2192Q)<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(Q\u2192R)<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(P\u2192(S^T))<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">((S^T)\u2192U)<\/span><\/strong><\/p>\n<p class=\"marg-left\" style=\"padding-left: 120px;\"><strong><span class=\"strong\">(U\u2192\u00acR)<\/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\">\u00acP<\/span><\/strong><\/p>\n<p>And we can prove this is a valid argument by using indirect derivation:<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-365 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120419-300x164.png\" alt=\"\" width=\"410\" height=\"224\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120419-300x164.png 300w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120419-768x420.png 768w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120419-65x36.png 65w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120419-225x123.png 225w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120419-350x191.png 350w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120419.png 842w\" sizes=\"auto, (max-width: 410px) 100vw, 410px\" \/><\/p>\n<p>On line 6, we assumed <strong><span class=\"strong\">\u00ac\u00acP<\/span><\/strong>\u00a0because Galileo believed that <strong><span class=\"strong\">\u00acP<\/span><\/strong>\u00a0and aimed to prove that <strong><span class=\"strong\">\u00acP<\/span><\/strong>. \u00a0That is, he believed that there are no actual infinities, and so assumed that it was false to believe that it is not the case that there are no actual infinities. \u00a0This falsehood will lead to other falsehoods, exposing itself.<\/p>\n<p>For those who are interested: \u00a0Galileo concluded that there are no actual infinities but there are potential infinities. \u00a0Thus, he reasoned, it is not the case that all the natural numbers exist (in some sense of \u201cexist\u201d), but it is true that you could count natural numbers forever. \u00a0Many philosophers before and after Galileo held this view; it is similar to a view held by Aristotle, who was an important logician and philosopher writing nearly two thousand years before Galileo.<\/p>\n<p>Note that in an argument like this, you could reason that not the assumption for indirect derivation, but rather one of the premises was the source of the contradiction. \u00a0Today, most mathematicians believe this about Galileo\u2019s argument. \u00a0A logician and mathematician named Georg Cantor (1845-1918), the inventor of set theory, argued that infinite sets can have proper subsets of the same size.<\/p>\n<p>That is, Cantor denied premise 4 above: \u00a0even though all the square numbers are natural numbers, and not all natural numbers are square numbers, it is not the case that these two sets are of different size. \u00a0Cantor accepted however premise 2 above, and, therefore, believed that the size of the set of natural numbers and the size of the set of square numbers is the same. \u00a0Today, using Cantor\u2019s reasoning, mathematicians and logicians study infinity, and have developed a large body of knowledge about the nature of infinity. \u00a0If this interests you, see section 17.5.<\/p>\n<p>Let us consider another example to illustrate indirect derivation. \u00a0A very useful set of theorems are today called \u201cDe Morgan\u2019s Theorems\u201d, after the logician Augustus De Morgan (1806\u20131871). \u00a0We cannot state these fully until chapter 9, but we can state their equivalent in English: \u00a0DeMorgan observed that <strong><span class=\"strong\">\u00ac(PvQ) <\/span><\/strong>and <strong><span class=\"strong\">(\u00acP^\u00acQ)<\/span><\/strong>\u00a0are equivalent, and also that <span class=\"strong\"><strong>\u00ac(P^Q)<\/strong> <\/span>and <strong><span class=\"strong\">(\u00acPv\u00acQ)<\/span><\/strong>\u00a0are equivalent. \u00a0Given this, it should be a theorem of our language that <strong><span class=\"strong\">(\u00ac(PvQ)<\/span><span class=\"strong\">\u2192(\u00acP^\u00acQ))<\/span><\/strong>. \u00a0Let\u2019s prove this.<\/p>\n<p>The whole formula is a conditional, so we will use a conditional derivation. \u00a0Our proof must thus begin:<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"size-medium wp-image-366 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120447-300x61.png\" alt=\"\" width=\"300\" height=\"61\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120447-300x61.png 300w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120447-768x156.png 768w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120447-65x13.png 65w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120447-225x46.png 225w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120447-350x71.png 350w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120447.png 877w\" sizes=\"auto, (max-width: 300px) 100vw, 300px\" \/><\/p>\n<p>To complete the conditional derivation, we must prove <strong><span class=\"strong\">(\u00acP^\u00acQ)<\/span><\/strong>. \u00a0This is a conjunction, and our rule for showing conjunctions is adjunction. \u00a0Since using this rule might be our best way to show <strong><span class=\"strong\">(\u00acP^\u00acQ)<\/span><\/strong>, we can aim to show <strong><span class=\"strong\">\u00acP<\/span><\/strong>\u00a0and then show <strong><span class=\"strong\">\u00acQ<\/span><\/strong>, and then perform adjunction. \u00a0But, we obviously have very little to work with\u2014just line 1, which is a negation. \u00a0In such a case, it is typically wise to attempt an indirect proof. \u00a0Start with an indirect proof of <strong><span class=\"strong\">\u00acP<\/span><\/strong>.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-367 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120510-300x98.png\" alt=\"\" width=\"343\" height=\"112\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120510-300x98.png 300w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120510-768x252.png 768w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120510-65x21.png 65w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120510-225x74.png 225w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120510-350x115.png 350w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120510.png 879w\" sizes=\"auto, (max-width: 343px) 100vw, 343px\" \/><\/p>\n<p>We now need to find a contradiction\u2014any contradiction. \u00a0But there is an obvious one already. \u00a0Line 1 says that neither <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>nor <strong><span class=\"strong\">Q<\/span>\u00a0<\/strong>is true. \u00a0But line 3 says that <strong><span class=\"strong\">P<\/span>\u00a0<\/strong>is true. \u00a0We must make this contradiction explicit by finding\u00a0a formula and its denial. \u00a0We can do this using addition.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-368 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120535-300x110.png\" alt=\"\" width=\"363\" height=\"133\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120535-300x110.png 300w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120535-768x283.png 768w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120535-65x24.png 65w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120535-225x83.png 225w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120535-350x129.png 350w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120535.png 869w\" sizes=\"auto, (max-width: 363px) 100vw, 363px\" \/><\/p>\n<p>To complete the proof, we will use this strategy again.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-369 aligncenter\" src=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120601-300x175.png\" alt=\"\" width=\"425\" height=\"248\" srcset=\"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120601-300x175.png 300w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120601-768x448.png 768w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120601-65x38.png 65w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120601-225x131.png 225w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120601-350x204.png 350w, https:\/\/pressbooks.ccconline.org\/introtologic\/wp-content\/uploads\/sites\/247\/2016\/12\/Screenshot-2025-10-13-120601.png 873w\" sizes=\"auto, (max-width: 425px) 100vw, 425px\" \/><\/p>\n<p>We will prove De Morgan\u2019s theorems as problems for chapter 9.<\/p>\n<p>Here is a general rule of thumb for doing proofs: \u00a0When proving a conditional, always do conditional derivation; otherwise, try direct derivation; if that fails, then, try indirect derivation.<\/p>\n<h2>8.4 \u00a0Problems<\/h2>\n<ol class=\"lst-kix_list_22-0 start\" start=\"1\">\n<li>Complete the following proofs. \u00a0Each will require an indirect derivation. \u00a0The last two are challenging.\n<ol class=\"lst-kix_list_22-0 start\" start=\"1\">\n<li>Premises: \u00a0<strong><span class=\"strong\">(P \u2192 R)<\/span>, <span class=\"strong\">(Q \u2192 R)<\/span>, <span class=\"strong\">(PvQ)<\/span><\/strong>. Conclusion: \u00a0<strong><span class=\"strong\">R<\/span><\/strong>.<\/li>\n<li>Premises: \u00a0<strong><span class=\"strong\">((PvQ) \u2192 R)<\/span>, <span class=\"strong\">\u00acR<\/span><\/strong>. \u00a0Conclusion: <strong><span class=\"strong\">\u00acP<\/span><\/strong>.<\/li>\n<li>Premise:\u00a0<strong><span class=\"strong\">(\u00acP^\u00acQ)<\/span><\/strong>. \u00a0Conclusion: <strong><span class=\"strong\">\u00ac(PvQ)<\/span><\/strong>.<\/li>\n<li>Premise:\u00a0<strong><span class=\"strong\">\u00ac(P^Q)<\/span><\/strong>. \u00a0Conclusion: <strong><span class=\"strong\">(\u00acPv\u00acQ)<\/span><\/strong>.<\/li>\n<li>Premise:\u00a0<strong><span class=\"strong\">(\u00acPv\u00acQ)<\/span><\/strong>. \u00a0Conclusion: <strong><span class=\"strong\">\u00ac(P^Q)<\/span><\/strong>.<\/li>\n<li>Premise:\u00a0<strong><span class=\"strong\">(P \u2192 R)<\/span>, <span class=\"strong\">(Q \u2192 S)<\/span>, <span class=\"strong\">\u00ac(R ^ S)<\/span><\/strong>. Conclusion: \u00a0<strong><span class=\"strong\">\u00ac(P ^ Q)<\/span><\/strong>.<\/li>\n<li>Premise: \u00a0<strong><span class=\"strong\">\u00acR<\/span>, (<span class=\"strong\">(P \u2192 R) v (Q \u2192 R))<\/span><\/strong>. \u00a0Conclusion:<span class=\"strong\">\u00a0<strong>(\u00acP v \u00acQ)<\/strong><\/span>.<\/li>\n<li>Premise: \u00a0<strong><span class=\"strong\">\u00ac(R v S)<\/span>, <span class=\"strong\">(P<\/span><span class=\"strong\">\u2192<\/span><span class=\"strong\">R)<\/span>, <span class=\"strong\">(Q<\/span><span class=\"strong\">\u2192<\/span><span class=\"strong\">S)<\/span><\/strong>. \u00a0Conclusion:<span class=\"strong\">\u00a0<strong>\u00ac(P v Q)<\/strong><\/span>.<\/li>\n<\/ol>\n<\/li>\n<li>Prove the following are theorems.\n<ol class=\"lst-kix_list_22-0 start\" start=\"1\">\n<li><strong><span class=\"strong\">\u00ac(P^\u00acP)<\/span>.<\/strong><\/li>\n<li><strong>(<span class=\"strong\">\u00acP \u2192 \u00ac(P^Q))<\/span>.<\/strong><\/li>\n<li><strong><span class=\"strong\">((P^\u00acQ) \u2192 \u00ac(P \u2192 Q))<\/span>.<\/strong><\/li>\n<li><strong><span class=\"strong\">((P \u2192 Q) \u2192 \u00ac(P ^ \u00acQ))<\/span>.<\/strong><\/li>\n<li><strong><span class=\"strong\">(\u00ac(P v Q) \u2192 \u00acP)<\/span>.<\/strong><\/li>\n<li><strong><span class=\"strong\">((\u00acP ^ \u00acQ) \u2192 \u00ac(P v Q))<\/span>.<\/strong><\/li>\n<li><strong><span class=\"strong\">((\u00acP v \u00acQ) \u2192 \u00ac(P ^ Q))<\/span>.<\/strong><\/li>\n<li><strong><span class=\"strong\">(\u00ac(P ^ Q) \u2192 (\u00acP v \u00acQ))<\/span>.<\/strong><\/li>\n<li><strong><span class=\"strong\">\u00ac((P \u2192 \u00acP)^(\u00acP \u2192 P))<\/span>.<\/strong><\/li>\n<li><strong><span class=\"strong\">(P v \u00acP)<\/span>.<\/strong><\/li>\n<\/ol>\n<\/li>\n<li>In normal colloquial English, write your own valid argument with at least two premises. 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 using an indirect derivation.<\/li>\n<li>Translate the following argument into English, and then prove it is valid using an indirect proof.<\/li>\n<\/ol>\n<p class=\"marg-left\">Either Beneke or Meinong conned Dodgson with marked cards. But either Beneke didn&#8217;t do it or the marked cards are in the car. But also, if Meinong did it, the marked cards are in the car. So, regardless of whether Beneke or Meinong conned Dodgson, the cards are in the car.<\/p>\n<div>\n<hr \/>\n<p><a id=\"ftnt10\" href=\"#ftnt_ref10\">[10]<\/a>\u00a0This translation of the title of Galileo\u2019s book has become the most common, although a more literal one would have been <span class=\"em\">Mathematical Discourses and Demonstrations. \u00a0<\/span>Translations of the book include Drake (1974).<\/p>\n<\/div>\n","protected":false},"author":158,"menu_order":8,"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-47","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\/47","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":14,"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/pressbooks\/v2\/chapters\/47\/revisions"}],"predecessor-version":[{"id":370,"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/pressbooks\/v2\/chapters\/47\/revisions\/370"}],"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\/47\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/wp\/v2\/media?parent=47"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/pressbooks\/v2\/chapter-type?post=47"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/wp\/v2\/contributor?post=47"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/pressbooks.ccconline.org\/introtologic\/wp-json\/wp\/v2\/license?post=47"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}