Question

In: Computer Science

Use rules of inference to show that the hypotheses p → q, r → s, and...

Use rules of inference to show that the hypotheses p → q, r → s, and ¬q ∨ ¬s implies ¬p ∨ ¬r

Expert Solution

We want to show that,pq,rs and q s implies p r.

Inorder to prove this hypothesis,we can simply uses conjunction and destructive dilemma.By using material implication which is a valid rule of replacement ,transpostion which is a valid rule of replacement and hypothetical syllogism which belongs to rule of inference can also used to prove this.Here we shows the proof to solve this hypotheses by this two way.

FIRST METHOD:

conjunction p

q

pq

Destructive syllogism pqrs

q s

p r

The table below shows the steps to prove the given hypotheses.

1	pq	Given
2	rs	Given
3	q s	Given
4	(pq)(rs)	Conjunction on 1 and 2
5	p r	Destructive dilemma on 4 and 3

SECOND METHOD:

Material implication (pq)(pq)

Transposition (pq)(q p)

Hypothetical syllogism pq

qr

pr

The table below shows the steps to prove the given hypotheses.

1	pq	Given
2	rs	Given
3	q s	Given
4	q s	Material implication on 3
5	s r	Transposition rule on 2
6	q r	Hypothetical syllogism on 4 and 5
7	p r	Hypothetical syllogism on 1 and 6
8	p r	Material implication on 7

venereology answered 2 weeks ago

Use rules of inference to show that the hypotheses “Every student in Computer science major needs...

Use rules of inference to show that the hypotheses “Every student in Computer science major needs to take CSCI2000,” “Every student who takes CSCI2000 knows how to program in JAVA” imply the conclusion “Every student in Computer science major knows how to program in JAVA.”

Prove p → (q ∨ r), q → s, r → s ⊢ p → s

Show that if P;Q are projections such that R(P) = R(Q) and N(P) = N(Q), then...

Show that if P;Q are projections such that R(P) = R(Q) and N(P) = N(Q), then P = Q.

Suppose S = {p, q, r, s, t, u} and A = {p, q, s, t}...

Suppose S = {p, q, r, s, t, u} and A = {p, q, s, t} and B = {r, s, t, u} are events. x p q r s t u p(x) 0.15 0.25 0.2 0.15 0.1 (a) Determine what must be p(s). (b) Find p(A), p(B) and p(A∩B). (c) Determine whether A and B are independent. Explain. (d) Arer A and B mutually exclusive? Explain. (e) Does this table represent a probability istribution of any random variable? Explain.

Prove the validity using laws of propositional logic and rules of inference: ∀x(P(x) → (Q(x) ∧...

Prove the validity using laws of propositional logic and rules of inference: ∀x(P(x) → (Q(x) ∧ S(x))) ∃x(P(x) ∧ R(x)) − − − − − − − − − − − − − ∴ ∃x(R(x) ∧ S(x))

FOR EAICH PAIR OF PROPOSITIONS P AND Q STATE WHETHER ON NOT p=q p=(s→(p ∧¬r)) ∧...

FOR EAICH PAIR OF PROPOSITIONS P AND Q STATE WHETHER ON NOT p=q p=(s→(p ∧¬r)) ∧ ((p→(r ∨ q)) ∧ s), Q=p ∨ t

A list of six positive integers, p, q, r, s, t, u satisfies p < q...

A list of six positive integers, p, q, r, s, t, u satisfies p < q < r < s < t < u. There are exactly 15 pairs of numbers that can be formed by choosing two different numbers from this list. The sums of these 15 pairs of numbers are: 25, 30, 38, 41, 49, 52, 54, 63, 68, 76, 79, 90, 95, 103, 117. Which sum equals r + s?

Discrete math question Prove that ¬(q→p)∧(p∧q∧s→r)∧p is a contradiction without using truth table

Suppose P, Q and R are atomic propositions. (a) Show that the conjunction connective satisfies the...

Suppose P, Q and R are atomic propositions. (a) Show that the conjunction connective satisfies the commutative and associativity property. (b) Show that the disjunction connective satisfies the commutative and associativity property. (c) Construct a propositional form using all three atomic propositions above as well as the connectives conjunction, disjunction and conditional. (d) Construct an equivalent propositional form for (c).

1. Show that the argument (a) p → q q → p therefore p...

1. Show that the argument (a) p → q q → p therefore p V q is invalid using the truth table. ( 6 marks ) (b) p → q P therefore p is invalid using the truth table. ( 6 marks ) (c) p → q q → r therefore p → r is invalid using the truth table. ( 8 marks )