Consistent set of formulae

A set $S$ is syntactically consistent when $S/⊢\perp$. Equivalently in classical logic, there is no formula $\phi$ for which both $S⊢\phi$ and $S⊢\neg \phi$.