subject
Computers and Technology, 18.02.2021 21:30 jjgccc

Determine and prove whether an argument in English is valid or invalid. Prove whether each argument is valid or invalid. First find the form of the argument by defining predicates and expressing the hypotheses and the conclusion using the predicates. If the argument is valid, then use the rules of inference to prove that the form is valid. If the argument is invalid, give values for the predicates you defined for a small domain that demonstrate the argument is invalid.
The domain for each problem is the set of students in a class.

Example 1:
Every student on the honor roll received an A.
No student who got a detention received an A.
No student who got a detention is on the honor roll.
Example 1
H(x): x is on the honor roll
A(x): x received an A.
D(x): x got a detention.
∀x (H(x) → A(x))
¬∃x (D(x) ∧ A(x))
∴ ¬∃x (D(x) ∧ H(x))
Valid.
1. ∀x (H(x) → A(x)) Hypothesis
2. c is an arbitrary element Element definition
3. H(c) → A(c) Universal instantiation, 1, 2
4. ¬∃x (D(x) ∧ A(x)) Hypothesis
5. ∀x ¬(D(x) ∧ A(x)) De Morgan's law, 4
6. ¬(D(c) ∧ A(c)) Universal instantiation, 2, 5
7. ¬D(c) ∨ ¬A(c) De Morgan's law, 6
8. ¬A(c) ∨ ¬D(c) Commutative law, 7
9. ¬H(c) ∨ A(c) Conditional identity, 3
10. A(c) ∨ ¬H(c) Commutative law, 9
11. ¬D(c) ∨ ¬H(c) Resolution, 8, 10
12. ¬(D(c) ∧ H(c)) De Morgan's law, 11
13. ∀x ¬(D(x) ∧ H(x)) Universal generalization, 2, 12
14. ¬∃x (D(x) ∧ H(x)) De Morgan's law, 13

Example 2:
No student who got an A missed class.
No student who got a detention received an A.
No student who got a detention missed class.
Example 2
M(x): x missed class
A(x): x received an A.
D(x): x got a detention.
¬∃x (A(x) ∧ M(x))
¬∃x (D(x) ∧ A(x))
∴ ¬∃x (D(x) ∧ M(x))
The argument is not valid. Consider a class that consists of a single student named Frank. If M(Frank) = D(Frank) = T and A(Frank) = F, then the hypotheses are all true and the conclusion is false. In other words, Frank got a detention, missed class, and did not get an A.

Question(c): (confirmed)
Every student who missed class got a detention.
Penelope is a student in the class.
Penelope got a detention.
Penelope missed class.
M(x): x missed class
S(x): x is a student in the class.
D(x): x got a detention.

Question(d): (confirmed)
Every student who missed class got a detention.
Penelope is a student in the class.
Penelope did not miss class.
Penelope did not get a detention.
M(x): x missed class
S(x): x is a student in the class.
D(x): x got a detention.

Question(e)
Every student who missed class or got a detention did not get an A.
Penelope is a student in the class.
Penelope got an A.
Penelope did not get a detention.
M(x): x missed class
S(x): x is a student in the class.
D(x): x got a detention.
A(x): x received an A.

ansver
Answers: 1

Other questions on the subject: Computers and Technology

image
Computers and Technology, 22.06.2019 23:00, cchotshot
Is an attack that relies on guessing the isns of tcp packets
Answers: 2
image
Computers and Technology, 23.06.2019 09:30, cdavis379
:you areto design the controller for alight that functions both as an ordinary light and also as a motion activated light and alarm. a. if the manual switch s is on, then the light l is on. b. besides the manual switch, there is a motion detector, m1, which activatesthis light. c.if motion is detected but the light is on anyway because s is on, only then a secondoutput a, an alarm, is turned on. d. the disable switch, d, disables the motion activated light and alarmbut leaves manual control operation of the light using switch s.(i)read the problem statement and clearly identify the inputs and outputs for the circuit you are designing. (ii)create the truth table for this system; include the light, alarm, switch, disable, and the motion sensor.(iii)draw a schematic of this system.
Answers: 1
image
Computers and Technology, 23.06.2019 10:20, chonawilson4
Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?
Answers: 1
image
Computers and Technology, 23.06.2019 13:00, alexacarillo
In excel - calculate the actual increase/decrease from first quarter to the second quarter then subtract subtract first quarter value from second quarter total then divide result by first quarter value
Answers: 1
You know the right answer?
Determine and prove whether an argument in English is valid or invalid. Prove whether each argument...

Questions in other subjects: