Using the predicate symbols shown and appropriate

What is the truth value of each of the following wffs in the interpretation where the domain consists of the integers, O(x) is x is odd, L(x) is x < 10, and G(x) is x > 9? a. (E x)O(x) c. (E x)[L(x) ` G(x)] b. (4x)[L(x) S O(x)] d. (4x)[L(x) ~ G(x)]

What is the truth value of each of the following wffs in the interpretation where the domain consists of the integers, A(x) is x < 5 and B(x) is x < 7? a. (E x)A(x) c. (4x)[A(x) S B(x)] b. (E x)[A(x) ` B(x)] d. (4x)[B(x) S A(x)]

What is the truth value of each of the following wffs in the interpretation where the domain consists of the integers? a. (4x)(E y)(x + y = x) e. (4x)(4y)(x < y ~ y < x) b. (E y)(4x)(x + y = x) f. (4x)[x < 0 S (E y)( y > 0 ` x + y = 0)] c. (4x)(E y)(x + y = 0) g. (E x)(E y)(x2 = y) d. (E y)(4x)(x + y = 0) h. (4x)(x2 > 0)

What is the truth value of each of the following wffs in the interpretation where the domain consists of the real numbers? a. (4x)(E y)(x = y2 ) c. (E x)(4y)(x = y2 ) b. (4x)(4y)(x = y2 ) d. (E x)(E y)(x = y2 )

Give the truth value of each of the following wffs in the interpretation where the domain consists of the states of the United States, Q(x, y) is x is north of y, P(x) is x starts with the letter M, and a is Massachusetts. a. (4x)P(x) b. (4x)(4y)(4z)[Q(x, y) ` Q( y, z) S Q(x, z)] c. (E y)(E x)Q( y, x) d. (4x)(E y)[P( y) ` Q(x, y)] e. (E y)Q(a, y) f. (E x)[P(x) ` Q(x, a)]

Give the truth value of each of the following wffs in the interpretation where the domain consists of people, M(x, y) is x is the mother of y, F(x) is x is female, M(x) is x is male. a. (4x)(E y)(M( y, x)) d. (E x)(E y)(M(x, y) ` M( y)) b. (E x)(4y)(M(x, y)) e. (E x)(4y)(M(x, y) S F( y)) c. (4x)(4y)(M(x, y) S M( y))

For each wff, find an interpretation in which it is true and one in which it is false. a. \((\forall x)([A(x) \vee B(x)] \wedge [A(x) \wedge B(x)]^\prime\) b. \((\forall x)(\forall y)[P(x,y) \rightarrow P(y,x)]\) c. \((\forall x)[P(x) \rightarrow (\exists y) Q (x,y)]\)

For each wff, find an interpretation in which it is true and one in which it is false. a. (E x)[A(x) ` (4y)B(x, y)] b. [(4x)A(x) S (4x)B(x)] S (4x)[A(x) S B(x)] c. (E x)[P(x) ~ Q(x)] ` (4x)[P(x) S Q(x)]

Identify the scope of each of the quantifiers in the following wffs and indicate any free variables. a. \((\forall x)[P(x) \rightarrow Q(y)]\) b. \((\exists x)[A(x) \wedge(\forall y) B(y)]\) c. \((\exists x)[(\forall y) P(x, y) \wedge Q(x, y)]\) d. \((\exists x)(\exists y)[A(x, y) \wedge B(y, z) \rightarrow A(a, z)]\)

Explain why each of the following expressions is written incorrectly. a. (E )(Q(x) ` P(x) b. (4y)(Q( y) P( y)) c. (4x)(4y)Q(x) S P( y)

Which of the following sentences are equivalent to the statement All circles are round. a. If its round, its a circle. b. Roundness is a necessary property of circles. c. Something that isnt round cant be a circle. d. Some round things are circles.

Which of the following sentences are equivalent to the statement Cats are smarter than dogs. a. Some cats are smarter than some dogs. b. There is a cat that is smarter than all dogs. c. All cats are smarter than all dogs. d. Only cats are smarter than dogs. e. All cats are smarter than any dog

Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) D(x): x is a day S(x): x is sunny R(x): x is rainy M: Monday T: Tuesday a. All days are sunny. b. Some days are not rainy. c. Every day that is sunny is not rainy. d. Some days are sunny and rainy. 52 Formal Logic e. No day is both sunny and rainy. f. It is always a sunny day only if it is a rainy day. g. No day is sunny. h. Monday was sunny; therefore, every day will be sunny. i. It rained both Monday and Tuesday. j. If some day is rainy, then every day will be sunny.

Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) B(x): x is a ball R(x): x is round S(x): x is a soccer ball a. All balls are round. b. Not all balls are soccer balls. c. All soccer balls are round. d. Some balls are not round. e. Some balls are round but soccer balls are not. f. Every round ball is a soccer ball. g. Only soccer balls are round balls. h. If soccer balls are round, then all balls are round.

Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) M(x): x is a man W(x): x is a woman T(x): x is tall a. All men are tall. b. Some women are tall. c. All men are tall but no woman is tall. d. Only women are tall e. No man is tall. f. If every man is tall, then every woman is tall. g. Some woman is not tall. h. If no man is tall, then some woman is not tall

Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) A(x): x is an animal B(x): x is a bear H(x): x is hungry W(x): x is a wolf a. Bears are animals. b. No wolf is a bear. Section 1.3 Quantifiers, Predicates, and Validity 53 c. Only bears are hungry. d. If all wolves are hungry, so are bears. e. Some animals are hungry bears. f. Bears are hungry but some wolves are not. g. If wolves and bears are hungry, so are all animals. h. Some wolves are hungry but not every animal is hungry.

Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) P(x): x is a person T(x): x is a time F(x, y): x is fooled at y a. You can fool some of the people all of the time. b. You can fool all of the people some of the time. c. You cant fool all of the people all of the time

Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) L(x): x is a lion R(x): x roars P(x): x is a predator Z(x): x is a zebra E(x, y): x eats y a. All lions are predators. b. Some lions roar. c. Only lions roar. d. Some lions eat all zebras. e. All lions eat all zebras

Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) G(x): x is a game M(x): x is a movie F(x, y): x is more fun than y a. Any movie is more fun than any game. b. No game is more fun than every movie. c. Only games are more fun than movies. d. All games are more fun than some movie

Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) C(x): x is a child T(x): x is a toy 54 Formal Logic V(x): x is a vegetable W(x, y): x wants y a. Every child wants toys. b. Only children want toys. c. Some child wants only toys. d. No child wants vegetables.

Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) J(x): x is a judge L(x): x is a lawyer W(x): x is a woman C(x): x is a chemist A(x, y): x admires y a. There are some women lawyers who are chemists. b. No woman is both a lawyer and a chemist. c. Some lawyers admire only judges. d. All judges admire only judges. e. Only judges admire judges. f. All women lawyers admire some judge. g. Some women admire no lawyer.

Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) C(x): x is a Corvette F(x): x is a Ferrari P(x): x is a Porsche S(x, y): x is slower than y a. Nothing is both a Corvette and a Ferrari. b. Some Porsches are slower than only Ferraris. c. Only Corvettes are slower than Porsches. d. All Ferraris are slower than some Corvettes. e. Some Porsches are slower than no Corvette. f. If there is a Corvette that is slower than a Ferrari, then all Corvettes are slower than all Ferraris

Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) B(x):x is a bee F(x): x is a flower L(x, y): x loves y a. All bees love all flowers. d. Every bee hates only flowers. b. Some bees love all flowers. e. Only bees love flowers. c. All bees love some flowers. f. Every bee loves only flowers. Section 1.3 Quantifiers, Predicates, and Validity 55 g. No bee loves only flowers. j. Every bee hates some flowers. h. Some bees love some flowers. k. Every bee hates all flowers. i. Some bees love only flowers. l. No bee hates all flowers.

Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) S(x): x is a spy novel L(x): x is long M(x): x is a mystery B(x, y): x is better than y a. All spy novels are long. b. Not every mystery is a spy novel. c. Only mysteries are long. d. Some spy novels are mysteries. e. Spy novels are better than mysteries. f. Some mysteries are better than all spy novels. g. Only spy novels are better than mysteries.

