21.01.2015 Views

Elementary Logic

Elementary Logic

Elementary Logic

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Consistency<br />

Lemma<br />

A set Γ of propositions is consistent if there exists some<br />

proposition B such that the sequent Γ ⊢ B is not provable.<br />

Otherwise, Γ is inconsistent; e.g., {A, ¬(A ∨ B)} is inconsistent.<br />

For System ND, a set Γ of propositions is inconsistent if and only if<br />

there is some proposition A such that both Γ ⊢ A and Γ ⊢ ¬A are<br />

provable.<br />

Theorem<br />

For System ND, a set Γ of propositions is satisfiable if and only if Γ is<br />

consistent.<br />

Yih-Kuen Tsay (SVVRL @ IM.NTU) <strong>Elementary</strong> <strong>Logic</strong> FLOLAC 2011 33 / 64

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!