Question 1

(x)~Fx is logically equivalent to ~($x)Fx.

Accepted Answer

A) True 
 B)False  True

Question 2

Symbols list
You may use the list below to copy-and-paste symbols into your answer as needed. →;↔;•;~;⋁;\;≠;$
Symbolize this statement using the scheme of abbreviation provided: All that glitters is not gold. (Gx: x
glitters; Hx: x is gold)

Accepted Answer

($x)(Gx • ~Hx)

Question 3

Symbols list
You may use the list below to copy-and-paste symbols into your answer as needed. →;↔;•;~;⋁;\;≠;$
Symbolize this statement using the scheme of abbreviation provided: If everyone is a saint, Al Capone is.
(Px: x is a person; Sx: x is a saint; a: Al Capone)

Accepted Answer

(x)(Px → Sx) → Sa

Question 4

Symbols list
You may use the list below to copy-and-paste symbols into your answer as needed.
→;↔;•;~;⋁;\;≠;$
Symbolize the following, using the scheme of abbreviation provided: No philosopher except Nietzsche
revels in paradox. (Px: x is a philosopher; n: Nietzsche; Rx: x revels in paradox)

Accepted Answer

(Pn • Rn)

Question 5

From (x)($y)(Fx ↔ Gxy) we may validly infer

Accepted Answer

A)  ($y)(Fa ↔ Gay). 
B)  (x)(Fx ↔ Gxa). 
C)  ($y)(Fy ↔ Gyy). 
D)  ($y)(Fa ↔ Gxy). 
A)  ($y)(Fa ↔ Gay). 
B)  (x)(Fx ↔ Gxa). 
C)  ($y)(Fy ↔ Gyy). 
D)  ($y)(Fa ↔ Gxy).

Question 6

Symbols list
You may use the list below to copy-and-paste symbols into your answer as needed.
→;↔;•;~;⋁;\;≠;$
Symbolize the following, using the scheme of abbreviation provided: At least one thing is older than
everything but itself. (Oxy: x is older than y)

Accepted Answer

($x)[~Oxx

Question 7

Fa • Ga is an instantiation (by UI) of (x)Fx • Gx.

Accepted Answer

A) True 
 B)False

Question 8

When using CP or RAA, UG may not be employed under which of the following conditions?

Accepted Answer

A)  The instantial constant occurs in the assumption. 
B)  The instantial constant occurs in any line of the proof. 
C)  The instantial constant occurs in the last line of the proof. 
D)  The conclusion of the argument is a conditional. 
A)  The instantial constant occurs in the assumption. 
B)  The instantial constant occurs in any line of the proof. 
C)  The instantial constant occurs in the last line of the proof. 
D)  The conclusion of the argument is a conditional.

Question 9

In predicate logic, Na is a

Accepted Answer

A)  statement. 
B)  individual constant. 
C)  statement function. 
D)  individual variable. 
A)  statement. 
B)  individual constant. 
C)  statement function. 
D)  individual variable.

Question 10

The relation "being married to" is

Accepted Answer

A)  symmetrical. 
B)  nonsymmetrical. 
C)  transitive. 
D)  reflexive. 
A)  symmetrical. 
B)  nonsymmetrical. 
C)  transitive. 
D)  reflexive.

Question 11

Symbols list
You may use the list below to copy-and-paste symbols into your answer as needed. →;↔;•;~;⋁;\;≠;$
Symbolize this statement using the scheme of abbreviation provided: Some people don't know when to
quit. (Px: x is a person; Qx: x knows when to quit)

Accepted Answer

The answer of Symbols list
You may use the list below...

Question 12

~Hx is an instance of (x)~Hx.

Accepted Answer

A) True 
 B)False

Question 13

An individual constant is a capital letter that designates a property.

Accepted Answer

A) True 
 B)False

Question 14

Symbols list
You may use the list below to copy-and-paste symbols into your answer as needed.
→;↔;•;~;⋁;\;≠;$
Symbolize the following, using the scheme of abbreviation provided: Spiderman is the best superhero. (s:
Spiderman; Bxy: x is better than y; Hx: x is a superhero)

Accepted Answer

Hs • (x)[(

Question 15

From Fc • Bc we can validly infer ($x)(Fx • Bc) using Existential Generalization.

Accepted Answer

A) True 
 B)False

Question 16

An algorithm is a precisely described finite procedure for solving a problem.

Accepted Answer

A) True 
 B)False

Question 17

Where Lxy: x loves y, "Everyone loves someone" is best symbolized as

Accepted Answer

A)  (x)(y)Lxy. 
B)  ($x)(y)Lxy. 
C)  ($x)(y)Lyx. 
D)  (x)($y)Lxy. 
A)  (x)(y)Lxy. 
B)  ($x)(y)Lxy. 
C)  ($x)(y)Lyx. 
D)  (x)($y)Lxy.

Question 18

The finite universe method is an algorithm for proving that an argument in predicate logic is valid.

Accepted Answer

A) True 
 B)False

Question 19

The inference from a = b and Fa to Fb is permitted by

Accepted Answer

A)  symmetry. 
B)  identity. 
C)  transitivity. 
D)  Leibniz's law. 
A)  symmetry. 
B)  identity. 
C)  transitivity. 
D)  Leibniz's law.

Question 20

"There is one and only one President of the United States " can best be symbolized (Pxy: x is a president of y; u: the United States) as

Accepted Answer