Give English language translations of the following wffs if L(x, y): x loves y H(x): x is handsome M(x): x is a man P(x): x is pretty W(x): x is a woman j: John k: Kathy L(x, y): x loves y a. H( j) ` L(k, j) b. (4x)[M(x) S H(x)] c. (4x)(W(x) S (4y)[L(x, y) S M( y) ` H( y)]) d. (E x)[M(x) ` H(x) ` L(x, k)] e. (E x)(W(x) ` P(x) ` (4y)[L(x, y) S H( y) ` M( y)]) f. (4x)[W(x) ` P(x) S L( j, x)]

Give English language translations of the following wffs if M(x): x is a man W(x): x is a woman i: Ivan p: Peter W(x, y): x works for y a. (E x)(W(x) ` (4y)(M( y) S [W(x, y)])) b. (4x)[M(x) S (E y)(W( y) ` W(x, y))] c. (4x)[M(x) S (4y)(W(x, y) S W( y))] 56 Formal Logic d. (4x)(4y)(M(x) ` W( y, x) S W( y)) e. W(i, p) ` (4x)[W( p, x) S (W(x))]) f. (4x)[W(x, i) S (W(x))]

Three forms of negation are given for each statement. Which is correct? a. Some people like mathematics. 1. Some people dislike mathematics. 2. Everybody dislikes mathematics. 3. Everybody likes mathematics. b. Everyone loves ice cream. 1. No one loves ice cream. 2. Everyone dislikes ice cream. 3. Someone doesn’t love ice cream. c. All people are tall and thin. 1. Someone is short and fat. 2. No one is tall and thin. 3. Someone is short or fat. d. Some pictures are old or faded. 1. Every picture is neither old nor faded. 2. Some pictures are not old or faded. 3. All pictures are not old or not faded.

