1. Use a truth table to find if the following is valid or not valid: p → r q → r q ˅ ¬r Therefore, ¬p
Valid
Not Valid
Discrete Math
2. Indicate whether each expression is an equivalence of the following:
p ˄ q
p ˅ q
p → q
¬(p → q)
(p ˄ q) ˅ (p ˄ q)
¬ (¬p ˅ ¬q)
3. For the given values for p, q, and r, what is the result of the following proposition. A truth table might be helpful here.
¬(r → ¬q) ˅ (p ˄ ¬r)
p=T q=T r=T
p=T q=F r=T
p=T q=F r=F
p=F q=T r=T
p=F q=F r=F
QUESTION 5 For the statement P(x,y) meaning x+2y = xy, determine if the following are true or false.
P(0,0)
P(1,-1)
ƎyP(3,y)
ɄxP(x,2)
Ʉ x ƎyP(x,y)
QUESTION 6 Indicate whether each of the following is a proposition:
3 + 2 = 9
Get your raincoat
It is raining.
57
purple
QUESTION 7
For the premises "Someone in this class passed the exam", and "Everyone in this class read the textbook" imply the conclusion "Someone that read the textbook passed the exam". If C(x) is the predicate "x is in this class", R(x) is the predicate "x has read the textbook" and P(x) is the predicate "x passed the exam", what are the reasons each of the following steps can be deemed valid:
1. Ǝx(C(x) ˄ P(x))
2. C(a) ˄ P(a)
3. C(a)
4. Ʉx(C(x) → R(x))
5. C(a) → R(a)
6. R(a)
7. P(a)
8. P(a) ˄ R(a)
9. Ǝx(P(x) ˄ R(x))
10. C(a) ˄ R(a)
A. Premise
B. Addition
C. DeMorgans Law
D. Modus Tollens
E. Modus Ponens
F. Conjunction
G. Existential Instantiation
H. Existential Generalization
I. Universal Instantiation
J. Universal Generalization
K. Simplification
QUESTION 8 Every proposition can be expressed in terms of AND, OR, and NOT. What proposition represents the following truth table?
p ˄ q
p ˅ q
p ↔ q
(p ˄ ¬q) ˅ (¬p ˄ q)
(¬p ˄ ¬q) ˅ (¬p ˄ ¬q)
QUESTION 9
Indicate whether the following are Tautologies or Contradictions:
p ˅ ¬p
p ˄ ¬p
p ˅ (q ˅ ¬q)
p ˄ (q ˄ ¬q)
((p → ¬q) ˄ q) → ¬p
QUESTION 10
For the premises "Everyone who read the textbook passed the exam", and "Ed read the textbook" imply the conclusion "Ed passed the exam". If R(x) is the predicate "x has read the textbook" and P(x) is the predicate "x passed the exam", what are the reason each of the following steps can be deemed valid:
1. Ʉx(R(x) → P(x))
2. R(Ed) → P(Ed)
3. R(Ed)
4. P(Ed)
5. R(Ed) ˄ P(Ed)
A.
Premise
B.
Conjunction
C.
Addition
D.
Simplification
E.
Modus Ponens
F.
Modus Tollens
G.
DeMorgans Law
H.
Universal Instantiation
I.
Existential Instantiation
QUESTION 11 What is the negation of the following sentence:
It is Thursday and it is cold.
It is not Thursday and it is cold.
It is Thursday and it is not cold.
It is not Thursday and it is not cold.
It is not Thursday therefore it is not cold.
It is not Thursday or it is not cold.
QUESTION 14 Match the following statements with predicates and any necessary quantifiers:
Every Razzma is a Frat.
No Razzma is a Frat.
There is at least one Razma that is a Frat
There is a Razma that every Frat.
Some Razma are Green Frat.
A.
R(x) ˄ F(x)
B.
Ʉx(R(x) → F(x))
C.
Ǝx(R(x) ˄ F(x))
D.
Ʉx(R(x) ˄ F(x))
E.
¬Ʉx(R(x) → F(x))
F.
ƎyɄx(F(x) → R(x,y))
G.
Ǝx(R(x) ˄ F(x) ˅ G(x))
H.
ƎxƎy(R(x) ˄ F(y) ˄ G(y))
I.
ƎxƎy(R(x) ˄ F(y) ˄ G(x,y))
J.
ƎxƎy(R(x) → F(y) → G(x,y))
QUESTION 15 Indicate which of the following are equivalent to: A Yes B No
If Joe is going to the game, then I am going bowling.
Joe is going to the game if I am going bowling.
I am going bowling if Joe is going to the game.
Joe is going to the game implies I am going bowling.
Joe is going to the game whenever I am going bowling.
I am going bowling whenever Joe is going to the game.
| p | q | r | ~r | p -> r | q -> r | q \/ ~r | ~p | |
| 1 | F | F | F | T | T | T | T | T |
| 2 | F | F | T | F | T | T | F | T |
| 3 | F | T | F | T | T | F | T | T |
| 4 | F | T | T | F | T | T | T | T |
| 5 | T | F | F | T | F | T | T | F |
| 6 | T | F | T | F | T | T | F | F |
| 7 | T | T | F | T | F | F | T | F |
| 8 | T | T | T | F | T | T | T | F |
As we see the hypothesis premises row 2 and row 4 are same or all true, but the row 8 is not equivalent, as we see hypothesis premises are all true but the corresponding conclusion is false,
Which implies that the following is not valid.
According to Chegg's policy, I am answering the first full question only.
Thank you.
1. Use a truth table to find if the following is valid or not valid: p...
question 13 please
Microsoft Word Fall 2019 Home X + Hamnok Fall 2019TU Disc X Microsoft Word Fall 2019 Ham: x C Gat Hamework Help With Chege x → C o O File c/Users/mduro/Downloads/Fall%202019%20Homework 2011.pclf + 11. Suppose the variable x represents students and y represents courses and: F(x): x is o freshmon [x]: x is a part-time student Tix.y]: x is taking y Write the statement in good English without using variables in your answers a. FiMikko) b. 3...
1. Use full-truth table method to check if the following argument is valid -p•(qv-I), (p=q). (qvr)>p 1: p=(-q=r) 2. Use short-cut truth table method to check if the following argument is valid p=(r v (p.-9). [=(qv(re-p)) 1:9= (pv (q.-1))
1 15 oints) Deterine if the following propositions are TRUE or FALSE. Note that p, q r are propositi Px) and P(x.y) are predicates. RUE or FALSE.Note that p, q, r are propositions. (a).TNE 1f2小5or I + 1-3, then 10+2-3or 2 + 2-4. (b).TRvE+1 0 if and only if 2+ 2 5. (d). _ p v T Ξ T, where p is a proposition and T is tautology. V x Px) is equivalent to Vx - Px) (g). ㅡㅡㅡ, y...
Directions. Determine whether the following three arguments are valid using the truth table method. Use the Indirect Truth Table method as found in the link on Canvas. Indicate whether each is valid or not. Note that ‘//’ is used as the conclusion indicator and ‘/’ is used to separate the premises. [Note: Use only the following logical symbols: ‘&’ for conjunctions, ‘v’ for disjunctions, ‘->’ for conditionals, ‘<->’ for biconditionals, ‘~’ for negations.] Show your truth tables. 1. (S <->...
1. Use a truth table in canonical form below to show that ¬p∧q and ¬p∧¬q are not equivalent. Feel free to make necessary adjustments to the table. p q p∧q ¬p ¬q ¬p∧q ¬p∧¬q 2. Tell whether the following two expressions are equivalent by constructing their truth tables in canonical form. You may make necessary adjustments to the table provided below. Is p∨q∧rlogically equivalent to p∨q∧p∨r? p q r q∧r p∨q p∨r 3. Prove or Disprove (make sure to show...
Please answer question 1 and
2.
(1) Let p, q be propositions. Construct the truth table for the following proposition: (2) Let X be the set of all students in QC and let Y be the set of all classes in the Math Department available for QC students in the Fall 2019. Leyt P(z, y) be the proposition of the course y. Write down the following propositions using quantifiers: e Some QC students read the description of each course in...
Show that the following is a valid argument. 1. y V t 2. (w V u) ^(w V x) 3. (q V r) rightarrow w 4. s V p 5. (y ^r) rightarrow x 6. (p ^q) rightarrow (t V r)
1. Use the DPP to decide whether the following sets of clauses are satisfiable. (a) {{¬Q,T},{P,¬Q},{¬Q,¬S},{¬P,¬R},{P,¬R,S},{Q,S,¬T},{¬P,S,¬T},{Q,¬S},{Q,R,T}} (b) {{¬Q,R,T},{¬P,¬R},{¬P,S,¬T},{P,¬Q},{P,¬R,S},{Q,S,¬T},{¬Q,¬S},{¬Q,T}} 2. Decide whether each of the following arguments are valid by first converting to a question of satisfiability of clauses (see the Proposition), and then using the DPP. (Note that using DPP is not the easiest way to decide validity for these arguments, so you may want to use other methods to check your answers) (a) (P → Q), (Q → R),...
You shall develop a grammar and implement a parser which
recognizes valid statements as described below in the assignment
specification. You may develop your code using C, C++.
The test file include these expressions below. The first
six should pass and the rest should fail:
first = one1 + two2 - three3 / four4 ;
second = one1 * (two2 * three3) ;
second = one1 * (two2 * three3) ;
third = ONE + twenty - three3 ;
third...
CSCI/MATH 2112 Discrete Structures I Assignment 1. Due on Friday, January 18, 11:00 pm (1) Write symbolic expression for each of the statements below; then work out their negations; finally expressing each as complete sentence in English: (a) Roses are red, violets are blue. (b) The bus is late or my watch is slow. (c) If a number is prime then it is odd or it is 2. (d) If a number x is a prime, then (root ) x...