A4.8 B4.10

Logic, Computation and Set Theory | Part II, 2003

Write an essay on propositional logic. You should include all relevant definitions, and should cover the Completeness Theorem, as well as the Compactness Theorem and the Decidability Theorem.

[You may assume that the set of primitive propositions is countable. You do not need to give proofs of simple examples of syntactic implication, such as the fact that ppp \Rightarrow p is a theorem or that pqp \Rightarrow q and qrq \Rightarrow r syntactically imply prp \Rightarrow r.]

Typos? Please submit corrections to this page on GitHub.