(13 intermediate revisions by the same user not shown) | |||

Line 20: | Line 20: | ||

|- | |- | ||

|Lecture/Exercise | |Lecture/Exercise | ||

− | | | + | |Tuesday |

− | | | + | |08:10 |

− | |M- | + | |M-I |

|[[Martina Babinská|Martina Babinská]] | |[[Martina Babinská|Martina Babinská]] | ||

|- | |- | ||

|Exercise/Lecture | |Exercise/Lecture | ||

|Thursday | |Thursday | ||

− | | | + | |11:30 |

− | |M- | + | |M-III |

|[[Martina Babinská|Martina Babinská]] | |[[Martina Babinská|Martina Babinská]] | ||

|} | |} | ||

Line 39: | Line 39: | ||

!References | !References | ||

|- | |- | ||

− | | | + | |24.09. |

− | |Introduction | + | |Introduction. The set of numbers, cardinality, the set theory. |

|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi. | |Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi. | ||

− | Rose-Hulman Institute of Technology: Pearson, 2004;chap. | + | Rose-Hulman Institute of Technology: Pearson, 2004; chap. 3 |

|- | |- | ||

− | | | + | |26.09. |

− | |The basics of logic | + | |The basics of logic: statement vs. sentence. |

|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi. | |Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi. | ||

− | Rose-Hulman Institute of Technology: Pearson, 2004;chap. 2 | + | Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2 |

|- | |- | ||

− | | | + | |01.10. |

− | |The basics of logic | + | |The basics of logic: primitive vs. compound statement, conjunction, disjunction, implication, biconditional, quantifiers. |

|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi. | |Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi. | ||

− | Rose-Hulman Institute of Technology: Pearson, 2004; chap | + | Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2 |

|- | |- | ||

− | | | + | |03.10. |

− | |The basics of logic | + | |The basics of logic: Negation. Logical Equivalence. Contradiction and tautology. |

|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi. | |Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi. | ||

− | Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2 | + | Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2 |

|- | |- | ||

− | | | + | |08.10. |

− | | | + | |Mathematical Rows: Sum and multiplication. Mathematical notation. |

|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi. | |Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi. | ||

− | Rose-Hulman Institute of Technology: Pearson, 2004; | + | Rose-Hulman Institute of Technology: Pearson, 2004; chap. 4.1 |

|- | |- | ||

− | | | + | |10.10. |

− | + | |Proving methods in mathematics: Constructive proof, direct proof and mathematical Induction. Indirect/contrapositive proof. Contradiction. | |

− | + | |Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi. | |

− | + | Rose-Hulman Institute of Technology: Pearson, 2004; chap. 4.1 | |

− | + | ||

− | | | + | |

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | | | + | |

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

|} | |} | ||

Line 170: | Line 80: | ||

* Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi. | * Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi. | ||

