There are no course dependencies

RA1.1: Knowledge and understanding of the mathematics and other basic sciences underlying their engineering specialisation, at a level necessary to achieve the other programme outcomes. CGB3: Ability to understand and master the basic concepts of discrete mathe- matics, logic, algorithmic and computational complexity, and their application to the resolution of engineering problems.

1- Introduction to formal systems Calculus. Definition Consideration on calculi 2- Representation and syntax in propositional calculus Introduction to propositional calculus Syntax 3- Proof theory in propositional calculus. Kleene¿s algebra Introduction to Kleene's algebra Proof and deduction Proof with assumptions 4- Representation and syntax in predicate logic Introduction to predicate calculus Syntax 5- Proof theory in predicate calculus. Kleene¿s algebra Introduction to Kleene¿s algebra Proof and deduction 6- Semantic theory for propositional and predicate calculi Semantic theory for propositional calculus Semantic theory for predicate calculus (I) 7- Resolution method Prenex normal form Skolem normal form Resolution method 8- Computational logic and applications Horn clause and chaining methods Introduction to Prolog

* Theory sessions: 1 ECTS. Sessions used to introduce the key concepts. Students will receive class notes and references to pursue independent work. * Exercise sessions: 1 ECTS. Guided work sessions devoted mainly to solve Logic exercises related to the theoretical contents. * Independent practical work: 2,5 ECTS. Independent work to be carried out either individually or in small groups focused on thematic sets of exercises provided by the professors. * Continuous assessment tests: 1 ECTS. There are two midterms that evaluate progress during the term. * Office hours: time outside of class scheduled by professors to meet with students either individually or in groups. * Final exam: 0,5 ECTS. Global evaluation of the knowledge and skills developed over the term.