Exercise · ZW-CONSISTENCY-001 · ★☆☆ Basic

A system is consistent if...

Choose one option.

Show answer
  • A. It does not prove a proposition and its negation at the same time

Explanation

A system is consistent when it does not prove a proposition and its negation at the same time. That is the definition applied here.

Open the ZWMath map →

Review the concept: Consistency

A system \(\mathcal{S}\) is consistent if there is no formula \(\varphi\) such that \(\mathcal{S}\) proves both \(\varphi\) and \(\neg\varphi\).

\[\\neg\\exists\\varphi\\,(\\mathcal{S}\\vdash\\varphi\\wedge\\mathcal{S}\\vdash\\neg\\varphi)\]

More practice problems: consistency

ZW-CONSISTENCY-002 →