21.01.2015 Views

Elementary Logic

Elementary Logic

Elementary Logic

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Compactness<br />

Theorem<br />

For any (possibly infinite) set Γ of formulae, if every finite non-empty<br />

subset of Γ is satisfiable then Γ is satisfiable.<br />

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

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

Saved successfully!

Ooh no, something went wrong!