Question

In: Math

Consider the following propositions: p: You get an A on the final exam. q: You do...

Consider the following propositions: p: You get an A on the final exam. q: You do every exercise assigned in this course. r: You get an A in this class. (a) Translate the statement “You will get an A in this class if you do every exercise assigned in this course or you get an A on the final.” to propositional logic, using p, q, and r. (b) Write the truth table for the statement you wrote in (a). Is the statement a tautology? If not, provide a counter example. (c) What is the negation of the statement you wrote in (a)? (d) Write the truth table for the negation. For what combination(s) of values of p, q, and r is the negation true?

Solutions

Expert Solution

if you have any more queries related to this question, you can comment below.

If you are satisfied with the answer, please give a thumbs up. Thank you

Solution PYou get an A om the exam this couese do every exereise aosi an A m this class. You vey exexce an A on te final (a) You uill get an A this class assigned W this co wse ou do Treanslation: x-V P) Truth Table (VVP) (b) T F T Tt T T T F T F T T T T T ,this staliment not a No a staliment Yexat ia [Because a mo mattex ohatsove v tee caceT . Examal: pe) (yo) v (xop) TF TUL TT LL h

(C) +he stalemeut n (a) vo: natezap You will mot get an A m this class exeeise assigned m tis cowese and finale do not do uot an A m the Toranslahion: (dl) P F T F T F F T The ue ushen false all o them are false but a n trwe P,r ara true but ajand x felse P is tsuwe but a and r both arve bota asxce true but e io false p and V all thaee, Pray and e ase true FETETT 4 T D TT T - FTT


Related Solutions

Let p and q be propositions. (i) Show (p →q) ≡ (p ∧ ¬q) →F (ii.)...
Let p and q be propositions. (i) Show (p →q) ≡ (p ∧ ¬q) →F (ii.) Why does this equivalency allow us to use the proof by contradiction technique?
FOR EAICH PAIR OF PROPOSITIONS P AND Q STATE WHETHER ON NOT p=q p=(s→(p ∧¬r)) ∧...
FOR EAICH PAIR OF PROPOSITIONS P AND Q STATE WHETHER ON NOT p=q p=(s→(p ∧¬r)) ∧ ((p→(r ∨ q)) ∧ s), Q=p ∨ t
Profit-maximizing Q (quantity) and P (price) will you get a different Q and P if you...
Profit-maximizing Q (quantity) and P (price) will you get a different Q and P if you use equations 2 and 4 vs. equations 2, 3, and 5? (1) Demand: Q = 230 – 2.5P + 4*Ps + .5*I, where Ps = 2.5, I = 20. (2) Inverse demand function [P=f(Q)], holding other factors (Ps = 2.5 and I =20) constant, is, P=100-.4*Q. (3) Production: Q = 1.2*L - .004L2 + 4*K - .002K2; (4) Long Run Total Cost: LRTC =...
Let p and q be the propositions p:You drive over 65 miles per hour. q: You...
Let p and q be the propositions p:You drive over 65 miles per hour. q: You get a speeding ticket. Write these propositions using p and q and logical connectives. a) You do not drive over 65 miles per hour. b) You drive over 65 miles per hour, but you do not geta 1 speeding ticket. c) You will get a speeding ticket if you drive over 65 miles per hour. d) If you do not drive over 65 miles...
Two compound propositions p and q in propositional logic are logically equivalent if . . ..
Complete the following statements.Two compound propositions p and q in propositional logic are logically equivalent if . . ..An argument form in propositional logic is valid if . . ..A theorem is a statement that . . ..A statement that is assumed to be true is called a(n) . . ..A proof is a valid argument that . . ..
The following defines what logical property: A pair of propositions (wffs) P,Q that have the same...
The following defines what logical property: A pair of propositions (wffs) P,Q that have the same truth value under every interpretation. consistency? proposition? argument? equivalence ?
Draw a flow chart for a program that will get the name and final exam results...
Draw a flow chart for a program that will get the name and final exam results for all FBTOO15 students (474); and calculate the total scores for all students. After all results were entered, the average results would be calculated and displayed on screen.
how do you get p value
how do you get p value
Suppose P, Q and R are atomic propositions. (a) Show that the conjunction connective satisfies the...
Suppose P, Q and R are atomic propositions. (a) Show that the conjunction connective satisfies the commutative and associativity property. (b) Show that the disjunction connective satisfies the commutative and associativity property. (c) Construct a propositional form using all three atomic propositions above as well as the connectives conjunction, disjunction and conditional. (d) Construct an equivalent propositional form for (c).
The ‘Exclusive OR’ operation (also called XOR) between two propositions p and q is defined as...
The ‘Exclusive OR’ operation (also called XOR) between two propositions p and q is defined as follows: p ⊕ q = (p ∨ q) ∧ ¬(p ∧ q) Using laws of propositional logic prove the following: (i.) Exclusive OR is commutative, i.e., p ⊕ q ≡ q ⊕ p. (ii.) p ⊕ p is a contradiction. (iii.) Conjunction distributes over Exclusive OR, i.e, for any proposition r, r ∧ (p ⊕ q) ≡ (r ∧ p) ⊕ (r ∧ q)....
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT