Next, we can make deductions from the given statements: P: T-most-S S-some-T P: T->R not R->not T C: ?
Now, we should look for ways to put the two premises together. We know that we can combine a Some statement and an S->N statement if they share the Sufficient condition and the arrow points away from the quantifier. This is the case here with the reverse of our first premise and our original second premise. We can combine these to make the following chain: S-some-T->R
We can simplify this to get: S-some-R. Since some statements are reversible, this also tells us: R-some-S.
Does that make sense? Please let us know if you have any other questions!