A)  ($x)(Pxu • (y)(Pyu → y = x)). 
B)  (x)(y)(Pxu → ~Pyu). 
C)  ($x)Pxu • (x)(y)((Pxu • Pyu) → x = y). 
D)  (x)(Pxu • (y)(~y = x → ~Pyu)). 
A)  ($x)(Pxu • (y)(Pyu → y = x)). 
B)  (x)(y)(Pxu → ~Pyu). 
C)  ($x)Pxu • (x)(y)((Pxu • Pyu) → x = y). 
D)  (x)(Pxu • (y)(~y = x → ~Pyu)).

(x)~Fx is logically equivalent to ~($x)Fx.

Symbols list You may use the list below to copy-and-paste symbols into your answer as needed. →;↔;•;~;⋁;\;≠;$ Symbolize this statement using the scheme of abbreviation provided: All that glitters is not gold. (Gx: x glitters; Hx: x is gold)

Symbols list You may use the list below to copy-and-paste symbols into your answer as needed. →;↔;•;~;⋁;\;≠;$ Symbolize this statement using the scheme of abbreviation provided: If everyone is a saint, Al Capone is. (Px: x is a person; Sx: x is a saint; a: Al Capone)

From (x)($y)(Fx ↔ Gxy) we may validly infer

Symbols list You may use the list below to copy-and-paste symbols into your answer as needed. →;↔;•;~;⋁;\;≠;$ Symbolize the following, using the scheme of abbreviation provided: At least one thing is older than everything but itself. (Oxy: x is older than y)

Fa • Ga is an instantiation (by UI) of (x)Fx • Gx.

When using CP or RAA, UG may not be employed under which of the following conditions?

In predicate logic, Na is a

The relation "being married to" is

Symbols list You may use the list below to copy-and-paste symbols into your answer as needed. →;↔;•;~;⋁;\;≠;$ Symbolize this statement using the scheme of abbreviation provided: Some people don't know when to quit. (Px: x is a person; Qx: x knows when to quit)

~Hx is an instance of (x)~Hx.

An individual constant is a capital letter that designates a property.

Symbols list You may use the list below to copy-and-paste symbols into your answer as needed. →;↔;•;~;⋁;\;≠;$ Symbolize the following, using the scheme of abbreviation provided: Spiderman is the best superhero. (s: Spiderman; Bxy: x is better than y; Hx: x is a superhero)

From Fc • Bc we can validly infer ($x)(Fx • Bc) using Existential Generalization.

An algorithm is a precisely described finite procedure for solving a problem.

Where Lxy: x loves y, "Everyone loves someone" is best symbolized as

The finite universe method is an algorithm for proving that an argument in predicate logic is valid.

The inference from a = b and Fa to Fb is permitted by

"There is one and only one President of the United States " can best be symbolized (Pxy: x is a president of y; u: the United States) as

Basic Concepts

Identifying Arguments

Logic and Language

Informal Fallacies

Categorical Logic: Statements

Categorical Logic: Syllogisms

Statement Logic: Truth Tables

Statement Logic: Proofs

Inductive Logic

Filters

Exam 9: Predicate Logic

(x)~Fx is logically equivalent to ~($x)Fx.

Symbols list You may use the list below to copy-and-paste symbols into your answer as needed. →;↔;•;~;⋁;\;≠;$ Symbolize this statement using the scheme of abbreviation provided: All that glitters is not gold. (Gx: x glitters; Hx: x is gold)

Symbols list You may use the list below to copy-and-paste symbols into your answer as needed. →;↔;•;~;⋁;\;≠;$ Symbolize this statement using the scheme of abbreviation provided: If everyone is a saint, Al Capone is. (Px: x is a person; Sx: x is a saint; a: Al Capone)

From (x)($y)(Fx ↔ Gxy) we may validly infer

Symbols list You may use the list below to copy-and-paste symbols into your answer as needed. →;↔;•;~;⋁;\;≠;$ Symbolize the following, using the scheme of abbreviation provided: At least one thing is older than everything but itself. (Oxy: x is older than y)

Fa • Ga is an instantiation (by UI) of (x)Fx • Gx.

When using CP or RAA, UG may not be employed under which of the following conditions?

In predicate logic, Na is a

The relation "being married to" is

Symbols list You may use the list below to copy-and-paste symbols into your answer as needed. →;↔;•;~;⋁;\;≠;$ Symbolize this statement using the scheme of abbreviation provided: Some people don't know when to quit. (Px: x is a person; Qx: x knows when to quit)

~Hx is an instance of (x)~Hx.

An individual constant is a capital letter that designates a property.

Symbols list You may use the list below to copy-and-paste symbols into your answer as needed. →;↔;•;~;⋁;\;≠;$ Symbolize the following, using the scheme of abbreviation provided: Spiderman is the best superhero. (s: Spiderman; Bxy: x is better than y; Hx: x is a superhero)

From Fc • Bc we can validly infer ($x)(Fx • Bc) using Existential Generalization.

An algorithm is a precisely described finite procedure for solving a problem.

Where Lxy: x loves y, "Everyone loves someone" is best symbolized as

The finite universe method is an algorithm for proving that an argument in predicate logic is valid.

The inference from a = b and Fa to Fb is permitted by

"There is one and only one President of the United States " can best be symbolized (Pxy: x is a president of y; u: the United States) as

Basic Concepts

Identifying Arguments

Logic and Language

Informal Fallacies

Categorical Logic: Statements

Categorical Logic: Syllogisms

Statement Logic: Truth Tables

Statement Logic: Proofs

Inductive Logic

Filters