What is Truth table: Definition and 71 Discussions
A truth table is a mathematical table used in logic—specifically in connection with Boolean algebra, boolean functions, and propositional calculus—which sets out the functional values of logical expressions on each of their functional arguments, that is, for each combination of values taken by their logical variables. In particular, truth tables can be used to show whether a propositional expression is true for all legitimate input values, that is, logically valid.
A truth table has one column for each input variable (for example, P and Q), and one final column showing all of the possible results of the logical operation that the table represents (for example, P XOR Q). Each row of the truth table contains one possible configuration of the input variables (for instance, P=true Q=false), and the result of the operation for those values. See the examples below for further clarification. Ludwig Wittgenstein is generally credited with inventing and popularizing the truth table in his Tractatus Logico-Philosophicus, which was completed in 1918 and published in 1921. Such a system was also independently proposed in 1921 by Emil Leon Post. An even earlier iteration of the truth table has also been found in unpublished manuscripts by Charles Sanders Peirce from 1893, antedating both publications by nearly 30 years.
We say that an implication p --> q is vaccuously true if p is false.
Since now it's impossible to have p true and q false.
That is we can't check anymore whether the contrary, p being true and q being false,can be.Since p being true is non-existent.
So we take the implication as true.
For eg...
Hi all,
I am having some troubles deriving the truth table of the following:
I don't understand how does one gets to the highlight parts. For example, 10 10, when the carry is low, shouldn't the output be 0 0 1?
I fully understand how to add if it is a single bit, but now with 2 bits, it is a...
Hi all,
Having some problems digesting on electric circuits. Below is an example of a question and I would like to ask how do I go ahead in solving this.
Firstly, for these types of questions:
I have understood how to write a function table, and it goes something like this:
Now what I am...
This isn't a homework problem, but I was going to post it in there as my question is similar to one that would be asked there. However there doesn't seem to be a logic section for it so I posted it here.
The question is to make a logic table to determine if the following statement is valid...
Hello!
The question is attached.
I know that " $\implies $ " (implies) has precedence from right to left. But because " l- " appears after
P$\implies ($Q $\implies$ R ), in my truth table do I evaluate:(P$\implies ($Q $\implies$ R ) ) $\implies$ ((P$\implies$Q ) $\implies$ R ) )
or...
So I am very, very new to logic based questions, and in the past have solved some with relative ease but whilest scrolling through the next to find some example stuff I came across a website that gives a question and hints to the question if stuck, so I thought this would be good practice. But...
Homework Statement
See both images please
Homework Equations
It is truth table.
It has T and F .
The Attempt at a Solution
What is that double line arrow thing?
I can't find on net.
Consider the following open propositions over the universe U = {− 4,−2, 0, 1, 3, 5, 6,
8, 10}
P(x): x ≥ 4
Q(x): x 2 = 25
R(x): s is a multiple of 2
Find on a single truth table the truth-values of the following.
i. P(x ) ∧ R (x )
ii. [~ Q(x )] ∧ P(x )]
Homework Statement
[/B]
"Use the truth table method in Boole to determine whether the conclusion is a tautological consequence of the premises."
(Tet(a) ^ Small(a)) v Small(b)
------
Small(a) v Small(b)
Homework Equations
[/B]
Taller(claire,max) v Taller(max,claire)
Taller(claire,max)...
Homework Statement
(a)
The diagram represents a NAND gate with two inputs, T1 and T2, and an output X. Copy the truth table above and complete it.
Show how a NAND gate can become a NOT gate.
(b)
Draw up a truth table for the combination of NAND gates shown above.
2. The attempt at a...
Homework Statement
Construct a truth table for the combination of logic gates shown above.
2. The attempt at a solution
First of all the combination of logic gates with added letters to the combination:
The truth table:
I think it should be correct. But just want to be sure.
Homework Statement
A person can either be a knight (always tells the truth) or a knave (always tells a lie).
On an island with three persons (A, B and C), A tells "If I am a knight, then at least one of us is a knave".
Homework Equations
Truth tables, logic rules.
The Attempt at a Solution...
Homework Statement
The question I'm asking about is number two. Should've made it clearer.
Homework Equations
N/A
The Attempt at a Solution
My proof table, I'm not sure but it seems that PΞQ is not true.
How would I use a truth table to show that the statement p v (q ^ r) is equivalent to (p v q) ^ (p v r) or design a venn diagram for this. and show that this statement is not equivalent to (p v q) ^ r.
(( X xor Y ) xor Z ) xor T
I hope the truth table is correct. I'm not sure, because of the T. T is always 1, right?
X Y Z - (( X xor Y ) xor Z ) xor T
111 - 0
110 - 1
101 - 1
100 - 0
011 - 1
010 - 0
001 -...
Homework Statement
Homework Equations
n/a
The Attempt at a Solution
I understand how to read the truth table. I understand that A, B, C, D are the inputs where 10 possible inputs are shown. However, with little to no sources available, I am lost on behalf of how this image came about to...
Homework Statement
The question is mostly in the picture, it has tables associated with it so I couldn't put it here.QUESTION: Make a truth table of the controller outputs enable/direction, as a function of the inputs S1, S2, R1, and R2. Since you have not been given the explicit output for...
<< Mentor Note -- Moved from the technical math forums, so no HH Template is shown >>
I am currently working through a Finite math book Intro to finite math: second Edition Kemeny, Snell, and Thompson. One of the exercises wants me to construct a truth table for the following:
~(p|q)...
P.S I know I am not supposed to use attachment but there are no way for me to input the table in a clean way... same for the logic circuit drawing. Would anyone mind helping me?
1. Homework Statement
Homework Equations
AND gates require both input to be True to get a true ouput
NOT gates...
Homework Statement
((p_r)^(q_r))<-->((p^q)_r) Prove whether the following statement is a tautology , contigency or contradiction using a truth table.
Homework EquationsThe Attempt at a Solution
I did the truth table, but this whole thing is one statement no? What do I compare? the first half...
Homework Statement
http://imgur.com/BSntip0The Attempt at a Solution
for part a, i got the solution to be F1 = xy'+x'y= x⊕y (XOR) , F2 = x .y (AND)
for part b i don't understand how i would derive an equal equation that uses only NAND which is (xy') and inverter which is x'
Fill out the truthe table for the following specification. Given a system with 3 inputs(y2,y1,y0) and a single output (f), where Y = y2,y1,y0 represents a 3 bit unsigned integer (Y is the decimal equivalent), determine the truth table for f such that f = 1 if and only if 1 < Y <= 6 (Y is greater...
Fill in the F column values in the truth table for the circuit.
Need someone to check my work.
My Answer:
x y z | f | x! and y! | x! XOR z|
0 0 0| 0 | 1 | 1
0 0 1| 1 | 1 | 0
0 1 0| 1 | 0 | 1
0 1 1| 0 | 0 | 0
1 0 0| 0 | 0 | 0
1 0 1| 1 |...
Homework Statement
Using boolean algebra, verify if the identity is true. Draw truth table to verify answers.
x XOR 1 = x
The Attempt at a Solution
x \oplus 1 = x
(x’ * 1) + (x * 1’)
(x’ * 1) + (x * 0)
(x’ * 1) + 0
(x’ * 1)
x’
I've proven that the equation is false. How...
Also would someone mind checking my work on these problems too? My answers are in BOLD
2a)Draw the truth table corresponding to $f$(X,Y,Z) = \piM(2,4,6)
ANSWER:
x y z | f
0 0 0| 1
0 0 1| 1
0 1 0| 0
0 1 1| 1
1 0 0| 0
1 0 1| 1
1 1 0| 0
1 1 1| 1
2b) Write out the canonical product of sums...
The truth table of it is as follows for reference:
p q p→q
T T T
T F F
F T T
F F T
I was wondering anyone can shed some light on an easier way to memorize or think about this then just memorizing the truth table. This seems to be the least...
Hello, I have some questions about the truth tables for impliocation and equivalence.
for implication we have:
p | q | p=> q
T | T | T
T | F | F
F | T | T
F | F | T
Here I do not understand the last two lines, how can we say that p implies q when...
Hey,
What are the steps to follow to draw a truth table and create canonical expression
from a given expression A?
Lets say I have A= B'.(C'+D)
1) first I have to draw the truth table for the expression above, but How could I do that since I only have one expression?
2)Then I...
Homework Statement
Use the rules of inference to prove the following:
(¬p ^ q) ^ (r → p) ^ (¬r → s) ^ (s → t) ) ⇔ t.
Homework Equations
Rules of Inference I guess.
The Attempt at a Solution
Honestly I don't know where to start using the rules of inference. I drew a truth table and...
I have a 9 input to 9 output truth table I constructed using Python. I am trying to find a program that can deduce the (hopefully minimized) Boolean expression for my outputs. I tried Logisim already, but when I try to paste the enormous data (512 rows), my Logisim crashes. Can anyone recommend...
Hi!
I'm struggling with the bellow truth tables:
P = I live in Paris
Q = I live in France
A B C
P → Q Q → P ¬ Q → ¬ P
S S S S S S F S F
S F F F S S S F F
F S S S F F F S S
F S F F S F S S S
Table A and C I'm...
I attached the problem statement.
The problems I have done in the past always involved gates (AND, OR, etc...)
Now this involves transistors, I honestly don't know how to go about doing this.
One of the hints for the problem is to assume the ideal transistors are operating in cutoff or...
I had a cpre exam last night and this was the last question. Can some one tell me the answer, I'm curious if I got it right or not. The part that tripped me up was a 2 bit "half adder". I assumed I wasn't supposed to use a full adder. So I'm not sure what to do with the carry from the first...
I've been working at this problem for a while and it seems that there should be an easier more systematic way of solving it. Here it is:
Find a proposition using only p, q, ¬ and the connective ∧ with the given truth table.
p q ?
T T F
T F F
F T T
F F T
I know of a...
Homework Statement
Find a proposition using only p, q, ¬ and the connective ∧ with the given truth table.
p q ?
T T F
T F F
F T T
F F T
Homework Equations
The Attempt at a Solution
There is a systematic way of solving these but this system requires the use of an...
Homework Statement
Create a truth table for ((P->Q) == (Q->P))Homework EquationsThe Attempt at a Solution
http://www.freeimagehosting.net/newuploads/94ldj.pngI've had two quizes with problems just like this marked wrong in my college logic course. I confronted the professor about it and he...
Truth Table for "A unless B", or "A , only if B"?
Hi, All:
My friend is preparing for the LSAT's, and he asked me to help her with the Logic Games
part.
Two of the binary connectives often used in those games are 'unless', and 'only if'. I guess I'm being kind of lazy , hoping...
Homework Statement
Construct a truth table to show:
Z=(A+(not)B).(B+C).((not)A+B+D)Homework Equations
The Attempt at a Solution
from 0,0,0,0 to 1,1,1,1 i get
0,0,0,0,0,1,1,1,1,1,1,1,0,0,1,1
Firstly, I apologize if this is the wrong section to post, not sure where in homework help for logic is suppose to be post.
Otherwise, I have no idea how to approach this problem, I just make an equation and hope and pray it matches the results of S, or try and keep adding statements to bring...
Homework Statement
Recall that the Boolean addition is defined by the rule
x XOR y = xy' OR x'y. Consider the Boolean function in four variables w, x, y, z
defined by the formula f = w XOR y XOR xz XOR wxz XOR wyz XOR xyz XOR wxyz.
A Karnaugh map method must be used to find all simple...
i don't understand how i can find a statement in given truth table.
p | q | r | S |
==========
T | T | T | F|
T |T | F | T |
T | F | T | T |
T | F | F | F |
F | T | T | T |
F | T | F | F |
F | F | T | T |
F | F | F | F |
please help me.
I need to find the formula involving \neg, \wedge or \vee for the following truth table with the variables P and Q:
P Q formula
F F F
F T T
T F T
T T F
The closest I've gotten is something like P\vee(\negP\wedgeQ) which clearly doesn't work for the last row. Any ideas?
Wasn't sure of where the most appropriate place would be for this post.
If you have a truth table, say for inclusive OR, then you get a
sums-of-products expression:
(A * B^c) + (A^c * B) + (A * B)
From this, how could I arrive at the following:
A + B = ((A + B)^c)^c = (A^c * B^c)^c...