{"id":14359,"date":"2016-02-15T20:44:05","date_gmt":"2016-02-15T20:44:05","guid":{"rendered":"http:\/\/www.oracletutoring.ca\/blog\/?p=14359"},"modified":"2016-02-15T20:44:05","modified_gmt":"2016-02-15T20:44:05","slug":"math-comp-sci-symbolic-logic-another-tautology","status":"publish","type":"post","link":"https:\/\/www.oracletutoring.ca\/blog\/math-comp-sci-symbolic-logic-another-tautology\/","title":{"rendered":"Math & Comp Sci: Symbolic Logic: another tautology"},"content":{"rendered":"

The tutor follows up about tautology with another example.<\/h1>\n

For grounding about the symbols, etc, readers may want to refer to my Feb 12<\/a> post.<\/p>\n

In my Feb 13 post<\/a> I defined tautology with a simple example. Today, I’ll give a more involved one.<\/a><\/p>\n

A tautology is a compound statement which is always true. Consider the following example:<\/p>\n

(¬p ∨ q) ⊻ (p ∧ ¬q)<\/a><\/p>\n

The central sign ⊻ is exclusive or; it’s true if one of the inputs is, but not both.<\/p>\n

Let’s imagine both p, q false (0). Then the first bracket is true, the second false, so the entire statement is true.<\/p>\n

If p is true, q false, then first bracket is false, but the second bracket is true. Once again, the full statement is true.<\/p>\n

If q is true, then the first bracket is true, the second false: the full statement is true.<\/p>\n

Source:<\/p>\n

Grimaldi, Ralph P. Discrete and Combinatorial Mathematics<\/u>. Don Mills: Addison-
  Wesley, 1994<\/p>\n

Jack of Oracle Tutoring by Jack and Diane,<\/a> Campbell River, BC.<\/p>\n","protected":false},"excerpt":{"rendered":"

The tutor follows up about tautology with another example. For grounding about the symbols, etc, readers may want to refer to my Feb 12 post. In my Feb 13 post I defined tautology with a simple example. Today, I’ll give …<\/p>\n

Math & Comp Sci: Symbolic Logic: another tautology<\/span> Read More »<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[105,3],"tags":[1428,1430,1431],"class_list":["post-14359","post","type-post","status-publish","format-standard","hentry","category-computer-science","category-math","tag-exclusive-or","tag-symbolic-logic","tag-tautology"],"_links":{"self":[{"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/posts\/14359","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/comments?post=14359"}],"version-history":[{"count":16,"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/posts\/14359\/revisions"}],"predecessor-version":[{"id":14375,"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/posts\/14359\/revisions\/14375"}],"wp:attachment":[{"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/media?parent=14359"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/categories?post=14359"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.oracletutoring.ca\/blog\/wp-json\/wp\/v2\/tags?post=14359"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}