the excellent tutorial http://logitext.mit.edu/tutorial presents the negation inference rule like so:
\begin{align} \frac{\Gamma \vdash A, \Delta}{\Gamma, \lnot A \vdash \Delta} \lnot_L \end{align}
and
\begin{align} \frac{\Gamma, A \vdash \Delta}{\Gamma \vdash \lnot A, \Delta} \lnot_R \end{align}
It's elegant and reminds of algebra but I can't convince myself of the first example truthiness.
The proposition itself seems impossible A and not A implies A? Isn't the above a contradiction?
They must be understood "semantically": intuitively, a sequent $A_1,\ldots,A_m \vdash B_1,\ldots, B_n$ means: if $A_1 \land \ldots \land A_m$, then $B_1 \lor \ldots \lor B_n$.
The inference rules must be sound, i.e. they must derive true conclusion from true premises.
Consider now the first rule:
forgetting about the contexts ($\Gamma$ and $\Delta$), if the upper sequent is true in $\mathfrak I$, this means that $A$ is true, and thus $\lnot A$ is false.
The same for $(\lnot \text{right}).$