construct proofs (in the same fashion that was demonstrated in the video lectures)
to show that the following sequents are valid.
1. (–q --> –p), p ⊢ q
2. (p --> (m --> r), m ⊢ p--> r
3. w--> (s--> (b--> r)) ⊢b--> (w--> (s--> r))
4. –t--> –r ⊢ r--> t

is there answer choices?

7.3

step-by-step explanation:

, and

for

step-by-step explanation:

we can analyze the pattern at which the terms increase. let us denote , , , so that we can call

note the following:

the pattern: to get the next term value, we just add the next term number (e.g. 1st, 2nd, to the previous term value (term values are the given numbers in the question, 1, 3, 6, 10, 15,

from , to get to , we add

from , to get to , we add

etc.

we need to form a recursive formula, a formula that has the next term as a function of the previous term. so a possible recursive formula can be

, and for

c > -10.55

step-by-step explanation: