Subject: Mathematics
Scientific area:
Mathematics
Contact hours:
56 Hours
Number of ECTS:
5 ECTS
Language:
Portuguese
General Objectives:
1 - Review some mathematical concepts that are essential to understanding the subject
2 - Define and identify mathematical propositions and determine their logical value
3 - Know and apply the fundamental principles of propositional logic
4 - Explore operations on propositions, aiming for a bivalent logic in which the principles of non-contradiction and the excluded middle apply
5 - Conceptualize sets and subsets and perform operations between sets
6 - Relate the algebra of propositions to the algebra of sets
7 - Be able to translate some demonstration techniques with and without the use of truth tables into a language specific to the theories developed in this topic
8 - Know some basic concepts about graphs
9 - Define and identify Eulerian and Hamiltonian circuits
10 - Explore some application examples of the concepts presented in order to practice and improve the development of mathematical reasoning
2 - Define and identify mathematical propositions and determine their logical value
3 - Know and apply the fundamental principles of propositional logic
4 - Explore operations on propositions, aiming for a bivalent logic in which the principles of non-contradiction and the excluded middle apply
5 - Conceptualize sets and subsets and perform operations between sets
6 - Relate the algebra of propositions to the algebra of sets
7 - Be able to translate some demonstration techniques with and without the use of truth tables into a language specific to the theories developed in this topic
8 - Know some basic concepts about graphs
9 - Define and identify Eulerian and Hamiltonian circuits
10 - Explore some application examples of the concepts presented in order to practice and improve the development of mathematical reasoning
Contents / Syllabus:
1 - Introduction to Bivalent Logic and Set Theory
1.1 - Propositions
1.2 - Logical value of a proposition
1.3 - Principle of non-contradiction
1.4 - Operations on propositions: negation, conjunction, disjunction, implication, and equivalence
1.5 - Priorities of logical operations
1.6 - Logical relations between different operations
1.7 - Property of double negation
1.8 - Principle of the excluded middle
1.9 - Principle of double implication
1.10 - Commutative and associative properties
1.11 - Distributive properties
1.12 - De Morgan's Laws
1.13 - Contra-reciprocal implication
2 - Conditions and sets
2.1 - Propositional expression or condition
2.2 - Universal and existential quantifiers
2.3 - Second laws of De Morgan; counterexamples
2.4 - Set defined by a condition
2.5 - Equality between sets
2.6 - Sets defined in extension
2.7 - Operations with sets: union, intersection, difference, and complementary set
2.8 - Inclusion of sets
2.9 - Relation between logical operations on conditions and operations on the sets they define
2.10 - Principle of double inclusion; Proof of equivalences by double implication
2.11 - Negation of a universal implication; proof by contrareciprocal
3 - Graphs
3.1 - Graph theory: basic concepts
3.2 - Eulerian paths and circuits
3.3 - Eulerization of graphs: the Chinese shopkeeper problem
3.4 - Hamiltonian circuit: the traveling salesman problem
3.5 - Graph coloring
3.6 - Spanning trees
1.1 - Propositions
1.2 - Logical value of a proposition
1.3 - Principle of non-contradiction
1.4 - Operations on propositions: negation, conjunction, disjunction, implication, and equivalence
1.5 - Priorities of logical operations
1.6 - Logical relations between different operations
1.7 - Property of double negation
1.8 - Principle of the excluded middle
1.9 - Principle of double implication
1.10 - Commutative and associative properties
1.11 - Distributive properties
1.12 - De Morgan's Laws
1.13 - Contra-reciprocal implication
2 - Conditions and sets
2.1 - Propositional expression or condition
2.2 - Universal and existential quantifiers
2.3 - Second laws of De Morgan; counterexamples
2.4 - Set defined by a condition
2.5 - Equality between sets
2.6 - Sets defined in extension
2.7 - Operations with sets: union, intersection, difference, and complementary set
2.8 - Inclusion of sets
2.9 - Relation between logical operations on conditions and operations on the sets they define
2.10 - Principle of double inclusion; Proof of equivalences by double implication
2.11 - Negation of a universal implication; proof by contrareciprocal
3 - Graphs
3.1 - Graph theory: basic concepts
3.2 - Eulerian paths and circuits
3.3 - Eulerization of graphs: the Chinese shopkeeper problem
3.4 - Hamiltonian circuit: the traveling salesman problem
3.5 - Graph coloring
3.6 - Spanning trees
Bibliography / Information Sources:
Jungnickel, D. , 2008 , Graphs, networks and algorithms. 3rd ed. , Berlin: Springer, cop
J.C. Ferreira , 2001 , Elementos de Lógica Matemática e Teoria dos Conjuntos , Departamento de Matemática do Instituto Superior Técnico
M.L. O?Leary , 2016 , A First Course in Mathematical Logic and Set Theory , John Wiley & Sons
D.M. Cardoso, J. Szymanski, M. Rostami , 2008 , Matemática Discreta: Combinatória, Teoria dos Grafos e Algoritmos , Escolar Editora
J.C. Ferreira , 2001 , Elementos de Lógica Matemática e Teoria dos Conjuntos , Departamento de Matemática do Instituto Superior Técnico
M.L. O?Leary , 2016 , A First Course in Mathematical Logic and Set Theory , John Wiley & Sons
D.M. Cardoso, J. Szymanski, M. Rostami , 2008 , Matemática Discreta: Combinatória, Teoria dos Grafos e Algoritmos , Escolar Editora
Assessment Methods and Criteria:
Classification Type: Quantitativa (0-20)
Evaluation Methodology:
This course combines theoretical and practical lessons, prioritizing the presentation of mathematical concepts and the solving of exercises. Activities include proofs, construction of truth tables, solving problems involving sets and graphs, and applying concepts to practical situations. Assessment integrates a continuous assessment component based on exercises or assignments (50%) and a written exam or test (50%), designed to evaluate understanding of concepts, logical reasoning, and problem-solving skills.
Evaluation Methodology:
This course combines theoretical and practical lessons, prioritizing the presentation of mathematical concepts and the solving of exercises. Activities include proofs, construction of truth tables, solving problems involving sets and graphs, and applying concepts to practical situations. Assessment integrates a continuous assessment component based on exercises or assignments (50%) and a written exam or test (50%), designed to evaluate understanding of concepts, logical reasoning, and problem-solving skills.


