|
After passing this course, you are able to
- deal with the cognitive style of theoretical computing science;
- translate natural language into logical formulas and vice versa in propositional logic, predicate logic and modal logic;
- reason informally about the validity of formulas in models in the three logics mentioned above;
- understand the terms alphabet, word, and formal language, and apply the basic operations on words and languages properly;
- associate languages with regular expressions, context-free grammars and finite automata;
- understand and properly apply basic concepts from graph theory;
- compute and apply binomial coefficients and Stirling numbers;
- define functions using recursion;
- prove statements using the principle of mathematical induction.
|
|
|
This is an introductory course in mathematical logic and theoretical computing science. A lot of important subjects from these fields are briefly introduced. The course consists of three blocks of two chapters each. The first block explains the basic concepts of propositional logic and predicate logic. The second block is about languages and several formal representations of these languages. The two chapters in the third block are not closely related. They introduce some concepts from the field of discrete mathematics and extend the propositional logic to modal logic.
|
|