The sequent calculus is based on the notation $\Gamma \Rightarrow \Delta$ (or $\Gamma \vdash \Delta$), with $\Gamma, \Delta$ finite (possibly empty) sequences of formulas, called a _sequent_.
The _intuitionistic_ sequent calculus is obtained with the restriction that $\Delta$ consists of at most one formula.
For the _semantics_ for sequents, see Gaisi Takeuti, Proof Theory (2nd ed - 1987), page 9:
> intuitively a _sequent_ $\gamma_1, \ldots, \gamma_m \vdash \delta_1, \ldots, \delta_n$ means :
>
>> "if $\gamma_1 \land \ldots \land \gamma_m$, then $\delta_1 \lor \ldots \lor \delta_n$".
Then we have [page 41] :
> A sequent $\Gamma \vdash \Delta$ is _satisfied_ [in an interpretation $\mathfrak I$] if either some formula in $\Gamma$ is not satisfied by $\mathfrak I$, or some formula in $\Delta$ is satisfied by $\mathfrak I$. A sequent is _valid_ it it satisfied in every interpretation.