HomeworkLib
Question

Show that the given argument is invalid by giving values for the predicates P and Q...

Show that the given argument is invalid by giving values for the predicates P and Q over the domain {a, b}.

(a)

∀x (P(x) → Q(x))
∃x ¬P(x)
∴ ∃x ¬Q(x)

(b)

∃x (P(x) ∨ Q(x))
∃x ¬Q(x)
∴ ∃x P(x)

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

ANSNER Given Tha and Goda): and Np (4) So , Thene does ot cwist a ,uch redt The given statement 2 Let pca)F and Goa) F So, p(b) v (JT esntfellma finom The guen Statement 3xCP(AN a) (x) and 3.χ (n@ (x)

0 0
Add a comment
Know the answer?
Add Answer to:
Show that the given argument is invalid by giving values for the predicates P and Q...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Formalize the following argument by using the given predicates and then rewriting the argument as a...

    Formalize the following argument by using the given predicates and then rewriting the argument as a numbered sequence of statements. Identify each statement as either a premise, or a conclusion that follows according to a rule of inference from previous statements. In that case, state the rule of inference and refer by number to the previous statements that the rule of inference used. Dogs bark at cats. Max is a dog. Moonbeam is a cat. Therefore, Max barks at Moonbeam....

  • Predicates P and Q are defined below. The domain of discourse is the set of all...

    Predicates P and Q are defined below. The domain of discourse is the set of all positive integers. P(x): x is prime Q(x): x is a perfect square (i.e., x = y2, for some integer y) Find whether each logical expression is a proposition. If the expression is a proposition, then determine its truth value. 1) ∃x Q(x) 2) ∀x Q(x) ∧ ¬P(x) 3) ∀x Q(x) ∨ P(3)

  • Predicates P and Q are defined below. The domain of discourse is the set of all...

    Predicates P and Q are defined below. The domain of discourse is the set of all positive integers. P(x): x is prime Q(x): x is a perfect square (i.e., x = y2, for some integer y) Indicate whether each logical expression is a proposition. If the expression is a proposition, then give its truth value. (c) ∀x Q(x) ∨ P(3) (d) ∃x (Q(x) ∧ P(x)) (e) ∀x (¬Q(x) ∨ P(x))

  • Find a truth assignment demonstrating this argument is invalid: m= ? n=? o=? p=? q=? 1....

    Find a truth assignment demonstrating this argument is invalid: m= ? n=? o=? p=? q=? 1. m ^ ~q 2. o -> ~(m v n) 3. ~n -> (m ^ o) 4. (~m ^ p) -> n 5. m XOR q Therefore, ~o. Prove this is invalid with truth assignments.

  • 1. Formalize the following argument by using the given predicates and then rewriting the argument...

    1. Formalize the following argument by using the given predicates and then rewriting the argument as a numbered sequence of statements. Identify each statement as either a premise, or a conclusion that follows according to a rule of inference from previous statements. In that case, state the rule of inference and refer by number to the previous statements that the rule of inference used.Lions hunt antelopes. Ramses is a lion. Ramses does not hunt Sylvester. Therefore, Sylvester is not an...

  • Determine whether the argument is valid or invalid. You may compare the argument to a standard...

    Determine whether the argument is valid or invalid. You may compare the argument to a standard form or use a truth table. p→q -p .q Is the argument valid or invalid? Invalid O Valid

  • Valid and invalid arguments expressed in logical notation. Indicate whether the argument is valid or invalid. Prove usin...

    Valid and invalid arguments expressed in logical notation. Indicate whether the argument is valid or invalid. Prove using a truth table. • p → q q → p —— ∴¬q • p → q ¬p —— ∴¬q

  • Prove that the given argument is valid. First find the form of the argument by defining...

    Prove that the given argument is valid. First find the form of the argument by defining predicates and expressing the hypotheses and the conclusion using the predicates. Then use the rules of inference to prove that the form is valid. (a) The domain is the set of musicians in an orchestra. Everyone practices hard or plays badly (or both). Someone does not practice hard. ------------------------------------------------------------ ∴ Someone plays badly.

  • 5. Symbolize the following argument and prove it is a valid argument. Let B ( x...

    5. Symbolize the following argument and prove it is a valid argument. Let B ( x ) = x is a bear; D ( x ) = x is dangerous, and H ( x ) = x is hungry. Every bear that is hungry is dangerous. There is a hungry animal that is not dangerous. Therefore there is an animal that is not a bear. 6.  In order to prove an quantificational argument invalid it is only necessary to find a...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT