WorksheetsPropositional Logic
Total questions: 30
Worksheet time: 42mins
Every propositions has a truth value
True
False
Which one are propositions?
3*2 = 5
He is the most handsome man.
You should get vaccine for COVID-19
There was snow in Khon Kaen yesterday.
2 is an odd number.
"Who is he?" is a proposition.
True
False
Two atomioc propositions joined by a connective to form a compound statement are known as a disjunction.
True
False
A double negation is the same thing as no negation.
True
False
The conditional statement p → q is false only when p is true and q is false.
True
False
How many rows in a truth table for a proposition with 3 atomic proposition.
3
4
8
10
What is the proposition of the following statement : "If tomorow is sunday then there will be no rain". Define p as "tomorrow is sunday", q as "there will be rain".
p→q
p∨q
p∧q
p↔q
What is the proposition of the following statement: "Mark is a math major and Mark’s sister is a computer science major.". Define p as "Mark is a math major", and q as "Mark's sister is a computer science major".
p→q
p∨q
p∧q
p↔q
What is the proposition of the following statement : "Mark is a math major or Mark’s sister is a computer science major.". Define p as "Mark is a math major", and q as "Mark's is a computer science major".
p→q
p∨q
p∧q
p↔q
Which are corrects on logically equivalent?
(p∧q)∧r ≡p∧(q∧r)
p∧T≡p
p∧∼p≡c
∼(p∧q)≡∼p∨∼q
Which are tautologies?
p→p
p∧∼p
p↔(p∧p)
p∨T
Which are contradictions?
p∧∼p
p∧c
p∨∼p
c→p
What are true about the argument?
An argument is a sequence of propositions
Each proposition before the final one is called premise
The final proposition is called the conclusion
an argument is valid if all premises are true then the conclusion is true.
How do you validate an argument?
Using truth table
Using the rules of inference
Using logical equivalence
Using set theory
When the argument is valid which one of these statement are true?
In the truth table, all conclusions are true for every critical rows.
Some of the premises can be false.
The conclusion is true using the rule of inference.
In the truth table, some of the premises are false.
Let d be “Discrete Math is difficult,” f be "Discrete Math is fun,” and n be “Disceret Math is necessary.”. Using the symbols what is the statement for "Disceret Math is fun, but it is not both difficult and necessary.
f∧∼(d∧n)
f∧d∧n
f∧∼d∧n
f∧∼d∧∼n
Let p be “x > 2,” q be “x = 2,” and r be “x > 5”. Using the defined symbols, what is the statement 2 <= x <= 5.
(p∨q)∧∼r
(p∨q)∧r
(p∧q)∧∼r
∼(p∨q)∧r
What is a contrapositive of the following statement "If the world is ending tomorrow then I will not go to school"
If I go to school then the world is not ending tomorrow.
If I do not go to school then the world is ending tomorrow.
If the world is not ending tomorrow then I will go to school
If I do not go to school then the world is not ending tomorrow.
What is the negation of the following statement? "If a butterfly lays eggs then there will be more butterfiles".
A butterfly lays eggs and there is no more butterflies.
If a butterfly lays egg then these is no more butterflies
If a butterfly does not lay egg then there is no more butterflies.
If a butterfly does not lay egg then there is more butterflies
Which of the following are tautology?
p→(q∨r)≡(p∧∼q)⟶r
p∧∼p
(p∧q)∨(∼p∨(p∧∼q))
(p∧∼q)∧(∼p∨q)
(p→r)↔(q→r)
Which of the following are contradiction ?
p→(q∨r)≡(p∧∼q)⟶r
p∧∼p
(p∧q)∨(∼p∨(p∧∼q))
(p∧∼q)∧(∼p∨q)
(p→r)↔(q→r)
Which of the following statements are true?
An argument is a sequence of propositions
Each proposition before the final one is called conclusion
The final proposition is called the premise
The argument is valid if assuming all the premises are true then the conclusion is true.
To validate an argument, we assume no premises are true.
If Ironman is a man, then Ironman is mortal
Ironman is a man
∴ Ironman is mortal
This argument is valid because of which rule of inference?
Modus ponens
Modus tollens
Hypothetical syllogism
Disjunctive syllogism
What should be put in on the red line?
Premise
Modus Ponens
Modus Tollens
Disjunctive syllogism
Dilemma proof
Which logical expression give the truth values as shown in trught table?
p∧q
p V q
p→q
~p
p↔q
Which one of the following expression are well-formed formula?
p V q
p→→q
p V V q
q ⟷ q
∼∼p→∼q
Which expression give you the following truth values in a truth table?
p→q
q→(p∧r)
p→(q∨∼r)
q V ~r
Consider the following argument:
p → q
q → p
∴p ∧ q
Which statements are true?
(a)Consider the following argument:
p
p → q
∼q∨ r
∴r
The argument is (a)
