Consistent set of formulae
= Consistent set of formulae
A set $S$ is syntactically consistent when $S\not\vdash\bot$. Equivalently in classical logic, there is no formula $\varphi$ for which both $S\vdash\varphi$ and $S\vdash\neg\varphi$.
= Consistent set of formulae
A set $S$ is syntactically consistent when $S\not\vdash\bot$. Equivalently in classical logic, there is no formula $\varphi$ for which both $S\vdash\varphi$ and $S\vdash\neg\varphi$.