{"id":3307,"date":"2010-02-13T02:51:19","date_gmt":"2010-02-13T10:51:19","guid":{"rendered":"http:\/\/www.oeconomist.com\/blogs\/daniel\/?page_id=3307"},"modified":"2010-09-01T02:33:00","modified_gmt":"2010-09-01T10:33:00","slug":"3307-2","status":"publish","type":"page","link":"https:\/\/www.oeconomist.com\/blogs\/daniel\/?page_id=3307","title":{"rendered":"Thoughts on Boolean <q>Laws of Thought<\/q>"},"content":{"rendered":"<p>I first encountered <q>symbolic<\/q> logic when I was a teenager.  Unfortunately, I had great trouble following the ostensible explanations that I encountered, and I didn't recognize that my perplexity was not because the underlying subject were intrinsically difficult for me, but because the explanations that I'd found simply weren't very well written.  Symbolic logic remained mysterious, and hence became intimidating.  And it wasn't clear what would be its peculiar virtue over logic expressed in natural language, with which I was quite able, so I didn't focus on it.  I was perhaps 16 years old before I picked-up any real understanding of any of it, and it wasn't until years after that before I became comfortable not simply with Boolean <em>expression<\/em> but with processing it as an <em>algebra<\/em>.<\/p> <p>But, by the time that I was pursuing a master's degree, it was often how I generated my work in economics or in mathematics, and at the <em>core<\/em> of how I presented the vast majority of that work, unless I were directed otherwise.  My notion of an ideal paper was and remains one with relatively little natural language.<\/p> <p>Partly I have that notion because I like the idea that people who know mathematics shouldn't have to learn or apply much more than minimal English to read a technical paper.  I have plenty of praise for English, but there are an awful lot of clever people who don't much know it.<\/p> <p>Partly I have that notion because it is easier to <em>demonstrate<\/em> logical <em>rigor<\/em> by using symbolic logic.  I want to emphasize that word <q>demonstrate<\/q> because it is possible to be <em>just<\/em> as logically rigorous while expressing oneself in natural language.  Natural language is just a <em>notation<\/em>; thinking that it is intrinsically less <em>rigorous<\/em> than one of the <q>symbolic<\/q> notations is like thinking that &#321;ukasiewicz Polish notation is less rigorous than infixing notation or <span style=\"font-style: italic ;\">vice versa<\/span>.  I'll admit that some people may be less inclined to various sorts of errors using one notation as opposed to another, but <em>which<\/em> notation will vary amongst these people.  However, other people don't necessarily <em>see<\/em> that rigor when natural language is used, and those who are inclined to be <em>obstinate<\/em> are more likely to exploit the lack of <em>simplicity<\/em> in natural language.<\/p> <p>But, while it may be more practicable to lay doubts to rest when an argument is presented in <q>symbolic<\/q> form, that doesn't mean that it will be <em>easy<\/em> for readers to follow whatever argument is being presented.  Conventional academic economists use a considerable amount of fairly high-level mathematics, but they tend to use natural language for the purely <em>logical<\/em> work.<span style=\"vertical-align: top ; font-size: smaller ;\">[1]<\/span>  And it seems that most of them are distinctly uncomfortable with extensive use of symbolic logic.  It's fairly rare to find it heavily used in a paper.  I've had baffled professors ask me to explain elementary logical transformations.  And, at least once, a fellow graduate student didn't come to me for help, for fear that I'd immediately start writing symbolic logic on the chalk-board. (And perhaps I would have done so, if not asked otherwise.)<\/p> <p>The stuff truly <em>isn't that hard<\/em>, at least when it comes to the sort of application that I make of it.  There is a tool-kit of a relatively few <em>simple<\/em> rules, some of them <em>beautiful<\/em>, which are used for the lion's share of the work.  And, mostly, I want to use this entry to high-light some of those tools, and some heuristics for their use.<\/p> <p>First, though, I want to mention a rule that I <em>don't<\/em> use. <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/identity.png\" width=\"41\" height=\"11\" alt=\"A = A\" style=\"display: block ; border: 0 ; margin: 1em ; margin-left: auto ; margin-right: auto ;\" \/> This proposition, normally expressed in natural language as <q>A is A<\/q> and called <q>the Law of Identity<\/q>, is declared by various philosophers to be one of the three <em>Principles<\/em> of logic.  But I have no g_dd_mn'd idea what to <em>do<\/em> with it.  It's not that I would ever want to <em>violate<\/em> it; it's just that I literally don't see anything <em>use<\/em>ful to it.  Ayn Rand and many of those for whom she is preceptrix treat it as an essential <em>insight<\/em>, but I think that it's just a <span style=\"font-style: italic ;\">dummy proposition<\/span>, telling me that any <span style=\"font-style: italic ;\">thing<\/span> can stand where that <span style=\"font-style: italic ;\">thing<\/span> can stand.<span style=\"vertical-align: top ; font-size: smaller ;\">[2]<\/span><\/p> <a name=\"cut_point\"><\/a> <p>The remaining two Principles of logic are rather more appealing, but I seldom make use of them that is both direct and explicit.<\/p>  <p>There's the Law of Non-Contradiction, <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/noncontr.png\" width=\"70\" height=\"16\" alt=\"~(P & ~P) for all P\" style=\"display: block ; border: 0 ; margin: 1em ; margin-left: auto ; margin-right: auto ;\" \/> Now, I use <span style=\"font-style: italic ;\">proof by contradiction<\/span> fairly often, but I don't <em>explicitly<\/em> haul-out the Law of Non-Contradiction when I do so. (Also, were all else equal, I'd avoid <span style=\"font-style: italic ;\">proof by contradiction<\/span>, because I've often seen people flummoxed by it.  But all else is rarely equal, and I don't generally delay work to find some more pleasing proof.)<\/p> <p>Then there's the Law of the Excluded Middle, <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/exclmidl.png\" width=\"78\" height=\"18\" alt=\"(P v ~P) for all P\" style=\"display: block ; border: 0 ; margin: 1em ; margin-left: auto ; margin-right: auto ;\" \/> which I find myself using only even less directly than that of Non-Contradiction.<\/p> <p>The tools that I use heavily and explicitly in symbolic logic are those that help me to find underlying parallels or symmetries that will allow me to reduce complex expressions to simpler expressions.  Finding those parallels or symmetries is a matter of seeing how to turn conjunctions into disjunctions or <span style=\"font-style: italic ;\">vice versa<\/span>, disjunctions into implications or <span style=\"font-style: italic ;\">vice versa<\/span>, negations into affirmations or <span style=\"font-style: italic ;\">vice versa<\/span>, so that expressions may be consolidated or analyzed and reconsolidated.<\/p> <p>Of course a double negative is a positive, but people need to learn also to <em>turn that around<\/em>, when they <em>need a negative<\/em>, by converting positives into double negatives. <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/dubl_neg.png\" width=\"49\" height=\"14\" alt=\"P = ~~P\" style=\"display: block ; border: 0 ; margin: 1em ; margin-left: auto ; margin-right: auto ;\" \/><\/p> <p>Redundant conjunctions or disjunctions can be simplified, but often simple propositions should be made redundantly <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/conj_exp.png\" width=\"146\" height=\"18\" alt=\"P = (P & P & ... & P)\" style=\"display: block ; border: 0 ; margin-top: 1em ; margin-bottom: .5em ; margin-left: auto ; margin-right: auto ;\" \/> <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/disj_exp.png\" width=\"146\" height=\"18\" alt=\"P = (P v P v ... v P)\" style=\"display: block ; border: 0 ; margin-top: .5em ; margin-bottom: 1em ; margin-left: auto ; margin-right: auto ;\" \/> to exhibit parallels in the structure containing them.<\/p> <p>Implications can be converted into disjunctions with the protasis negated; <em>disjunctions can be turned into implications<\/em> with a negated term turned into a protasis. <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/disj_imp.png\" width=\"143\" height=\"20\" alt=\"(P1 v P2) = (~P1 implies P2)\" style=\"display: block ; border: 0 ; margin: 1em ; margin-left: auto ; margin-right: auto ;\" \/><\/p> <p>Conjunction and disjunction each distribute over the other. <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/conjdist.png\" width=\"270\" height=\"24\" alt=\"[P1 & (P2 v P3)] iff [(P1 & P2) v (P1 & P3)]\" style=\"display: block ; border: 0 ; margin-top: 1em ; margin-bottom: .5em ; margin-left: auto ; margin-right: auto ;\" \/><img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/disjdist.png\" width=\"269\" height=\"24\" alt=\"[P1 v (P2 & P3)] iff [(P1 v P2) & (P1 v P3)]\" style=\"display: block ; border: 0 ; margin-top: .5em ; margin-bottom: 1em ; margin-left: auto ; margin-right: auto ;\" \/><\/p> <p>DeMorgan's Laws of Logic allow one to focus or spread negations, finding conjunctions where there were disjunctions and <span style=\"font-style: italic ;\">vice versa<\/span>. <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/demorg_1.png\" width=\"268\" height=\"22\" alt=\"~(P1 v P2) iff (~P1 & ~P2)\" style=\"display: block ; border: 0 ; margin-top: 1em ; margin-bottom: .5em ; margin-left: auto ; margin-right: auto ;\" \/><img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/demorg_2.png\" width=\"269\" height=\"22\" alt=\"~(P1 & P2) iff (~P1 v ~P2)\" style=\"display: block ; border: 0 ; margin-top: .5em ; margin-bottom: 1em ; margin-left: auto ; margin-right: auto ;\" \/><\/p> <p>Universal quantifiers can be conceptualized as conjunctions or (given certain philosophical commitments) as a generalization there&ouml;f. <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/univconj.png\" width=\"319\" height=\"23\" alt=\"[(Pi) for all Pi in {P1,P2,...,Pm}] = (P1 & P2 & ... & Pm)\" style=\"display: block ; border: 0 ; margin-top: 1em ; margin-bottom: .5em ; margin-left: auto ; margin-right: auto ;\" \/> <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/univcon2.png\" width=\"182\" height=\"40\" alt=\"[forget it]\" style=\"display: block ; border: 0 ; margin-top: .5em ; margin-bottom: 1em ; margin-left: auto ; margin-right: auto ;\" \/><\/p> <p>Existential quantifiers can be conceptualized as disjunctions or (given certain philosophical commitments) as a generalization there&ouml;f. <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/exisdisj.png\" width=\"315\" height=\"24\" alt=\"[(Pi) for some Pi in {P1,P2,...,Pm}] = (P1 v P2 v ... v Pm)\" style=\"display: block ; border: 0 ; margin-top: 1em ; margin-bottom: .5em ; margin-left: auto ; margin-right: auto ;\" \/> <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/exisdis2.png\" width=\"180\" height=\"40\" alt=\"[forget it]\" style=\"display: block ; border: 0 ; margin-top: .5em ; margin-bottom: 1em ; margin-left: auto ; margin-right: auto ;\" \/><\/p> <p>Above, I've written the inclusions for these quantifiers in the way that mathematicians and economists usually write them, but it's important to remember that an inclusion for a universal quantifier corresponds to an implication, <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/univincl.png\" width=\"253\" height=\"26\" alt=\"[(Pi) for all Pi in bold_P] = {[P1 if (P1 in bold_P] for all P1}\" style=\"display: block ; border: 0 ; margin: 1em ; margin-left: auto ; margin-right: auto ;\" \/> and that for an existential quantifier corresponds to an conjunction, <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/exisincl.png\" width=\"241\" height=\"26\" alt=\"[(Pi) for some Pi in bold_P] = {[P1 & (P1 in bold_P] for some P1}\" style=\"display: block ; border: 0 ; margin: 1em ; margin-left: auto ; margin-right: auto ;\" \/> (In fact, I have come to prefer to write my inclusions in terms of implications and conjunctions.)<\/p> <p>De Morgan's Laws apply to the quantifiers thus: <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/demorg_3.png\" width=\"365\" height=\"42\" alt=\"~[(Pi) for some Pi in bold_P] = [(~Pi) for all Pi in bold_P]\" style=\"display: block ; border: 0 ; margin-top: 1em ; margin-bottom: .5em ; margin-left: auto ; margin-right: auto ;\" \/> <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/demorg_4.png\" width=\"365\" height=\"41\" alt=\"~[(Pi) for all Pi in bold_P] = [(~Pi) for some Pi in bold_P]\" style=\"display: block ; border: 0 ; margin-top: .5em ; margin-bottom: 1em ; margin-left: auto ; margin-right: auto ;\" \/><\/p> <p>About the only other rules that I <em>consciously<\/em> use are the commutative properties of conjunction and of disjunction, <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/conjcomm.png\" width=\"141\" height=\"21\" alt=\"(P1 & P2) = (P2 & P1)\" style=\"display: block ; border: 0 ; margin-top: 1em ; margin-bottom: .5em ; margin-left: auto ; margin-right: auto ;\" \/> <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/disjcomm.png\" width=\"141\" height=\"20\" alt=\"(P1 v P2) = (P2 v P1)\" style=\"display: block ; border: 0 ; margin-top: .5em ; margin-bottom: 1em ; margin-left: auto ; margin-right: auto ;\" \/><\/p> <hr width=\"50%\" align=\"left\" \/> <p><span style=\"vertical-align: top ; font-size: smaller ;\">[1]<\/span> There's an <em>idiotic<\/em> notion amongst a great many mainstream economists that the Austrian School tradition is somehow <em>less rigorous<\/em> simply because some of its most significant members eschew overt mathematics in favor of logical deduction expressed in natural language.  But most of the mainstream is likewise not using <q>symbolic<\/q> <em>logic<\/em>; neither is <em>necessarily<\/em> being less rigorous than otherwise.  The <em>meaning<\/em> of variables with names such as <q><var>q<sub>t<\/sub><\/var><\/q> can be every bit as <em>muddled<\/em> as those called something such as <q>the quantity exchanged at this time<\/q>.  There are <em>good<\/em> reasons to object to the rather <em>wholesale<\/em> rejection of overt mathematics by many Austrian School economists, but <em>rigor<\/em> is not amongst the <em>good<\/em> reasons.<\/p> <p><a name=\"cut_point_2\"><span style=\"vertical-align: top ; font-size: smaller ;\">[2]<\/span><\/a> (2010:09\/01) I note that some authors use <q>Law of Identity<\/q> to refer not to a principle that <var>A<\/var> can stand wherever <var>A<\/var> can stand for all <var>A<\/var>, but to a rule <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/ident_b.png\" width=\"91\" height=\"20\" alt=\"(P if only and only if P) for all P\" style=\"display: block ; border: 0 ; margin-top: 1em ; margin-bottom: 1em ; margin-left: auto ; margin-right: auto ;\" \/> However, this is no more than a compressed expression of <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/ident_c.png\" width=\"190\" height=\"23\" alt=\"[(P only if P) & (P if only P)] for all P\" style=\"display: block ; border: 0 ; margin-top: 1em ; margin-bottom: 1em ; margin-left: auto ; margin-right: auto ;\" \/> which is an alternate way of expressing <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/ident_d.png\" width=\"190\" height=\"23\" alt=\"[(P only if P) & (P only if P)] for all P\" style=\"display: block ; border: 0 ; margin-top: 1em ; margin-bottom: 1em ; margin-left: auto ; margin-right: auto ;\" \/> which is a redundant expression of <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/ident_e.png\" width=\"93\" height=\"20\" alt=\"(P only if P) for all P\" style=\"display: block ; border: 0 ; margin-top: 1em ; margin-bottom: 1em ; margin-left: auto ; margin-right: auto ;\" \/> which is just different expression of <img loading=\"lazy\" decoding=\"async\" src=\"wp-content\/uploads\/2010\/02\/ident_f.png\" width=\"82\" height=\"18\" alt=\"(P v ~P) for all P\" style=\"display: block ; border: 0 ; margin-top: 1em ; margin-bottom: 1em ; margin-left: auto ; margin-right: auto ;\" \/> which is just the Law of the Excluded Middle, rather than some further principle.<\/p> <p style=\"text-align: right ;\"><a href=\"?p=3299#respond\">Comments<\/a><\/p>","protected":false},"excerpt":{"rendered":"I first encountered symbolic logic when I was a teenager. Unfortunately, I had great trouble following the ostensible explanations that I encountered, and I didn't recognize that my perplexity was not because the underlying subject were intrinsically difficult for me, but because the explanations that I'd found simply weren't very well written. Symbolic logic remained [&hellip;]","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"open","ping_status":"open","template":"","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"class_list":["post-3307","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.oeconomist.com\/blogs\/daniel\/index.php?rest_route=\/wp\/v2\/pages\/3307","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.oeconomist.com\/blogs\/daniel\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.oeconomist.com\/blogs\/daniel\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.oeconomist.com\/blogs\/daniel\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.oeconomist.com\/blogs\/daniel\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=3307"}],"version-history":[{"count":0,"href":"https:\/\/www.oeconomist.com\/blogs\/daniel\/index.php?rest_route=\/wp\/v2\/pages\/3307\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.oeconomist.com\/blogs\/daniel\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=3307"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}