Exam 4: Monadic Predicate Logic
Exam 1: Introducing Logic40 Questions
Exam 2: Propositional Logic: Syntax and Semantic248 Questions
Exam 3: Inference in Propositional Logic308 Questions
Exam 4: Monadic Predicate Logic306 Questions
Exam 5: Full First-Order Logic300 Questions
Select questions type
determine whether the given argument is valid or invalid. If it is valid, provide a derivation of the conclusion from the premises. If it is invalid, provide a counterexample.
-1. (∃x)(Jx • ∼Kx) ⊃ (∃x)(Lx • Mx)
2. (∃x)(Jx • Lx)
3. ∼(∃x)(Jx • Kx) / ∼(∀x)(Lx ⊃ ∼Mx)
(Essay)
4.8/5
(37)
determine whether the given argument is valid or invalid. If it is invalid, select a counterexample.
-1. (∃x)[(Dx • Ex) • Fx]
2) (∀x)[(Dx • Fx) ⊃ ∼Gx] / (∃x)(Ex • ∼Gx)
(Multiple Choice)
4.7/5
(32)
use:
b: Berkeley h: Hume
Ax: x is an apriorist
Cx: x is consistent
Ex: x is an empiricist
Ix: x is an idealist
Px: x is a person
Rx: x is a rationalist
Sx: x is a skeptic
Tx: x is a theist
-Berkeley is an empiricist and Hume is not an apriorist.
(Short Answer)
4.8/5
(40)
derive the conclusions of each of the following arguments using the rules of inference for M, including conditional or indirect proof.
-1. (∀x)(Jx ⊃ Kx)
2. (∀x)(Jx ⊃ ∼Lx) / (∀x)[Jx ⊃ (Kx • ∼Lx)]
(Essay)
4.9/5
(43)
use:
b: Berkeley h: Hume
Ax: x is an apriorist
Cx: x is consistent
Ex: x is an empiricist
Ix: x is an idealist
Px: x is a person
Rx: x is a rationalist
Sx: x is a skeptic
Tx: x is a theist
-All idealists are apriorists, but not theists.
(Short Answer)
4.9/5
(38)
select a counterexample for the given invalid argument.
-1. (∃x)(∼Ax ≡ Cx)
2) (∃x)(Ax • Cx)
3) (∀x)(Bx ⊃ Ax) / (∀x)(Cx ⊃ Bx)
(Multiple Choice)
4.7/5
(44)
provide a conterexample in a finite domain to each given invalid argument.
-1. (∃x)Sx
2. (∀x)[Sx ⊃ (Tx ⊃ ∼Ux)]
3. Ua • Ub
4. (∃x)∼Ux / (∃x)(Sx • ∼Tx)
(Essay)
4.8/5
(39)
Translate each of the following sentences into predicate logic, using the given constants and predicates.
-Some cherries are red. (Cx: x is a cherry; Rx: x is red)
(Short Answer)
4.9/5
(36)
refer to the following formula: (∃x)[Mx • (∼Nc ∼Ox)] ≡ (Py • Pb)
-What is the main operator of the given formula?
(Short Answer)
4.9/5
(41)
refer to the following formula: (∀x)[(Ex Fx) ⊃ (Gx • Hd)]
-Which wffs below are not in the scope of '(∀x)'?
(Multiple Choice)
4.8/5
(37)
determine whether the given argument is valid or invalid. If it is valid, provide a derivation of the conclusion from the premises. If it is invalid, provide a counterexample.
-1. (∃x)[Ax • (Bx Cx)]
2. (∀x)(Bx ⊃ ∼Cx)
3. (∃x)Bx
4. Ca / (∃x)(Ax • Cx)
(Essay)
4.9/5
(31)
For each of the following sentences, select the best translation into predicate logic, using the given constants and predicates.
-Izzy takes linear algebra only if she does not take discrete mathematics.
(Multiple Choice)
4.9/5
(36)
For each of the following sentences, select the best translation into predicate logic, using the given constants and predicates.
-Bonita doesn't study law; she's pre-med.
(Multiple Choice)
4.9/5
(43)
For each of the following sentences, select the best translation into predicate logic, using the given constants and predicates.
-Farzona's dropping art history is a sufficient condition for her being unhappy.
(Multiple Choice)
4.8/5
(39)
refer to the following formula:
∼(∀x){(Ix • Jx) ⊃ [Kx ≡ (La • Lb)]}
-Is the formula open or closed?
(Multiple Choice)
4.8/5
(40)
If anything is stuck in traffic, Bruno will be mad if it is late. Something is neither annoyed nor not late. If Bruno is mad, then something is annoyed. So something is not stuck in traffic.
-Which of the following claims can also be derived from the premises of this argument?
(Multiple Choice)
4.8/5
(35)
For each of the following sentences, select the best translation into predicate logic, using the given constants and predicates.
-Some visitors did not stay for dinner.
(Multiple Choice)
4.8/5
(40)
use the given interpretations to translate each sentence of predicate logic into natural, English sentences.
f: Fifi
g: Gigi
Px: x is a poodle
Qx: x is abused
Rx: x is loved
Sx: x will fetch balls
Tx: x will fetch sticks.
-(∀x)(Px ⊃ Qx) ⊃ (∃x)(Px • ∼Rx)
(Essay)
4.9/5
(36)
Translate each of the following sentences into predicate logic, using the given constants and predicates.
-No humans don't have a mother. (Hx: x is a human; Mx: x has a mother)
(Short Answer)
4.8/5
(34)
refer to the following formula: (∃x)[(Ax • ∼Bx) • ∼(Cx Dx)]
-Which of the following variables in the formula are free?
(Multiple Choice)
5.0/5
(43)
Showing 161 - 180 of 306
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)