The class offers an introduction to logic as a tool for rational inquiry and abstract thinking, and as a foundation of computer science. Students get exposure to logical languages, such as those of propositional logic and first-order logic, as well as languages of specific theories, such as arithmetic and set theory, and learn how to express concepts in this languages. Students learn how to build models and proofs, both manually and using software tools, thus acquiring a solid understanding of the notions of satisfiability and validity that capture truth in logic.
The language of propositional logic: atoms, connectives, sentences. The language of first-order logic: constant symbols, function symbols, and predicate symbols. Methods of proof, interpretations and models for propositional reasoning. The language of first-order logic: variable symbols, quantifiers, formulas, sentences. Methods of proof, interpretations and models for reasoning with quantifiers. Set theory. Arithmetic. Induction principles. Horn logic. Resolution, Skolemization, and unification. Completeness and incompleteness.
|Dave Barker-Plummer & Jon Barwise & John Etchemendy||Language, Proof and Logic (Edizione 2)||CSLI Publications||2011||978-1-57586-632-1|
First round: the grade is given by 25% I + 25% F + 50% H, where I is the midterm exam grade, F is the final exam grade, and H is the average of the grades in the homeworks. For the first round, all grades will be registered; however, it is possible to withdraw by informing the instructor.
Later rounds: the grade is given by 100% P, where P is a written exam, as hard as midterm, final, and homeworks combined.
Note: Attending all classes is crucial, however attendance or lack thereof does not determine different exam rules.
Strada le Grazie 15
VAT number 01541040232
Italian Fiscal Code 93009870234
© 2020 | Verona University | Credits