{"id":265952,"date":"2026-07-17T18:07:35","date_gmt":"2026-07-17T15:07:35","guid":{"rendered":"https:\/\/1kitap1.com\/en\/logic-and-philosophy-a-modern-introduction-alan-hausman\/"},"modified":"2026-07-17T18:07:35","modified_gmt":"2026-07-17T15:07:35","slug":"logic-and-philosophy-a-modern-introduction-alan-hausman","status":"publish","type":"post","link":"https:\/\/1kitap1.com\/en\/logic-and-philosophy-a-modern-introduction-alan-hausman\/","title":{"rendered":"Logic And Philosophy A Modern Introduction &#8211; Alan Hausman"},"content":{"rendered":"<figure style=\"text-align:center;margin:0 auto 1.5em;\"><img decoding=\"async\" src=\"https:\/\/1kitap1.com\/en\/wp-content\/uploads\/2026\/07\/2b3405b211013ef1.jpg\" alt=\" - Unknown book cover\" style=\"max-width:300px;width:100%;height:auto;box-shadow:0 4px 12px rgba(0,0,0,.25);border-radius:4px;\"\/><\/figure>\n<p>Then the sentence \u201cAll who study will pass the test\u201d is false (since some who study do not pass), whereas the professor\u2019s sen- tence, \u201cOnly those who study will pass the test\u201d turns out to be true. Hence, the symbol- ization (x)(Sx \u0001 Px) cannot be the correct symbolization of the professor\u2019s statement. Another way to look at the problem is as follows. To say that only those who study will pass is to say that anyone who does not study will not pass.<\/p>\n<p>Because the sentence \u201cAll who do not study will not pass the test\u201d is correctly symbolized as (x)(\u0002 Sx \u0001 \u0002 Px), the equivalent sentence (1) \u201cOnly those who study will pass the test\u201d also is correctly sym- bolized in this way. And since (x)(\u0002 Sx \u0001 \u0002 Px) is equivalent to (x)(Px \u0001 Sx), as will be proved in later chapters, it follows that (1) is correctly symbolized as (x)(Px \u0001 Sx).<\/p>\n<p>Sentences containing the phrase \u201cnone but\u201d are handled in a similar fashion. Thus, the sentences \u201cOnly the good die young\u201d and \u201cNone but the good die young\u201d are equivalent and can each be symbolized as (x)(Yx \u0001 Gx). The phrase \u201cnone but\u201d in a sentence of this kind means roughly the same thing as the phrase \u201cnone except.\u201d For instance, the sentence \u201cNone but the ignorant are happy\u201d means the same thing as the sentence \u201cNone, except the ignorant, are happy.\u201d<\/p>\n<p>Therefore, both of these sentences are symbolized as (x)(Hx \u0001 Ix). English usage allows us to use the word \u201cunless\u201d to produce sentences that are equiv- alent to the ones we\u2019ve just been discussing. For instance, instead of saying \u201cOnly those who study will pass\u201d or \u201cNone but those who study will pass,\u201d we can say, \u201cNo one will pass unless they study.\u201d<\/p>\n<p>(We use \u201cthey\u201d here to avoid the masculine pronoun \u201che.\u201d Some object to this usage as ungrammatical. An alternative is \u201cNo one will pass unless he or she studies.\u201d) \u201cWithout\u201d sometimes performs a similar function in English, as in \u201cNo one will pass without studying.\u201d All these sentences say roughly the same thing, and hence for our purposes can be symbolized in the same way\u2014namely, (x)(Px \u0001 Sx).<\/p>\n<p>Remember that \u201cunless\u201d also often functions as a truth-functional connective, as explained in Chapter Two. So a sentence such as \u201cNo one will get dessert unless everyone quiets down\u201d should be symbolized as \u0002 (x)(Px \u0001 Qx) \u0001 \u0002 (\u2203x)(Px \u22c5Dx). The word \u201cif\u201d has a similar dual usage.<\/p>\n<p>It can function as a truth-functional connective as in \u201cIf everyone in the class studies, no one in the class will fail\u201d symbolized as (x)(Cx \u0001 Sx) \u0001 \u0002 (\u2203x)(Cx \u22c5Fx)\u2014and can also be used to make generalizations, as in \u201cIf H2O freezes, it expands\u201d\u2014symbolized as (x)[(Hx \u22c5Fx) \u0001 Ex)]. Examples 1. Only celebrities can be elected president.<\/p>\n<p>(x)(Ex \u0001 Cx) or \u0002 (\u2203x)(Ex \u22c5\u0002 Cx) 2.<\/p>\n<blockquote>\n<p>(u)(. . . u . . .) :: ~ (\u2203u) ~ (. . . u . . .) (\u2203u)(. . . u . . .) :: ~ (u) ~ (. . . u . . .) (u) ~ (. . . u . . .) :: ~ (\u2203u)(. . . u . . .) (\u2203u) ~ (. . . u . . .) :: ~ (u)(. .<\/p>\n<p>. u . . .) Rule ID: (. . . u . . .) (. . . u . . .) u = w \/\u2234(. . . w . . .) w = u \/\u2234(. . . w . . .) Rule IR: \/\u2234(x)(x = x) Provided: 1. (. . . w . . .) results from replacing each occur- rence of u free in (. . . u . . .) with a w that is either a constant or a variable free in (.<\/p>\n<p>. . w . . .) (making no other changes). Provided: 1. w is not a constant. 2. w does not occur free previously in the proof. 3. (. . . w . . .) results from replacing each occur- rence of u free in (. . . u . . .) with a w that is free in (.<\/p>\n<p>. . w . . .) (making no other changes). Provided: 1. u is not a constant. 2. u does not occur free previously in a line obtained by EI. 3. u does not occur free previously in an assumed premise that has not yet been discharged. 4. (. . . w .<\/p>\n<p>. .) results from replacing each occur- rence of u free in (. . . u . . .) with a w that is free in (. . . w . . .) (making no other changes) and there are no additional free occurrences of w already contained in (. . . w . . .). Provided: 1. (. . . w . . .) results from replacing at least one occurrence of u, where u is a constant or a vari- able free in (.<\/p>\n<p>. . u . . .) with a w that is free in (. . . w . . .) (making no other changes) and there are no additional free occurrences of w already contained in (. . . w . . .).<\/p>\n<\/blockquote>\n<p><em>This is a short excerpt from the opening of &ldquo;&rdquo; by Unknown, quoted for review and introduction purposes. All rights belong to the copyright holders.<\/em><\/p>\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_85 counter-hierarchy ez-toc-counter ez-toc-grey ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<p class=\"ez-toc-title\" style=\"cursor:inherit\">Table of Contents<\/p>\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"Toggle Table of Content\"><span class=\"ez-toc-js-icon-con\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #999;color:#999\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #999;color:#999\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/1kitap1.com\/en\/logic-and-philosophy-a-modern-introduction-alan-hausman\/#Book_Information\" >Book Information<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/1kitap1.com\/en\/logic-and-philosophy-a-modern-introduction-alan-hausman\/#Reading_Word_Statistics\" >Reading &amp; Word Statistics<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/1kitap1.com\/en\/logic-and-philosophy-a-modern-introduction-alan-hausman\/#Most_Frequent_Words\" >Most Frequent Words<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/1kitap1.com\/en\/logic-and-philosophy-a-modern-introduction-alan-hausman\/#PDF_Download\" >PDF Download<\/a><\/li><\/ul><\/nav><\/div>\n<h2><span class=\"ez-toc-section\" id=\"Book_Information\"><\/span>Book Information<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<ul>\n<li><strong>Unique ID:<\/strong> 2b3405b211013ef1<\/li>\n<li><strong>File Extension:<\/strong> .pdf<\/li>\n<li><strong>File Size:<\/strong> 2,827,344 bytes (2.696 MB)<\/li>\n<li><strong>Title:<\/strong> &#8211;<\/li>\n<li><strong>Author:<\/strong> Unknown<\/li>\n<li><strong>ISBN:<\/strong> 9780495601586, 0495601586<\/li>\n<li><strong>Pages:<\/strong> 454<\/li>\n<li><strong>Language:<\/strong> English (en)<\/li>\n<\/ul>\n<h2><span class=\"ez-toc-section\" id=\"Reading_Word_Statistics\"><\/span>Reading &amp; Word Statistics<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<ul>\n<li><strong>Estimated Reading Time:<\/strong> 906.04 minutes<\/li>\n<li><strong>Total Words:<\/strong> 181,209<\/li>\n<li><strong>Total Characters:<\/strong> 945,862<\/li>\n<li><strong>Average Words per Page:<\/strong> 399.14<\/li>\n<li><strong>Average Characters per Page:<\/strong> 2083.4<\/li>\n<\/ul>\n<h2><span class=\"ez-toc-section\" id=\"Most_Frequent_Words\"><\/span>Most Frequent Words<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>logic (1039), sentence (855), true (830), argument (766), one (720), line (585), valid (567), false (527), form (523), conclusion (508), predicate (506), truth (500), premises (465), sentences (442), use (388), rules (381), invalid (371), two (352), proof (335), exercise (316), example (313), sentential (294), quantifier (265), forms (261), following (260), see (253), premise (248), using (244), proofs (238), first (229), free (224), table (221), arguments (213), rule (212), statement (211), also (210), case (208), variables (196), logical (193), simp (188), now (187), say (186), art (185), instance (185), conditional (184), variable (183), thus (180), way (179), every (178), negation (176), propositions (175), used (169), given (168), proposition (166), cannot (160), property (160), either (158), chapter (158), get (150), substitution (146), validity (143), tree (143), consider (141), statements (139), make (135), trees (134), lines (134), domain (131), examples (130), least (123), second (122), humans (122), even (120), add (119), method (119), students (119), properties (118), between (118), syllogism (117), conj (116), possible (116), well (115), follows (115), tables (112), truth-value (112), class (111), truth-values (110), show (110), symbolize (110), equivalent (110), existential (109), another (109), individual (109), fxy (109), universal (108), terms (106), different (105), since (105), many (104), four (101).<\/p>\n<h2><span class=\"ez-toc-section\" id=\"PDF_Download\"><\/span>PDF Download<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p style=\"text-align:center;\"><a href=\"https:\/\/1kitap1.com\/en\/wp-content\/uploads\/2026\/07\/logic-and-philosophy-a-modern-introduction-alan-hausman.pdf\" download rel=\"nofollow\" style=\"display:inline-block;background:#2271b1;color:#ffffff;padding:14px 36px;border-radius:6px;text-decoration:none;font-weight:bold;font-size:1.05em;\">&#11015;&#65039; PDF Download<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Then the sentence \u201cAll who study will pass the test\u201d is false (since some who study do not pass), whereas the professor\u2019s sen- tence, \u201cOnly those who study will pass the test\u201d turns out to be true. Hence, the symbol- ization (x)(Sx \u0001 Px) cannot be the correct symbolization of the professor\u2019s statement. Another way [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":265950,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[8],"tags":[],"class_list":["post-265952","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-english"],"blocksy_meta":[],"_links":{"self":[{"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/posts\/265952","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/comments?post=265952"}],"version-history":[{"count":0,"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/posts\/265952\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/media\/265950"}],"wp:attachment":[{"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/media?parent=265952"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/categories?post=265952"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/tags?post=265952"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}