# Logic

## Course Description

Logic

• ### Area of Study

Mechanical Engineering

• ### Language Level

Taught In English

• ### Course Level Recommendations

Lower

ISA offers course level recommendations in an effort to facilitate the determination of course levels by credential evaluators.We advice each institution to have their own credentials evaluator make the final decision regrading course levels.

### Hours & Credits

• ECTS Credits

6
• Recommended U.S. Semester Credits
3
• Recommended U.S. Quarter Units
4
• ### Overview

Logic (218 - 15970)
Study: Bachelor in Informatics Engineering
Semester 2/Spring Semester
1st Year Course/Lower Division

Compentences and Skills that will be Acquired and Learning Results:
General skills:

- Analysis (PO a)
- Abstraction (PO a)
- Modeling and problem solving (PO c)
- To be able to apply basic deductive logic concepts (PO c)
- Ability to understand the basics of logic and its application to solve engineering problems (CGB3)

Specific skills:
- Cognitive

1. To know first-order logic, derive logical proofs and deductions, understand the basics of its application to computing and being able to use automated deduction systems (PO a)

- Procedural/Instrumental

2. Students will evaluate different resolution methods as well as their advantages and disadvantages (PO b)
3. Students will apply the right technique to every problem introduced (PO c)

- Attitude

4. Students will work in teams (PO d)
5. Students will use computational logic tools (PO e)
6. Students will have a written final exam (PO g)

Description of Contents: Course Description

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

Learning Activities and Methodology:

The course will consist of lectures, where the theory will be introduced, and practical sessions. The aim of the lectures is providing the student with the theoretical background on Logic, its implications, and its usefulness in the context of Computer Science. (PO a)

The practical sessions will consist of Computational Logic exercises related to the concepts presented in the lectures. They will cover modeling and representation aspects as well as practical use of deduction and proof methods. Additionally, there will be some sessions devoted to the introduction of logic programming (PROLOG) and automatic deduction. (PO a, c, d, f, g)

The exercises will be published in aula global and will be solved in class. There will also be activities that will require students to work at home and submit the results in groups. (PO a, c, d, g, k)

During the semester, there will be two assessments focused on the theoretical contents of the course.

Assessment System:

The grading system has a component of continuous-assessment that will allow the students to secure a portion of their final mark. The theoretical side explained in the lectures will be assessed via two tests that will represent 60% of the final grade. (PO a)

The practical exercises will be assessed via presentations of solution proposals and the mentioned tests. These exercises will be used to evaluate the knowledge acquired by the students and their skills in applying it in practice (PO b, c, d, e)

There will be a final exam that will be used to make a global assessment of all the competences: knowledge, understanding, practical use, and skills.

Basic Bibliography:
Cuena, J. Lógica Informática. Alianza Informática. 1996

Alfredo Deaño. Lógica Computacional. Alianza. 1978
Enrique Paniagua Arís et al.. Logica Computacional. Thomson Paraninfo. 2003
Manuel Garrido. Lógica Simbólica. Tecnos. 2001
María Antonia Huertas Sánchez y María Manzano. Lógica para Principiantes. Alianza. 2004
Pascual Julian Iranzo. Lógica Simbólica para Informáticos. RA-MA. 2004

### Course Disclaimer

Courses and course hours of instruction are subject to change.

ECTS (European Credit Transfer and Accumulation System) credits are converted to semester credits/quarter units differently among U.S. universities. Students should confirm the conversion scale used at their home university when determining credit transfer.

This site uses cookies to store information on your computer. Some are essential to make our site work; others help us improve the user experience. By using the site, you consent to the placement of these cookies.