{"id":3102,"date":"2025-06-07T10:09:34","date_gmt":"2025-06-07T10:09:34","guid":{"rendered":"https:\/\/diznr.com\/?p=3102"},"modified":"2025-06-07T10:09:34","modified_gmt":"2025-06-07T10:09:34","slug":"day-04-part-04-discrete-mathematics-for-computer-science-negation-operator-proposition-of","status":"publish","type":"post","link":"https:\/\/www.reilsolar.com\/pdf\/day-04-part-04-discrete-mathematics-for-computer-science-negation-operator-proposition-of\/","title":{"rendered":"Day 04  part 04- Discrete mathematics for computer science Negation Operator of Proposition"},"content":{"rendered":"<p>Day 04 part 04- Discrete mathematics for computer science Negation Operator of Proposition<\/p>\n<p>[fvplayer id=&#8221;253&#8243;]<\/p>\n<p data-start=\"0\" data-end=\"193\">The <strong data-start=\"4\" data-end=\"29\">Negation Operator (\u00ac)<\/strong> in <strong data-start=\"33\" data-end=\"56\">Propositional Logic<\/strong> is one of the fundamental logical operators in <strong data-start=\"104\" data-end=\"128\">Discrete Mathematics<\/strong>. It is used to reverse the truth value of a given proposition.<\/p>\n<h3 data-start=\"195\" data-end=\"216\"><strong data-start=\"199\" data-end=\"214\">Definition:<\/strong><\/h3>\n<p data-start=\"217\" data-end=\"362\">If <strong data-start=\"220\" data-end=\"225\">P<\/strong> is a proposition, then the <strong data-start=\"253\" data-end=\"270\">negation of P<\/strong>, denoted as <strong data-start=\"283\" data-end=\"289\">\u00acP<\/strong>, is a proposition that is true when P is false and false when P is true.<\/p>\n<h3 data-start=\"364\" data-end=\"412\"><strong data-start=\"368\" data-end=\"410\">Truth Table of Negation Operator (\u00acP):<\/strong><\/h3>\n<div class=\"overflow-x-auto contain-inline-size\">\n<table data-start=\"414\" data-end=\"461\">\n<thead data-start=\"414\" data-end=\"425\">\n<tr data-start=\"414\" data-end=\"425\">\n<th data-start=\"414\" data-end=\"419\">P<\/th>\n<th data-start=\"419\" data-end=\"425\">\u00acP<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"438\" data-end=\"461\">\n<tr data-start=\"438\" data-end=\"449\">\n<td>T<\/td>\n<td>F<\/td>\n<\/tr>\n<tr data-start=\"450\" data-end=\"461\">\n<td>F<\/td>\n<td>T<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<h3 data-start=\"463\" data-end=\"481\"><strong data-start=\"467\" data-end=\"479\">Example:<\/strong><\/h3>\n<ol data-start=\"482\" data-end=\"680\">\n<li data-start=\"482\" data-end=\"558\">\n<p data-start=\"485\" data-end=\"515\">Let <strong data-start=\"489\" data-end=\"494\">P<\/strong> = &#8220;It is raining.&#8221;<\/p>\n<ul data-start=\"519\" data-end=\"558\">\n<li data-start=\"519\" data-end=\"558\">Then, <strong data-start=\"527\" data-end=\"533\">\u00acP<\/strong> = &#8220;It is not raining.&#8221;<\/li>\n<\/ul>\n<\/li>\n<li data-start=\"560\" data-end=\"680\">\n<p data-start=\"563\" data-end=\"614\">If <strong data-start=\"566\" data-end=\"571\">P<\/strong> = &#8220;5 is greater than 3&#8221; (which is true),<\/p>\n<ul data-start=\"618\" data-end=\"680\">\n<li data-start=\"618\" data-end=\"680\">Then, <strong data-start=\"626\" data-end=\"632\">\u00acP<\/strong> = &#8220;5 is not greater than 3&#8221; (which is false).<\/li>\n<\/ul>\n<\/li>\n<\/ol>\n<h3 data-start=\"682\" data-end=\"724\"><strong data-start=\"686\" data-end=\"722\">Properties of Negation Operator:<\/strong><\/h3>\n<ul data-start=\"725\" data-end=\"844\">\n<li data-start=\"725\" data-end=\"759\"><strong data-start=\"727\" data-end=\"747\">Double Negation:<\/strong> \u00ac(\u00acP) = P<\/li>\n<li data-start=\"760\" data-end=\"844\"><strong data-start=\"762\" data-end=\"786\">Involutory Property:<\/strong> Applying negation twice brings the original value back.<\/li>\n<\/ul>\n<p data-start=\"846\" data-end=\"925\" data-is-last-node=\"\" data-is-only-node=\"\">Would you like more examples or explanations related to propositional logic?<\/p>\n<h3 data-start=\"846\" data-end=\"925\"><a href=\"https:\/\/www2.cs.uh.edu\/~arjun\/courses\/ds\/DiscMaths4CompSc.pdf\" target=\"_blank\" rel=\"noopener\">Day 04 part 04- Discrete mathematics for computer science Negation Operator of Proposition<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/mae.engr.ucdavis.edu\/dsouza\/Classes\/Lec2_ecs20.pdf\" target=\"_blank\" rel=\"noopener\">Discrete Mathematics for Computer Science Prof. Raissa D &#8230;<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/mrce.in\/ebooks\/Maths-Discrete%20Mathematics%20&amp;%20its%20Applications%208th%20Ed.pdf\" target=\"_blank\" rel=\"noopener\">Discrete Mathematics and Its Applications, Eighth Edition<\/a><\/h3>\n<p data-start=\"0\" data-end=\"245\">In <strong data-start=\"3\" data-end=\"27\">Discrete Mathematics<\/strong>, particularly in <strong data-start=\"45\" data-end=\"68\">Propositional Logic<\/strong>, the <strong data-start=\"74\" data-end=\"95\">Negation Operator<\/strong> (denoted as <strong data-start=\"108\" data-end=\"113\">\u00ac<\/strong> or <strong data-start=\"117\" data-end=\"122\">~<\/strong>) is a fundamental unary operator that inverts the truth value of a given proposition.<\/p>\n<hr data-start=\"247\" data-end=\"250\" \/>\n<h3 data-start=\"252\" data-end=\"280\">\ud83d\udd04 <strong data-start=\"259\" data-end=\"280\">What is Negation?<\/strong><\/h3>\n<p data-start=\"282\" data-end=\"495\">If <strong data-start=\"285\" data-end=\"290\">p<\/strong> is a proposition, then its negation, denoted as <strong data-start=\"339\" data-end=\"345\">\u00acp<\/strong>, is the statement &#8220;It is not the case that p.&#8221; This operation flips the truth value of the original proposition.<\/p>\n<p data-start=\"497\" data-end=\"513\"><strong data-start=\"497\" data-end=\"513\">Truth Table:<\/strong><\/p>\n<div class=\"_tableContainer_16hzy_1\">\n<div class=\"_tableWrapper_16hzy_14 group flex w-fit flex-col-reverse\">\n<table class=\"w-fit min-w-(--thread-content-width)\" data-start=\"515\" data-end=\"623\">\n<thead data-start=\"515\" data-end=\"532\">\n<tr data-start=\"515\" data-end=\"532\">\n<th data-start=\"515\" data-end=\"523\" data-col-size=\"sm\">p<\/th>\n<th data-start=\"523\" data-end=\"532\" data-col-size=\"sm\">\u00acp<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"551\" data-end=\"623\">\n<tr data-start=\"551\" data-end=\"568\">\n<td data-start=\"551\" data-end=\"559\" data-col-size=\"sm\">True<\/td>\n<td data-start=\"559\" data-end=\"568\" data-col-size=\"sm\">False<\/td>\n<\/tr>\n<tr data-start=\"569\" data-end=\"623\">\n<td data-start=\"569\" data-end=\"577\" data-col-size=\"sm\">False<\/td>\n<td data-start=\"577\" data-end=\"585\" data-col-size=\"sm\">True<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<div class=\"sticky end-(--thread-content-margin) h-0 self-end select-none\">\n<div class=\"absolute end-0 flex items-end\"><\/div>\n<\/div>\n<\/div>\n<\/div>\n<p data-start=\"625\" data-end=\"637\"><strong data-start=\"625\" data-end=\"637\">Example:<\/strong><\/p>\n<ul data-start=\"639\" data-end=\"761\">\n<li data-start=\"639\" data-end=\"680\">\n<p data-start=\"641\" data-end=\"680\"><span class=\"relative -mx-px my-[-0.2rem] rounded px-px py-[0.2rem] transition-colors duration-100 ease-in-out\">Let <strong data-start=\"4\" data-end=\"9\">p<\/strong>: &#8220;It is raining.&#8221;<\/span><\/p>\n<\/li>\n<li data-start=\"681\" data-end=\"761\">\n<p data-start=\"683\" data-end=\"761\"><span class=\"relative -mx-px my-[-0.2rem] rounded px-px py-[0.2rem] transition-colors duration-100 ease-in-out\">Then, <strong data-start=\"6\" data-end=\"12\">\u00acp<\/strong>: &#8220;It is not raining.&#8221;<\/span><\/p>\n<\/li>\n<\/ul>\n<p data-start=\"763\" data-end=\"841\"><span class=\"relative -mx-px my-[-0.2rem] rounded px-px py-[0.2rem] transition-colors duration-100 ease-in-out\">This means if <strong data-start=\"14\" data-end=\"19\">p<\/strong> is true (it is indeed raining), then <strong data-start=\"57\" data-end=\"63\">\u00acp<\/strong> is false, and vice versa.<\/span><\/p>\n<hr data-start=\"843\" data-end=\"846\" \/>\n<h3 data-start=\"848\" data-end=\"885\">\ud83e\udde0 <strong data-start=\"855\" data-end=\"885\">Key Properties of Negation<\/strong><\/h3>\n<ol data-start=\"887\" data-end=\"1270\">\n<li data-start=\"887\" data-end=\"994\">\n<p data-start=\"890\" data-end=\"910\"><strong data-start=\"890\" data-end=\"910\">Double Negation:<\/strong><\/p>\n<ul data-start=\"914\" data-end=\"994\">\n<li data-start=\"914\" data-end=\"994\">\n<p data-start=\"916\" data-end=\"994\"><span class=\"relative -mx-px my-[-0.2rem] rounded px-px py-[0.2rem] transition-colors duration-100 ease-in-out\">Negating a negation returns the original proposition. That is, <strong data-start=\"63\" data-end=\"76\">\u00ac(\u00acp) \u2261 p<\/strong>.<\/span><span class=\"ms-1 inline-flex max-w-full items-center relative top-[-0.094rem] animate-[show_150ms_ease-in]\"><span class=\"relative start-0 bottom-0 flex h-full w-full items-center\"><span class=\"flex h-4 w-full items-center justify-between overflow-hidden\"><span class=\"max-w-full grow truncate overflow-hidden text-center\">ggc-discrete-math.github.io<\/span><\/span><\/span><\/span><\/p>\n<\/li>\n<\/ul>\n<\/li>\n<li data-start=\"996\" data-end=\"1270\">\n<p data-start=\"999\" data-end=\"1020\"><strong data-start=\"999\" data-end=\"1020\">De Morgan&#8217;s Laws:<\/strong><\/p>\n<ul data-start=\"1024\" data-end=\"1133\">\n<li data-start=\"1024\" data-end=\"1133\">\n<p data-start=\"1026\" data-end=\"1065\"><span class=\"relative -mx-px my-[-0.2rem] rounded px-px py-[0.2rem] transition-colors duration-100 ease-in-out\">These laws relate the negation of conjunctions and disjunctions:<\/span><\/p>\n<ul data-start=\"1071\" data-end=\"1133\">\n<li data-start=\"1071\" data-end=\"1099\">\n<p data-start=\"1073\" data-end=\"1099\"><strong data-start=\"1073\" data-end=\"1099\">\u00ac(p \u2227 q) \u2261 (\u00acp) \u2228 (\u00acq)<\/strong><\/p>\n<\/li>\n<li data-start=\"1105\" data-end=\"1133\">\n<p data-start=\"1107\" data-end=\"1133\"><strong data-start=\"1107\" data-end=\"1133\">\u00ac(p \u2228 q) \u2261 (\u00acp) \u2227 (\u00acq)<\/strong><\/p>\n<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p data-start=\"1138\" data-end=\"1270\">These equivalences are crucial for simplifying logical expressions and are widely used in computer science and digital logic design.<\/p>\n<\/li>\n<\/ol>\n<hr data-start=\"1272\" data-end=\"1275\" \/>\n<h3 data-start=\"1277\" data-end=\"1304\">\ud83d\udcda <strong data-start=\"1284\" data-end=\"1304\">Further Learning<\/strong><\/h3>\n<p data-start=\"1306\" data-end=\"1384\"><span class=\"relative -mx-px my-[-0.2rem] rounded px-px py-[0.2rem] transition-colors duration-100 ease-in-out\">For a more in-depth understanding, you might find the following video helpful:<\/span><\/p>\n<div class=\"not-prose mb-3 flex flex-col gap-4 text-base\">\n<div><\/div>\n<\/div>\n<p data-start=\"1430\" data-end=\"1512\">Feel free to ask if you&#8217;d like this explanation in Hindi or need further examples!<\/p>\n<h3 data-start=\"1430\" data-end=\"1512\"><a href=\"https:\/\/www.cs.yale.edu\/homes\/aspnes\/classes\/202\/notes.pdf\" target=\"_blank\" rel=\"noopener\">Day 04 part 04- Discrete mathematics for computer science Negation Operator of Proposition<\/a><\/h3>\n","protected":false},"excerpt":{"rendered":"<p>Day 04 part 04- Discrete mathematics for computer science Negation Operator of Proposition [fvplayer id=&#8221;253&#8243;] The Negation Operator (\u00ac) in Propositional Logic is one of the fundamental logical operators in Discrete Mathematics. It is used to reverse the truth value of a given proposition. Definition: If P is a proposition, then the negation of P, [&hellip;]<\/p>\n","protected":false},"author":71,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[76],"tags":[],"class_list":["post-3102","post","type-post","status-publish","format-standard","hentry","category-discrete-mathematics"],"_links":{"self":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts\/3102","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/users\/71"}],"replies":[{"embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/comments?post=3102"}],"version-history":[{"count":0,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts\/3102\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/media?parent=3102"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/categories?post=3102"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/tags?post=3102"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}