|
|
Line 1: |
Line 1: |
| A '''truth table''' is a [[mathematical table]] used in [[logic]]—specifically in connection with [[Boolean algebra (logic)|Boolean algebra]], [[boolean function]]s, and [[propositional calculus]]—to [[compute]] the functional values of logical [[expression (mathematics)|expressions]] on each of their functional arguments, that is, on each combination of values taken by their logical variables ([[Herbert Enderton|Enderton]], 2001). In particular, truth tables can be used to tell whether a propositional expression is true for all legitimate input values, that is, [[validity|logically valid]].
| | <br><br>Actual legislation enforcement, like local and state police, don't offer a one hundred% safety assure either. Do you live with such concern when getting in every other vehicle? Automobiles/buses/trains crash. Ferries sink. For the flight attendants - when did you begin working as a flight attendant? Pocketknives have been on planes since business flight began. Pocketknives have nonetheless been on planes since 9/11. There has by no means been a time when pocketknives weren't on planes. Are you unexpectedly terrified of the general public for whom you're being paid to supply service or have you ever always been scared/indignant/distrustful of other folks?<br><br>At home at Melliodora, I'm all the time observing and making selections on the run, doing a sequence of brief tasks and altering mid stream from what I had previously planned. Multi-tasking is the norm in a self-reliant lifestyle, so totally different from the specialisation and repetitive focus that characterises work in the conventional economy. When I'm in the [http://www.knife-depot.com sheath knives] public domain, I undoubtedly have fewer causes to be utilizing instruments but my access to tools is tremendously reduced, particularly when walking, riding a bicycle, or utilizing public transport. In these situations a multi-instrument, or at the very least, a pocket knife is the minimum device to be carrying.<br><br>The deal with has three holes that provides the knife a very sturdy hold. The handle is made of G-10, a very sturdy and light material. The blade flips open simply out the handle and one is able to open the knife with one hand simply. The knife has no lock to maintain the blade close nonetheless but, at this weight, I don’t count on it opening by itself on accident. You should [http://www.thebestpocketknifereviews.com/kershaw-leek-review/ www.thebestpocketknifereviews.com] to judge the associated fee, particular offers, importance, and newest costs of Case Pocket Knives 379 Mounted Blade With Leather Sheath Mounted Blade – Every before buy from any retailer.<br><br>What the actual shame is here is that we've got to be concerned for our safety at all. Everyone is going to have their opinion. Yes, some individuals like to travel with small knives, they're very handy. Nevertheless, a trained individual may do just as much injury with a ball level pen than they can do with a knife. I do wish thy were beginning this a bit earlier since I'm flying to Vegas on April 22 with my pool cues however I'm glad they will be on the aircraft with me on the way dwelling.<br><br>The plan to elevate the ban generated harsh criticism and [http://wiki.sibarcelona.es/index.php/Kershaw_Half_Ton_Knife_Review protests] from lawmakers and flight attendants who pointed out that the terrorists who hijacked the planes on Sept. 11, 2001, had been armed with small blades, among other weapons. I recognize that the TSA listened to the American passengers, and notably our flight attendants who felt uniquely susceptible and have spoken out overwhelmingly in opposition to the knives on planes plan," she said [http://www.thebestpocketknifereviews.com/kershaw-leek-review/ Kershaw Leek Reviews]. Snow globes were pulled off the prohibited checklist a couple of months ago, but only if the globe has less than three.four ounces of liquid inside. That is about the dimension of a tennis ball.<br><br>Administrator John S. Pistole believes that is part of an over all risk-primarily based safety method, which allows TSA officers to raised focus their efforts on discovering higher risk items akin to explosives. I am glad that they will have more time to ensure I take my footwear off and throw away that bottle of water That I just bought for $three.00. I am also glad that I still can only have 3oz. Of shampoo, conditioner & lotions in a plastic bag. God solely is aware of what would happen if I had extra in my stick with it and what may happen if I blended them together.<br><br>Like all outside activities the perfect time to look for artifacts is anytime that you would be able to. That being said some instances are higher than others. My favourite time is throughout a drought. As many activities have been based around water, many artifacts are discovered in the water. Throughout a drought water ranges are reduced exposing areas to the bare eye that can not usually be seen. Along with historic gadgets I have found many coins, watches, and pocket knives doing this. Another good time is after a flood. The flooded waters churn the rocks and soil and uncover previously unexposed items.<br><br>One handed opening. Newer knives have a feature that permits for one handed opening. On the top of the blade, there's a gap that enables you to place the pad of your thumb in. Simply press up and BAM, you bought an open knife. This feature makes using a pocket knife a lot easier, especially when you've gotten your arms full. The place to Get a Pocket Knife The peanut is a small sleek pocket knife more designed for tremendous work,and is usually a good gift for a young boy. The trapper comes in small and largersizes, incorporates two blades, one is for heavy work and the opposite for easywork.<br><br>For those wanting fast recommendations, under you can find a few of our favourite knives on the market immediately. These are glorious decisions for any pocket knife enthusiast and even somebody seeking to purchase their very first knife. Along with this, in searching our website you’ll find an excessive amount of helpful information that can assist you be taught more about pocket knives and make knowledgeable buy choices. Our current top really useful pocket knives Believe it or not, a knife’s brand really matters. Title model knives are, on one hand, costlier than low cost knives however, on the other hand, provides you with less complications in addition to last more. |
| | |
| Practically, a truth table is composed of one column for each input variable (for example, A and B), and one final column for all of the possible results of the logical operation that the table is meant to represent (for example, A XOR B). Each row of the truth table therefore contains one possible configuration of the input variables (for instance, A=true B=false), and the result of the operation for those values. See the examples below for further clarification. [[Ludwig Wittgenstein]] is often credited with their invention in the ''[[Tractatus Logico-Philosophicus]]''.<ref>{{cite journal | author = [[Georg Henrik von Wright]] | title = Ludwig Wittgenstein, A Biographical Sketch | journal = The Philosophical Review | volume = 64 | issue = 4 | year = 1955 | pages = 527–545 (p. 532, note 9) | jstor = 2182631}}</ref>
| |
| | |
| ==Unary operations==
| |
| | |
| ===Logical identity===
| |
| [[Identity function|Logical identity]] is an [[logical operation|operation]] on one [[logical value]], typically the value of a [[proposition]], that produces a value of ''true'' if its operand is true and a value of ''false'' if its operand is false.
| |
| | |
| The truth table for the logical identity operator is as follows:
| |
| | |
| {| class="wikitable" style="margin:1em auto; text-align:center;"
| |
| |+ '''Logical Identity'''
| |
| |-
| |
| ! style="width:20%" | ''p''
| |
| ! style="width:20%" | <span class="texhtml">''p''</span>
| |
| | |
| |-
| |
| | style="width:20%" | <span class="texhtml">''Operand''</span>
| |
| | style="width:20%" | <span class="texhtml">''Value''</span>
| |
| |-
| |
| | T || | T
| |
| |-
| |
| | style="background:papayawhip" | F || style="background:papayawhip" | F
| |
| |}
| |
| | |
| ===Logical negation===
| |
| [[Logical negation]] is an [[logical operation|operation]] on one [[logical value]], typically the value of a [[proposition]], that produces a value of ''true'' if its operand is false and a value of ''false'' if its operand is true.
| |
| | |
| The truth table for '''NOT p''' (also written as '''¬p''', '''Np''', '''Fpq''', or '''~p''') is as follows:
| |
| | |
| {| class="wikitable" style="margin:1em auto; text-align:center;"
| |
| |+ '''Logical Negation'''
| |
| |-
| |
| ! style="width:20%" | ''p''
| |
| ! style="width:20%" | <span class="texhtml">''¬p''</span>
| |
| |-
| |
| | T || style="background:papayawhip" | F
| |
| |-
| |
| | style="background:papayawhip" | F || T
| |
| |}
| |
| | |
| ==Binary operations==
| |
| | |
| ===Truth table for all binary logical operators===
| |
| | |
| Here is a truth table giving definitions of all 16 of the possible truth functions of two binary variables (P and Q are thus boolean variables; for details about the operators see below):
| |
| | |
| {| class="wikitable" style="margin:1em auto 1em auto; text-align:center;"
| |
| |-
| |
| ! ''P'' || ''Q''
| |
| |
| |
| ! [[Contradiction|F]]<sup>0</sup> || [[Logical NOR|NOR]]<sup>1</sup> || [[Converse nonimplication|Xq]]<sup>2</sup> || [[Negation|'''¬p''']]<sup>3</sup> || [[Material nonimplication|↛]]<sup>4</sup> || [[Negation|'''¬q''']]<sup>5</sup> || [[Exclusive disjunction|XOR]]<sup>6</sup> || [[Logical NAND|NAND]]<sup>7</sup>
| |
| |
| |
| !| [[Logical conjunction|AND]]<sup>8</sup> || [[Logical biconditional|XNOR]]<sup>9</sup> || [[Projection function|q]]<sup>10</sup> || [[Material implication|if/then]]<sup>11</sup> || [[Projection function|p]]<sup>12</sup> || [[Converse implication|then/if]]<sup>13</sup> || [[Logical disjunction|OR]]<sup>14</sup> || [[Tautology|T]]<sup>15</sup>
| |
| |-
| |
| ! T || T
| |
| | || F || F || F || F || F || F || F || F || || T || T || T || T || T || T || T || T
| |
| |-
| |
| ! T || F
| |
| | || F || F || F || F || T || T || T || T || || F || F || F || F || T || T || T || T
| |
| |-
| |
| ! F || T
| |
| | || F || F || T || T || F || F || T || T || || F || F || T || T || F || F || T || T
| |
| |-
| |
| ! F || F
| |
| | || F || T || F || T || F || T || F || T || || F || T || F || T || F || T || F || T
| |
| |}
| |
| | |
| where T = true and F = false.
| |
| | |
| Key:
| |
| {| class="wikitable" style="margin:1em auto 1em auto; text-align:left;"
| |
| |-
| |
| ! || || || || Operation name
| |
| |-
| |
| | 0 || O''pq'' || F || false || [[Contradiction]]
| |
| |-
| |
| | 1 || X''pq'' || NOR || ↓ || [[Logical NOR]]
| |
| |-
| |
| | 2 || M''pq'' || Xq || || [[Converse nonimplication]]
| |
| |-
| |
| | 3 || F''pq'' || N''p'' || '''¬p''' || [[Negation]]
| |
| |-
| |
| | 4 || L''pq'' || Xp || ↛ || [[Material nonimplication]]
| |
| |-
| |
| | 5 || G''pq'' || N''q'' || '''¬q''' || Negation
| |
| |-
| |
| | 6 || J''pq'' || XOR || ⊕ || [[Exclusive disjunction]]
| |
| |-
| |
| | 7 || D''pq'' || NAND || ↑ || [[Logical NAND]]
| |
| |-
| |
| | 8 || K''pq'' || AND || ∧ || [[Logical conjunction]]
| |
| |-
| |
| | 9 || E''pq'' || XNOR || [[If and only if]] || [[Logical biconditional]]
| |
| |-
| |
| | 10 || H''pq'' || '''q''' || || [[Projection function]]
| |
| |-
| |
| | 11 || C''pq'' || XNp || if/then || [[Material conditional|Material implication]]
| |
| |-
| |
| | 12 || I''pq'' || '''p''' || || Projection function
| |
| |-
| |
| | 13 || B''pq'' || XNq || then/if || [[Converse conditional|Converse implication]]
| |
| |-
| |
| | 14 || A''pq'' || OR || ∨ || [[Logical disjunction]]
| |
| |-
| |
| | 15 || V''pq'' || T || true || [[Tautology (logic)|Tautology]]
| |
| |}
| |
| Logical operators can also be visualized using [[Venn diagram]]s.
| |
| | |
| ===Logical conjunction===
| |
| [[Logical conjunction]] is an [[logical operation|operation]] on two [[logical value]]s, typically the values of two [[proposition]]s, that produces a value of ''true'' if both of its operands are true.
| |
| | |
| The truth table for '''p AND q''' (also written as '''p ∧ q''', '''Kpq''', '''p & q''', or '''p''' <math>\cdot</math> '''q''') is as follows:
| |
| | |
| {| class="wikitable" style="margin:1em auto; text-align:center;"
| |
| |+ '''Logical Conjunction'''
| |
| |-
| |
| ! style="width:15%" | ''p''
| |
| ! style="width:15%" | ''q''
| |
| ! style="width:15%" | ''p'' ∧ ''q''
| |
| |-
| |
| | T || T || T
| |
| |-
| |
| | T || style="background:papayawhip" | F || style="background:papayawhip" | F
| |
| |-
| |
| | style="background:papayawhip" | F || T || style="background:papayawhip" | F
| |
| |-
| |
| | style="background:papayawhip" | F || style="background:papayawhip" | F || style="background:papayawhip" | F
| |
| |}
| |
| | |
| In ordinary language terms, if both ''p'' and ''q'' are true, then the conjunction ''p'' ∧ ''q'' is true. For all other assignments of logical values to ''p'' and to ''q'' the conjunction ''p'' ∧ ''q'' is false.
| |
| | |
| It can also be said that if ''p'', then ''p'' ∧ ''q'' is ''q'', otherwise ''p'' ∧ ''q'' is ''p''.
| |
| | |
| ===Logical disjunction===
| |
| [[Logical disjunction]] is an [[logical operation|operation]] on two [[logical value]]s, typically the values of two [[proposition]]s, that produces a value of ''true'' if at least one of its operands is true.
| |
| | |
| The truth table for '''p OR q''' (also written as '''p ∨ q''', '''Apq''', '''p || q''', or '''p + q''') is as follows:
| |
| | |
| {| class="wikitable" style="margin:1em auto; text-align:center;"
| |
| |+ '''Logical Disjunction'''
| |
| |-
| |
| ! style="width:15%" | ''p''
| |
| ! style="width:15%" | ''q''
| |
| ! style="width:15%" | ''p'' ∨ ''q''
| |
| |-
| |
| | T || T || T
| |
| |-
| |
| | T || style="background:papayawhip" | F || T
| |
| |-
| |
| | style="background:papayawhip" | F || T || T
| |
| |-
| |
| | style="background:papayawhip" | F || style="background:papayawhip" | F || style="background:papayawhip" | F
| |
| |}
| |
| | |
| Stated in English, if ''p'', then ''p'' ∨ ''q'' is ''p'', otherwise ''p'' ∨ ''q'' is ''q''.
| |
| | |
| ===Logical implication===
| |
| Logical implication or the [[material conditional]] are both associated with an [[logical operation|operation]] on two [[logical value]]s, typically the values of two [[proposition]]s, that produces a value of ''false'' just in the singular case the first operand is true and the second operand is false.
| |
| | |
| The truth table associated with the material conditional '''if p then q''' (symbolized as '''p → q''') and the logical implication '''p implies q''' (symbolized as '''p ⇒ q''', or '''Cpq''') is as follows:
| |
| | |
| {| class="wikitable" style="margin:1em auto; text-align:center;"
| |
| |+ '''Logical Implication'''
| |
| |-
| |
| ! style="width:15%" | ''p''
| |
| ! style="width:15%" | ''q''
| |
| ! style="width:15%" | ''p'' → ''q''
| |
| |-
| |
| | T || T || T
| |
| |-
| |
| | T || style="background:papayawhip" | F || style="background:papayawhip" | F
| |
| |-
| |
| | style="background:papayawhip" | F || T || T
| |
| |-
| |
| | style="background:papayawhip" | F || style="background:papayawhip" | F || T
| |
| |}
| |
| | |
| It may also be useful to note that '''p → q''' is equivalent to '''¬p ∨ q'''.
| |
| | |
| ===Logical equality===
| |
| [[Logical equality]] (also known as biconditional) is an [[logical operation|operation]] on two [[logical value]]s, typically the values of two [[proposition]]s, that produces a value of ''true'' if both operands are false or both operands are true.
| |
| | |
| The truth table for '''p XNOR q''' (also written as '''p ↔ q''', '''Epq''', '''p = q''', or '''p ≡ q''') is as follows:
| |
| | |
| {| class="wikitable" style="margin:1em auto; text-align:center;"
| |
| |+ '''Logical Equality'''
| |
| |-
| |
| ! style="width:15%" | ''p''
| |
| ! style="width:15%" | ''q''
| |
| ! style="width:15%" | ''p'' ≡ ''q''
| |
| |-
| |
| | T || T || T
| |
| |-
| |
| | T || style="background:papayawhip" | F || style="background:papayawhip" | F
| |
| |-
| |
| | style="background:papayawhip" | F || T || style="background:papayawhip" | F
| |
| |-
| |
| | style="background:papayawhip" | F || style="background:papayawhip" | F || T
| |
| |}
| |
| | |
| So p EQ q is true if p and q have the same [[truth value]] (both true or both false), and false if they have different truth values.
| |
| | |
| ===Exclusive disjunction===
| |
| [[Exclusive disjunction]] is an [[logical operation|operation]] on two [[logical value]]s, typically the values of two [[proposition]]s, that produces a value of ''true'' if one but not both of its operands is true.
| |
| | |
| The truth table for '''p XOR q''' (also written as '''p ⊕ q''', '''Jpq''', or '''p ≠ q''') is as follows:
| |
| | |
| {| class="wikitable" style="margin:1em auto; text-align:center;"
| |
| |+ '''Exclusive Disjunction'''
| |
| |-
| |
| ! style="width:15%" | ''p''
| |
| ! style="width:15%" | ''q''
| |
| ! style="width:15%" | ''p'' ⊕ ''q''
| |
| |-
| |
| | T || T || style="background:papayawhip" | F
| |
| |-
| |
| | T || style="background:papayawhip" | F || T
| |
| |-
| |
| | style="background:papayawhip" | F || T || T
| |
| |-
| |
| | style="background:papayawhip" | F || style="background:papayawhip" | F || style="background:papayawhip" | F
| |
| |}
| |
| | |
| For two propositions, '''XOR''' can also be written as (p = 1 ∧ q = 0) ∨ (p = 0 ∧ q = 1).
| |
| | |
| ===Logical NAND===
| |
| The [[logical NAND]] is an [[logical operation|operation]] on two [[logical value]]s, typically the values of two [[proposition]]s, that produces a value of ''false'' if both of its operands are true. In other words, it produces a value of ''true'' if at least one of its operands is false.
| |
| | |
| The truth table for '''p NAND q''' (also written as '''p ↑ q''', '''Dpq''', or '''p | q''') is as follows:
| |
| | |
| {| class="wikitable" style="margin:1em auto; text-align:center;"
| |
| |+ '''Logical NAND'''
| |
| |-
| |
| ! style="width:15%" | ''p''
| |
| ! style="width:15%" | ''q''
| |
| ! style="width:15%" | ''p'' ↑ ''q''
| |
| |-
| |
| | T || T || style="background:papayawhip" | F
| |
| |-
| |
| | T || style="background:papayawhip" | F || T
| |
| |-
| |
| | style="background:papayawhip" | F || T || T
| |
| |-
| |
| | style="background:papayawhip" | F || style="background:papayawhip" | F || T
| |
| |}
| |
| | |
| It is frequently useful to express a logical operation as a compound operation, that is, as an operation that is built up or composed from other operations. Many such compositions are possible, depending on the operations that are taken as basic or "primitive" and the operations that are taken as composite or "derivative".
| |
| | |
| In the case of logical NAND, it is clearly expressible as a compound of NOT and AND.
| |
| | |
| The negation of a conjunction: ¬(''p'' ∧ ''q''), and the disjunction of negations: (¬''p'') ∨ (¬''q'') can be tabulated as follows:
| |
| | |
| {| class="wikitable" style="margin:1em auto; text-align:center;"
| |
| |-
| |
| ! style="width:15%" | ''p''
| |
| ! style="width:15%" | ''q''
| |
| ! style="width:15%" | ''p'' ∧ ''q''
| |
| ! style="width:15%" | ¬(''p'' ∧ ''q'')
| |
| ! style="width:15%" | ¬''p''
| |
| ! style="width:15%" | ¬''q''
| |
| ! style="width:15%" | (¬''p'') ∨ (¬''q'')
| |
| |-
| |
| | T || T || T || style="background:papayawhip" | F || style="background:papayawhip" | F || style="background:papayawhip" | F || style="background:papayawhip" | F
| |
| |-
| |
| | T || style="background:papayawhip" | F || style="background:papayawhip" | F || T || style="background:papayawhip" | F || T || T
| |
| |-
| |
| | style="background:papayawhip" | F || T || style="background:papayawhip" | F || T || T || style="background:papayawhip" | F || T
| |
| |-
| |
| | style="background:papayawhip" | F || style="background:papayawhip" | F || style="background:papayawhip" | F || T || T || T || T
| |
| |}
| |
| | |
| ===Logical NOR===
| |
| The [[logical NOR]] is an [[logical operation|operation]] on two [[logical value]]s, typically the values of two [[proposition]]s, that produces a value of ''true'' if both of its operands are false. In other words, it produces a value of ''false'' if at least one of its operands is true. ↓ is also known as the [[Peirce arrow]] after its inventor, [[Charles Sanders Peirce]], and is a [[Sole sufficient operator]].
| |
| | |
| The truth table for '''p NOR q''' (also written as '''p ↓ q''', '''Xpq''', or '''p ⊥ q''') is as follows:
| |
| | |
| {| class="wikitable" style="margin:1em auto; text-align:center;"
| |
| |+ '''Logical NOR'''
| |
| |-
| |
| ! style="width:15%" | ''p''
| |
| ! style="width:15%" | ''q''
| |
| ! style="width:15%" | ''p'' ↓ ''q''
| |
| |-
| |
| | T || T || style="background:papayawhip" | F
| |
| |-
| |
| | T || style="background:papayawhip" | F || style="background:papayawhip" | F
| |
| |-
| |
| | style="background:papayawhip" | F || T || style="background:papayawhip" | F
| |
| |-
| |
| | style="background:papayawhip" | F || style="background:papayawhip" | F || T
| |
| |}
| |
| | |
| The negation of a disjunction ¬(''p'' ∨ ''q''), and the conjunction of negations (¬''p'') ∧ (¬''q'') can be tabulated as follows:
| |
| | |
| {| class="wikitable" style="margin:1em auto; text-align:center;"
| |
| |-
| |
| ! style="width:10%" | ''p''
| |
| ! style="width:10%" | ''q''
| |
| ! style="width:10%" | ''p'' ∨ ''q''
| |
| ! style="width:10%" | ¬(''p'' ∨ ''q'')
| |
| ! style="width:10%" | ¬''p''
| |
| ! style="width:10%" | ¬''q''
| |
| ! style="width:10%" | (¬''p'') ∧ (¬''q'')
| |
| |-
| |
| | T || T || T || style="background:papayawhip" | F || style="background:papayawhip" | F || style="background:papayawhip" | F || style="background:papayawhip" | F
| |
| |-
| |
| | T || style="background:papayawhip" | F || T || style="background:papayawhip" | F || style="background:papayawhip" | F || T || style="background:papayawhip" | F
| |
| |-
| |
| | style="background:papayawhip" | F || T || T || style="background:papayawhip" | F || T || style="background:papayawhip" | F || style="background:papayawhip" | F
| |
| |-
| |
| | style="background:papayawhip" | F || style="background:papayawhip" | F || style="background:papayawhip" | F || T || T || T || T
| |
| |}
| |
| | |
| Inspection of the tabular derivations for NAND and NOR, under each assignment of logical values to the functional arguments ''p'' and ''q'', produces the identical patterns of functional values for ¬(''p'' ∧ ''q'') as for (¬''p'') ∨ (¬''q''), and for ¬(''p'' ∨ ''q'') as for (¬''p'') ∧ (¬''q''). Thus the first and second expressions in each pair are logically equivalent, and may be substituted for each other in all contexts that pertain solely to their logical values.
| |
| | |
| This equivalence is one of [[De Morgan's laws]].
| |
| | |
| ==Applications==
| |
| Truth tables can be used to prove many other [[logical equivalence]]s. For example, consider the following truth table:
| |
| | |
| {| class="wikitable" style="margin:1em auto; text-align:center;"
| |
| |+ '''Logical Equivalence : (''p'' → ''q'') = (¬''p'' ∨ ''q'')'''
| |
| |- style="background:paleturquoise"
| |
| ! style="width:12%" |''p''
| |
| ! style="width:12%" | ''q''
| |
| ! style="width:12%" | ¬''p''
| |
| ! style="width:12%" | ¬''p'' ∨ ''q''
| |
| ! style="width:12%" | ''p'' → ''q''
| |
| |-
| |
| | T || T || style="background:papayawhip" | F || T || T
| |
| |-
| |
| | T || style="background:papayawhip" | F || style="background:papayawhip" | F || style="background:papayawhip" | F || style="background:papayawhip" | F
| |
| |-
| |
| | style="background:papayawhip" | F || T || T || T || T
| |
| |-
| |
| | style="background:papayawhip" | F || style="background:papayawhip" | F || T || T || T
| |
| |}
| |
| | |
| This demonstrates the fact that ''p'' → ''q'' is [[logically equivalent]] to ¬''p'' ∨ ''q''.
| |
| | |
| ===Truth table for most commonly used logical operators===
| |
| Here is a truth table giving definitions of the most commonly used 6 of [[Tractatus Logico-Philosophicus#Propositions 4.*-5.*|the 16 possible truth functions of 2 binary variables (P,Q are thus boolean variables)]]:
| |
| | |
| {| class="wikitable" style="margin:1em auto 1em auto; text-align:center;"
| |
| |-
| |
| ! <math>P </math> || <math>Q </math> || <math>P \land Q</math> || <math>P \lor Q</math> || <math>P \underline{\lor} Q</math> || <math>P \underline{\land} Q</math> || <math>P \Rightarrow Q</math> || <math>P \Leftarrow Q</math> || <math>P \iff Q</math>
| |
| |-
| |
| | T || T || T || T || F || T || T || T || T
| |
| |-
| |
| | T || F || F || T || T || F || F || T || F
| |
| |-
| |
| | F || T || F || T || T || F || T || F || F
| |
| |-
| |
| | F || F || F || F || F || T || T || T || T
| |
| |}
| |
| | |
| Key:
| |
| :T = true, F = false
| |
| :<math>\land</math> = [[logical conjunction|AND]] (logical conjunction)
| |
| :<math>\lor</math> = [[logical disjunction|OR]] (logical disjunction)
| |
| :<math>\underline{\lor}</math> = [[Exclusive or|XOR]] (exclusive or) <!-- this could be "+" instead according to other articles -->
| |
| :<math>\underline{\land}</math> = [[Exclusive nor|XNOR]] (exclusive nor)
| |
| :<math>\rightarrow</math> = [[logical conditional|conditional "if-then"]]
| |
| :<math>\leftarrow</math> = conditional "(then)-if"
| |
| | |
| :<math>\iff</math> [[if and only if|biconditional or "if-and-only-if"]] is [[Logical equivalence|logically equivalent]] to <math>\underline{\and}</math>: XNOR (exclusive nor).
| |
| | |
| Logical operators can also be visualized using [[Venn diagram]]s.
| |
| | |
| ===Condensed truth tables for binary operators===
| |
| For binary operators, a condensed form of truth table is also used, where the row headings and the column headings specify the operands and the table cells specify the result. For example [[Boolean logic]] uses this condensed truth table notation:
| |
| | |
| {|
| |
| |-
| |
| | style="width:80px;"|
| |
| |
| |
| {| class="wikitable" style="margin:1em auto 1em auto; text-align:center;"
| |
| |-
| |
| ! ∧ || F || T
| |
| |-
| |
| ! F
| |
| | F || F
| |
| |-
| |
| ! T
| |
| | F || T
| |
| |}
| |
| | style="width:80px;"|
| |
| |
| |
| {| class="wikitable" style="margin:1em auto 1em auto; text-align:center;"
| |
| |-
| |
| ! ∨ || F || T
| |
| |-
| |
| ! F
| |
| | F || T
| |
| |-
| |
| ! T
| |
| | T || T
| |
| |}
| |
| |}
| |
| | |
| This notation is useful especially if the operations are commutative, although one can additionally specify that the rows are the first operand and the columns are the second operand. This condensed notation is particularly useful in discussing multi-valued extensions of logic, as it significantly cuts down on combinatoric explosion of the number of rows otherwise needed. It also provides for quickly recognizable characteristic "shape" of the distribution of the values in the table which can assist the reader in grasping the rules more quickly.
| |
| | |
| ===Truth tables in digital logic===
| |
| Truth tables are also used to specify the functionality of [[Lookup table#Hardware LUTs|hardware look-up tables (LUTs)]] in [[Digital circuit|digital logic circuitry]]. For an n-input LUT, the truth table will have 2^''n'' values (or rows in the above tabular format), completely specifying a boolean function for the LUT. By representing each boolean value as a [[bit]] in a [[Binary numeral system|binary number]], truth table values can be efficiently encoded as [[integer]] values in [[Electronic design automation|electronic design automation (EDA)]] [[software]]. For example, a 32-bit integer can encode the truth table for a LUT with up to 5 inputs.
| |
| | |
| When using an integer representation of a truth table, the output value of the LUT can be obtained by calculating a bit index ''k'' based on the input values of the LUT, in which case the LUT's output value is the ''k''th bit of the integer. For example, to evaluate the output value of a LUT given an [[Array data structure|array]] of ''n'' boolean input values, the bit index of the truth table's output value can be computed as follows: if the ''i''th input is true, let V''i'' = 1, else let V''i'' = 0. Then the ''k''th bit of the binary representation of the truth table is the LUT's output value, where ''k'' = V0*2^0 + V1*2^1 + V2*2^2 + ... + V''n''*2^''n''.
| |
| | |
| Truth tables are a simple and straightforward way to encode boolean functions, however given the [[exponential growth]] in size as the number of inputs increase, they are not suitable for functions with a large number of inputs. Other representations which are more memory efficient are text equations and [[binary decision diagram]]s.
| |
| | |
| ===Applications of truth tables in digital electronics===
| |
| In digital electronics and computer science (fields of applied logic engineering and mathematics), truth tables can be used to reduce basic boolean operations to simple correlations of inputs to outputs, without the use of [[logic gate]]s or code. For example, a binary addition can be represented with the truth table:
| |
| | |
| <pre>
| |
| A B | C R
| |
| 1 1 | 1 0
| |
| 1 0 | 0 1
| |
| 0 1 | 0 1
| |
| 0 0 | 0 0
| |
| | |
| where
| |
| | |
| A = First Operand
| |
| B = Second Operand
| |
| C = Carry
| |
| R = Result
| |
| </pre>
| |
| | |
| This truth table is read left to right:
| |
| * Value pair (A,B) equals value pair (C,R).
| |
| * Or for this example, A plus B equal result R, with the Carry C.
| |
| | |
| Note that this table does not describe the logic operations necessary to implement this operation, rather it simply specifies the function of inputs to output values.
| |
| | |
| With respect to the result, this example may be arithmetically viewed as modulo 2 binary addition, and as logically equivalent to the exclusive-or (exclusive disjunction) binary logic operation.
| |
| | |
| In this case it can be used for only very simple inputs and outputs, such as 1s and 0s. However, if the number of types of values one can have on the inputs increases, the size of the truth table will increase.
| |
| | |
| For instance, in an addition operation, one needs two operands, A and B. Each can have one of two values, zero or one. The number of combinations of these two values is 2×2, or four. So the result is four possible outputs of C and R. If one were to use base 3, the size would increase to 3×3, or nine possible outputs.
| |
| | |
| The first "addition" example above is called a half-adder. A full-adder is when the carry from the previous operation is provided as input to the next adder. Thus, a truth table of eight rows would be needed to describe a [[full adder]]'s logic:
| |
| | |
| <pre>
| |
| A B C* | C R
| |
| 0 0 0 | 0 0
| |
| 0 1 0 | 0 1
| |
| 1 0 0 | 0 1
| |
| 1 1 0 | 1 0
| |
| 0 0 1 | 0 1
| |
| 0 1 1 | 1 0
| |
| 1 0 1 | 1 0
| |
| 1 1 1 | 1 1
| |
| | |
| Same as previous, but..
| |
| C* = Carry from previous adder
| |
| </pre>
| |
| | |
| ==History==
| |
| Irving Anellis has done the research to show that [[C.S. Peirce]] appears to be the earliest logician (in 1893) to devise a truth table matrix. From the summary of his paper:
| |
| <blockquote> In 1997, John Shosky discovered, on the verso of a page of the typed transcript of Bertrand Russell’s 1912 lecture on “The Philosophy of Logical Atomism” truth table matrices. The matrix for negation is Russell’s, alongside of which is the matrix for material implication in the hand of Ludwig Wittgenstein. It is shown that an unpublished manuscript identified as composed by Peirce in 1893 includes a truth table matrix that is equivalent to the matrix for material implication discovered by John Shosky. An unpublished manuscript by Peirce identified as having been composed in 1883-84 in connection with the composition of Peirce’s “On the Algebra of Logic: A Contribution to the Philosophy of Notation” that appeared in the American Journal of Mathematics in 1885 includes an example of an indirect truth table for the conditional. </blockquote>
| |
| | |
| ==See also==
| |
| {{Portal|Thinking|Logic}}
| |
| {{div col|colwidth=20em}}
| |
| * [[Boolean domain]]
| |
| * [[Boolean-valued function]]
| |
| * [[Publicad|Espresso heuristic logic minimizer]]
| |
| * [[Excitation table]]
| |
| * [[First-order logic]]
| |
| * [[Functional completeness]]
| |
| * [[Karnaugh maps]]
| |
| * [[Logic gate]]
| |
| * [[Logical connective]]
| |
| * [[Logical graph]]
| |
| * [[Method of analytic tableaux]]
| |
| * [[Propositional calculus]]
| |
| * [[Truth function]]
| |
| {{div col end}}
| |
| | |
| ==References==
| |
| {{Reflist}}
| |
| | |
| ==Further reading==
| |
| * [[Bocheński, Józef Maria]] (1959), ''A Précis of Mathematical Logic'', translated from the French and German editions by Otto Bird, Dordrecht, South Holland: D. Reidel.
| |
| * [[Herbert Enderton|Enderton, H.]] (2001). ''A Mathematical Introduction to Logic'', second edition, New York: Harcourt Academic Press. ISBN 0-12-238452-0
| |
| * [[W.V. Quine|Quine, W.V.]] (1982), ''Methods of Logic'', 4th edition, Cambridge, MA: Harvard University Press.
| |
| | |
| ==External links==
| |
| {{Commons category|Truth tables}}
| |
| * {{springer|title=Truth table|id=p/t094370}}
| |
| *[http://www.millersville.edu/~bikenaga/math-proof/truth-tables/truth-tables.html Truth Tables, Tautologies, and Logical Equivalence]
| |
| *[http://arxiv.org/ftp/arxiv/papers/1108/1108.2429.pdf PEIRCE’S TRUTH-FUNCTIONAL ANALYSIS AND THE ORIGIN OF TRUTH TABLES by Irving H. Anellis]
| |
| | |
| {{Logical connectives}}
| |
| {{Logic}}
| |
| | |
| {{DEFAULTSORT:Truth Table}}
| |
| [[Category:Boolean algebra]]
| |
| [[Category:Mathematical tables]]
| |
| [[Category:Semantics]]
| |
| [[Category:Propositional calculus]]
| |
| [[Category:Conceptual models]]
| |