Three forms of negation are given for each statement. Which is correct? a. Nobody is perfect. 1. Everyone is imperfect. 2. Everyone is perfect. 3. Someone is perfect. b. All swimmers are tall. 1. Some swimmer is not tall. 2. There are no tall swimmers. 3. Every swimmer is short. c. Every planet is cold and lifeless. 1. No planet is cold and lifeless. 2. Some planet is not cold and not lifeless. 3. Some planet is not cold or not lifeless. d. No bears are hungry. 1. Only bears are hungy. 2. All bears are hungry. 3. There is a hungry bear. 29. Write the negation of each of the following statements. a. Some Web sites feature audio. b. Every Web site has both audio and video. c. Every Web site has either audio or video. Section 1.3 Quantifiers, Predicates, and Validity 57 d. Some Web sites have neither audio nor video. e. Every Web site either has text or else has both audio and video.

Write the negation of each of the following statements. a. Only students eat pizza. b. Every student eats pizza c. Some students eat only pizza.

Write the negation of each of the following statements. a. Some farmer grows only corn. b. All farmers grow corn. c. Corn is grown only by farmers.

Write the negation of each of the following statements. a. Some farmer grows only corn. b. All farmers grow corn. c. Corn is grown only by farmers.

Write the negation of each of the following statements a. Some child fears all clowns. b. Some children fear only clowns. c. No clown fears any child

Explain why each wff is valid. a. (4x)(4y)A(x, y) 4 (4y)(4x)A(x, y) b. (E x)(E y)A(x, y) 4 (E y)(E x)A(x, y) c. (E x)(4y)P(x, y) S (4y)(E x)P(x, y) d. A(a) S (E x)A(x) e. (4x)[A(x) S B(x)] S [(4x)A(x) S (4x)B(x)]

Give interpretations to prove that each of the following wffs is not valid: a. (E x)A(x) ` (E x)B(x) S (E x)[A(x) ` B(x)] b. (4x)(E y)P(x, y) S (E x)(4y)P(x, y) c. (4x)[P(x) S Q(x)] S [(E x)P(x) S (4x)Q(x)] d. (4x)[A(x)] 4 [(4x)A(x)]

Decide whether each of the following wffs is valid or invalid. Justify your answer. a. (E x)A(x) 4 ((4x)[A(x)]) b. (4x)P(x) ~ (E x)Q(x) S (4x)[P(x) ~ Q(x)]

Decide whether each of the following wffs is valid or invalid. Justify your answer. a. \((\forall x) A(x) \rightarrow\left((\exists x)[A(x)]^{\prime}\right)^{\prime}\) b. \((\forall x)[P(x) \rightarrow Q(x)] \wedge(\exists x)[P(x) \vee Q(x)] \rightarrow(\exists x)[P(x) \wedge Q(x)]\) c. \((\forall x)[P(x) \vee Q(x)] \rightarrow(\forall x) P(x) \vee(\exists y) Q(y)\)

From Example 24c, we know that (4x)[P(x) ` Q(x)] 4 (4x)P(x) ` (4x)Q(x) is valid. From Practice 21, we know that (4x)[P(x) ~ Q(x)] 4 (4x)P(x) ~ (4x)Q(x) is not valid. From Exercise 34a, we know that (E x)[P(x) ` Q(x)] 4 (E x)P(x) ` (E x)Q(x) is not valid. Explain why (E x)[P(x) ~ Q(x)] 4 (E x)P(x) ~ (E x)Q(x) is valid.

A predicate wff is in prenex normal form if all the quantifiers appear at the front of the wff. Write each of the following expressions as an equivalent wff in prenex normal form. a. (4x)P(x) ` (4y)Q( y) b. (4x)(P(x) S (4y)[Q( y) S W(x, y)]) c. (E x)P(x) ` (E x)Q(x)