Elementary Logic
Elementary Logic
Elementary Logic
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.
Theory<br />
Assume a fixed first-order language.<br />
A set S of sentences is closed under provability if<br />
S = {A | A is a sentence and S ⊢ A is provable}.<br />
A set of sentences is called a theory if it is closed under<br />
provability.<br />
A theory is typically represented by a smaller set of sentences,<br />
called its axioms.<br />
Yih-Kuen Tsay (SVVRL @ IM.NTU) <strong>Elementary</strong> <strong>Logic</strong> FLOLAC 2011 61 / 64
Change language