2023
Logic and Computation
Name: Logic and Computation
Code: INF13200L
3 ECTS
Duration: 15 weeks/78 hours
Scientific Area:
Informatics
Teaching languages: Portuguese
Languages of tutoring support: Portuguese, English
Regime de Frequência: Presencial
Sustainable Development Goals
Learning Goals
Convert logical statements from informal language to propositional and predicate logic expressions.
Apply formal methods of symbolic propositional and predicate logic, the rules of inference and formal logic proofs and/or informal, but rigorous, logical reasoning to real problems.
Describe how symbolic logic can be used to model real-life situations or applications, he strengths and limitations of propositional and predicate logic and the parallels between ideas of mathematical and/or structural induction to recursion.
Identify, Describe and Apply each of the proof techniques correctly in the construction of a sound argument and which type of proof is best for a given problem.
Apply formal methods of symbolic propositional and predicate logic, the rules of inference and formal logic proofs and/or informal, but rigorous, logical reasoning to real problems.
Describe how symbolic logic can be used to model real-life situations or applications, he strengths and limitations of propositional and predicate logic and the parallels between ideas of mathematical and/or structural induction to recursion.
Identify, Describe and Apply each of the proof techniques correctly in the construction of a sound argument and which type of proof is best for a given problem.
Contents
1. Propositional Calculus
1.1 Syntax: Connectives, Well-formed formulas
1.2 Semantic: Truth tables, True and Valid Formulas, Normal Forms, Inference Rules
2. Predicate Calculus
2.1 Limits of Propositional Calculus
2.2 Quantification and Proofs: Informal Reasoning, Universal e Existential Quantifiers, Refutation by Counter-Example, Direct Proof, Proof by Contradiction
3. Recursion
3.1 Recursive Definitions: Recursive Terms, Recursive Relations and Functions
3.2 Inductive Proofs: Induction in the Natural Numbers, Structural Induction
1.1 Syntax: Connectives, Well-formed formulas
1.2 Semantic: Truth tables, True and Valid Formulas, Normal Forms, Inference Rules
2. Predicate Calculus
2.1 Limits of Propositional Calculus
2.2 Quantification and Proofs: Informal Reasoning, Universal e Existential Quantifiers, Refutation by Counter-Example, Direct Proof, Proof by Contradiction
3. Recursion
3.1 Recursive Definitions: Recursive Terms, Recursive Relations and Functions
3.2 Inductive Proofs: Induction in the Natural Numbers, Structural Induction
Teaching Methods
Theoretical classes with presentation of contents, explanation of applications and illustration of examples. Practical classes with resolution of exercises and development of examples.
The assessment consists of a set of biweekly or two-frequency tests or a final exam.
The assessment consists of a set of biweekly or two-frequency tests or a final exam.
Teaching Staff
- Francisco Manuel Gonçalves Coelho [responsible]
