We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure coreplatform@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Introduction to first-order Predicate Logic. Syntax and semantics, models and quantification. Implementation of “Term,” “Formula,” and “Model” objects for Predicate Logic in Python.
Gödel numbering and Gödel’s Incompleteness Theorem. Undecidability of the halting problem and how it can be used to prove Gödel’s Incompleteness Theorem.
An introduction to formal Logic and to the contrast and connections between syntax and semantics. The unique pedagogical approach of the book of capturing logic in a computer program and of proving by programming.
In this chapter we fix a specific axiomatic system and provide several examples of its formal use. These include logical inferences such as syllogisms, proofs of mathematical theorems in structures such as groups and fields, and foundations of mathematics, specifically Peano Arithmetic and Set Theory.
The semantics of propositional formulas: models and truth tables, tautologies and contradictions. Disjunctive Normal Form and the DNF Theorem. Optional: Conjunctive Normal Form and the CNF Theorem, computational search problems, satisfiability, P and NP.
Proofs by deduction in Predicate Logic. Axiom schemas and their instances. Implementation of “Schema” and “Proof” objects for Predicate Logic in Python. Use of tautologies in proofs. The Soundness Theorem for predicate logic.
An introduction to Propositional Logic, focusing on the syntax. The unique readability theorem. Implementation of a “Formula” Python object and parsing formulas.