13136 - Mathematical Logic (1)

Academic Year 2009/2010

  • Teaching Mode: Traditional lectures
  • Campus: Bologna
  • Corso: First cycle degree programme (L) in Philosophy (cod. 0342)

Learning outcomes

The student will know propositional calculus and first order logic. He will be able to write and understand logical propositions and to verify them.

Course contents

1. Propositional languages: syntax and semantics. Satisfiability and semantic equivalence. Syntactical methods: propositional resolution and natural deduction. Soundness and completeness. 2. First order languages. Predicates, terms, quantifiers. Syntax: free and bound variables. Interpretations. Semantics for a predicative language. Satisfiability and semantic equivalence. Prenex normal form and Skolem algorithm. 3. Mathematical induction. 4. Syntactical methods for first order. Natural deduction. Soundnes theorem. Completeness theorem. Compactness theorem. Propositional resolution; unification; first order resolution.

Readings/Bibliography

A. Asperti - A. Ciabattoni, Logica a informatica, McGraw Hill, 1997.

Teaching methods

Lectures and recitations. Lab sessions.

Assessment methods

Written exam; lab test; possible oral.

Teaching tools

Blackboard and beamer. Software Matita.

Links to further information

http://www.cs.unibo.it/~sacerdot/linguaggi

Office hours

See the website of Claudio Sacerdoti Coen