Let the following statements be given.p= "You can vote."q = "You are under 18 years old."r = "You are from Mars."(a) Translate the following statement into symbols of formal logic.You can't vote if you are under 18 years old or you are from Mars.O (q vr) → pO¬p → (q^r)O (q^r) → pO (qvr) → pO¬p → (qVr)(b) Give the contrapositive of this statement in the symbols of formal logic.Op(q^r)O¬¬p → ¬(q V r)O¬p → ¬(q Vr)(q V r) →O(g ^r) →pp(c) Give the contrapositive in English.O If you are under 18, then you can't vote nor are you from Mars.O If you are not under 18 nor are you from Mars, then you can't vote.O If you can't vote, then you are not under 18 nor are you from Mars.O If you can vote, then you are not under 18 nor are you from Mars.O If you are not under 18 nor are you from Mars, then you can vote.

The solution is given in the below steps with proper explanation

Let the following statements be given. p= "You can vote." q= "You are under 18 years old." r = "You are from Mars." (a) Translate the following statement into symbols of formal logic. You can't vote if you are under 18 years old or you are from Mars. O (qvr) → p Op → (q^r) O(q^r) → p O (qvr) → p O-p → (q Vr) (b) Give the contrapositive of this statement in the symbols of formal logic. Op → ¬(q^r) O¬¬p → ¬(q Vr) O¬p → ¬(q vr) O-(q vr) →→P O(q^r) →→P (c) Give the contrapositive in English. O If you are under 18, then you can't vote nor are you from Mars. O If you are not under 18 nor are you from Mars, then you can't vote. O If you can't vote, then you are not under 18 nor are you from Mars. O If you can vote, then you are not under 18 nor are you from Mars. O If you are not under 18 nor are you from Mars, then you can vote.