Rose-Hulman Institute of Technology: Pearson, 2004. [https://www.scribd.com/doc/119851254/Discrete-and-Combinatorial-Mathematics-An-Applied-Introduction-5th-Ed-R-Grimaldi-Pearson-2004-WWW Download here]; | Rose-Hulman Institute of Technology: Pearson, 2004. [https://www.scribd.com/doc/119851254/Discrete-and-Combinatorial-Mathematics-An-Applied-Introduction-5th-Ed-R-Grimaldi-Pearson-2004-WWW Download here]; | ||

+ | * Basics of Mathematical Functions: https://www.khanacademy.org/math/algebra/algebra-functions | ||

* Calculus / Gilbert Strang. Massachusetts Institute of Technology: Wellesley-Cambridge Press. [https://ocw.mit.edu/ans7870/resources/Strang/Edited/Calculus/Calculus.pdf Download here]; | * Calculus / Gilbert Strang. Massachusetts Institute of Technology: Wellesley-Cambridge Press. [https://ocw.mit.edu/ans7870/resources/Strang/Edited/Calculus/Calculus.pdf Download here]; | ||

* Fundamentals of Linear Algebra / James B. Carrell. Canada: University of British Colombia, 2005. [https://www.math.ubc.ca/~carrell/NB.pdf Download here]; | * Fundamentals of Linear Algebra / James B. Carrell. Canada: University of British Colombia, 2005. [https://www.math.ubc.ca/~carrell/NB.pdf Download here]; | ||

Line 179: | Line 90: | ||

PROJECT | PROJECT | ||

* form: essay, presentation, song or movie | * form: essay, presentation, song or movie | ||

− | * topic: | + | * topic: Me and Mathematics: what does mathematics mean for me? |

− | * term: | + | * term: 05.12.2019 |

* goal: self-study motivation | * goal: self-study motivation | ||

* weight: 15% | * weight: 15% | ||

Line 186: | Line 97: | ||

WEEKLY EXAMS AND HOMEWORK | WEEKLY EXAMS AND HOMEWORK | ||

*form: 10-15 minutes writing tests | *form: 10-15 minutes writing tests | ||

− | *term: every | + | *term: every Tuesday at the beginning of the exercise |

*goal: regular preparation | *goal: regular preparation | ||

− | *weight: | + | *weight: 25% |

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

MIDDLE TERM EXAM | MIDDLE TERM EXAM | ||

*form: 90 minutes writing test (student can choose from the offered task sets) | *form: 90 minutes writing test (student can choose from the offered task sets) | ||

− | *term: | + | *term: 12.11.2019 |

*goal: progress definition | *goal: progress definition | ||

+ | *weight: 15% | ||

+ | |||

+ | ATTENDANCE, ACTIVITY (bonus points. max 15%) | ||

+ | *form: class work (solving problems and schoolmate’s help) | ||

+ | *term: every lecture and exercise | ||

+ | *goal: regular preparation, cooperation and social activity | ||

*weight: 15% | *weight: 15% | ||

FINAL EXAM | FINAL EXAM | ||

*form: 90 minutes writing test | *form: 90 minutes writing test | ||

− | *term: January, February | + | *term: January, February 2020 |

*goal: course output | *goal: course output | ||

*weight: 30% | *weight: 30% | ||

+ | |||

<b>OVERALL GRADING:</b> A > 90%, B > 80%, C> 70%, D > 60%, E > 52% points. | <b>OVERALL GRADING:</b> A > 90%, B > 80%, C> 70%, D > 60%, E > 52% points. |

## Latest revision as of 09:49, 10 October 2019

# Mathematics for Cognitive Science 2-IKVa-102

## Contents

The lectures will provide students with basics of propositional and predicate logic, linear algebra, mathematical analysis, and probability that are important for the study of informatics and its role in (computational) cognitive science. At the same time, students will learn about mathematical culture, notation, way of thinking and expressing oneself.

## Course schedule

Type | Day | Time | Room | Lecturer |
---|---|---|---|---|

Lecture/Exercise | Tuesday | 08:10 | M-I | Martina Babinská |

Exercise/Lecture | Thursday | 11:30 | M-III | Martina Babinská |

## Syllabus

Date | Topic | References |
---|---|---|

24.09. | Introduction. The set of numbers, cardinality, the set theory. | Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 3 |

26.09. | The basics of logic: statement vs. sentence. | Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2 |

01.10. | The basics of logic: primitive vs. compound statement, conjunction, disjunction, implication, biconditional, quantifiers. | Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2 |

03.10. | The basics of logic: Negation. Logical Equivalence. Contradiction and tautology. | Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2 |

08.10. | Mathematical Rows: Sum and multiplication. Mathematical notation. | Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 4.1 |

10.10. | Proving methods in mathematics: Constructive proof, direct proof and mathematical Induction. Indirect/contrapositive proof. Contradiction. | Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 4.1 |

## References

- Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.

Rose-Hulman Institute of Technology: Pearson, 2004. Download here;

- Basics of Mathematical Functions: https://www.khanacademy.org/math/algebra/algebra-functions
- Calculus / Gilbert Strang. Massachusetts Institute of Technology: Wellesley-Cambridge Press. Download here;
- Fundamentals of Linear Algebra / James B. Carrell. Canada: University of British Colombia, 2005. Download here;
- Artificial Intelligence: A Modern Approach / Stuart Russell and Peter Norvig. The USA: Pearson, 2010. Download here;

## Course grading

**To be classified student has to achieve at least 50% of every activity:**

PROJECT

- form: essay, presentation, song or movie
- topic: Me and Mathematics: what does mathematics mean for me?
- term: 05.12.2019
- goal: self-study motivation
- weight: 15%

WEEKLY EXAMS AND HOMEWORK

- form: 10-15 minutes writing tests
- term: every Tuesday at the beginning of the exercise
- goal: regular preparation
- weight: 25%

MIDDLE TERM EXAM

- form: 90 minutes writing test (student can choose from the offered task sets)
- term: 12.11.2019
- goal: progress definition
- weight: 15%

ATTENDANCE, ACTIVITY (bonus points. max 15%)

- form: class work (solving problems and schoolmate’s help)
- term: every lecture and exercise
- goal: regular preparation, cooperation and social activity
- weight: 15%

FINAL EXAM

- form: 90 minutes writing test
- term: January, February 2020
- goal: course output
- weight: 30%

**OVERALL GRADING:** A > 90%, B > 80%, C> 70%, D > 60%, E > 52% points.