Using the natural deduction method, how would you solve this:
Premises: $\{s, s → t\}.\quad$ Conclusion: $\{s ∧ t\}$
My proposed solution (mind you, I'm brand new at this):
$$\begin{align} s\rightarrow t &\qquad (\to \textrm{elim}) \\ t \\ s \\ s\wedge t &\qquad(\wedge\textrm{-intro}) \end{align}$$
$$ \begin{align} s\rightarrow t & &(1) \\ s & & (2) \\ t & \qquad Modus Ponens(1),(2) & (3)\\ \hline \therefore s \wedge t & \qquad Conjunction (2),(3) & (4) \end{align} $$
This is the format that my computer science course used.