Let the following statements be given. p= "You can vote." q= "You are under 18 years old." r = "You are from Mars." (a) Translate the following statement into symbols of formal logic. You can't vote if you are under 18 years old or you are from Mars. O (qvr) → p Op → (q^r) O(q^r) → p O (qvr) → p O-p → (q Vr) (b) Give the contrapositive of this statement in the symbols of formal logic. Op → ¬(q^r) O¬¬p → ¬(q Vr) O¬p → ¬(q vr) O-(q vr) →→P O(q^r) →→P (c) Give the contrapositive in English. O If you are under 18, then you can't vote nor are you from Mars. O If you are not under 18 nor are you from Mars, then you can't vote. O If you can't vote, then you are not under 18 nor are you from Mars. O If you can vote, then you are not under 18 nor are you from Mars. O If you are not under 18 nor are you from Mars, then you can vote.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Let p, q, and r be the propositions p: You started a new video game this week. q: You finished all its quests.r: You didn’t win the platinum trophy.Express each of these propositions as an English sentence.¬p → ¬q(p ∧ q) → (¬r)((¬p) → (¬q)) ∨ (q → (¬r))(p ∧ q) ∨ (¬q ∧ r)
Rewrite the following proposition as unambiguous English sentences. The relevant predicates are defined as follows: Again, let’s let P be a set of all people A(x) means “x is teaching the AI course” T(x) means “x is taking AI course” F(x) means “x has a twitter account.” C(x) means “x likes to read.” For example, the proposition ∃x { P [A(x)∧ C(x)]} could be translated as “There is a person who is teaching and likes to read” P [T(x) → (F(x) C(x))] ?
Translate the following statement into logical expressions using predicates, quantifiers (use the symbols ∀ and ∃) , and logical connectives (use the symbols ¬, ∧, ∨, →). Do not put spaces. Let A(x)=“x is armed” and D(x)=“x is dangerous”Some dangerous people are not armed. Let M(x)=“x is a Magna Cum Laude” No one is a Magna Cum Laude. Let S(x)=“x is a square” and R(x)=“x is a rectangle” All squares are rectangles. Let E(x)=“x is empathetic” and H(x)=“x will help you” Someone is empathetic or not everyone will help you.
Translate these statements into English, where C(x) is “x is a comedian” and F(x) is “x is funny” andthe domain consists of all people.a) ∀x(C(x) → F(x))b) ∀x(C(x) ∧ F(x))c) ∃x(C(x) → F(x))
Below are some predicates and their corresponding statements: p(x): x is a student in your class q(x): x has taken a course in logic programming Here, the domain for quantifiers consists of all people. Choose the correct proposition for the sentence: All student in your class has not taken a course in logic programming. a. ∀x¬(P(x) → Q(x)) b. ∀x(P(x) → ¬Q(x) c. ¬∀x (P(x) → Q(x)) d. ¬∃x(P(x) ∧ Q(x))
13. p(x): x is intelligent q(x): x reads book r(x): x is a student in your class Find the correct English translation for the following logical expression: ∀x(r(x)→(p(x) Λ q(x)) a. None b. There is an intelligent student in your class who reads book c. Every student in your class is intelligent and reads book d. All student in your class is intelligent and doesn't read book
a) Give an example of a string containing 11 that is accepted by the following automaton. b) Give an example of a string of length 8 that is rejected by the following automaton. c) Describe the language of this automaton in plain English. d) Describe the language of this automaton using Regular expression.
Determine whether the following is true or false. Please cite the brief explanation so that I can know why is it true or false. a) The sentence “If x > 0, then compute √π”, is as tatement. b) The compound statement p ∧(q ∨¬p )∧¬q is ac ontradiction. c) ¬( p ∨ q) ≡ ¬p ∧¬q d) 1 ∈ {{1},{2},{3}} e) Set B = {x | x ∈ ℝ and x4 =16} is finite. f) [2,4] U (3,5) is a disjoint union g) A\B = A ∩ Bc h) A X B = B X A I) {{Ø}} = 0 j) The contrapositive of p -> (p V ¬p) = (¬p∧ q) -> ¬p
S is a set of strings over the alphabet {a, b}* recursively defined as: Base case: λ ∈ S, a ∈ S, b ∈ S Recursive rules: If x ∈ S, then Rule 1: axb ∈ S Rule 2: bxa ∈ S List all the strings in S of length 3.
Blackout Math is a math puzzle in which you are given an incorrect arithmetic equation. The goal of the puzzle is to remove two of the digits and/or operators in the equation so that the resulting equation is correct. For example, given the equation 6 - 5 = 15 ^ 4/2 we can remove the digit 5 and the / operator from the right-hand side in order to obtain the correct equality 6 - 5 = 1 ^ 42. Both sides of the equation now equal to 1. Observe how removing an operator between two numbers (4 and 2) causes the digits of the numbers to be concatenated (42). Here is a more complicated example: 288 / 24 x 6 = 18 x 13 x 8 We can remove digits and operators from either side of the equals sign (either both from one side, or one on each side). In this case, we can remove the 2 from the number 24 on the left-hand side and the 1 from the number 13 on the right-hand side to obtain the correct equality 288 / 4 x 6 = 18 x 3 x 8 Both sides of the equation now equal to 432. Here is another puzzle for you…
Q2 – Proof of Correctness In this question, you will use strong induction to prove that your new algorithm works correctly. In other words, you will prove that nN xR-{0} FP(x,n) = xn a) Predicate Function Your conjecture has already been stated in symbolic form: It is a statement of the form nN, P(n) What is the predicate function P(n)? b) Proof: Base cases c) Proof: Inductive step setup This is the beginning of the inductive step where you are stating the assumptions in the inductive step and what you will be proving in that step. As you do so, identify the inductive hypothesis. d) proof: inductive steps
For the given statement below, “ For any two integers a and b, if both ab and a+b are even, then both a and b are even.” Do the following three things (Assume that E represents the even number set and O represents the odd number set) : Translate the following statement into a symbolic logic form Negate the logic form you came up with from step a), and simplify the negated form as much as you can. Give the contraposition of the logic form from step a), and translate the contraposition back to plain English (Hint: No need to change the quantifiers if any. Why?).