Back to homepage.
Discrete Mathematics and Logic - Winter 2009
||21.9. - 18.9.2009|
||14:30-16:00, Dept. of Mathematics|
||4.1. - 12.2.2010|
- Propositional formulas, tautological equivalence in propositional logic. CNF and DNF. Boolean calculus.
- Semantic consequence.
- Predicate logic, interpretation.
- Semantic consequent and tautological equivalence in predicate logic.
- Mathematical induction.
- Binary relations, equivalnce relation, partial ordering.
- Integers. Eukleid Algorithm, Fermat Theorem.
- Relation mod n on integers and its properties.
- Classes mod n and operations with them. Applications.
- Chinese Remainder Theorem, RSA cryptosystem.
- Semigroups. monoids, groups.
- Difference equations with constant coefficients.
- M. Demlová:
Mathematical logic. Kernberg Publishing, s.r.o., 2008.
- L. Childs: A concrete Introduction to Higher Algebra.
Springer-Verlag, Berlin, 1979.
- J. Velebil: Matematics 5(d), available at
Structure of the exam:
The exam consists of a written part and an oral part.
The written part contains four problems. For each problem you get
up to 20 points, making the total 80 points for the written part.
Oral exam is a theoretical question for up to 20 points.
This part is not obligatory, it allows you to add points to those you
had got for the written exam.
|80-89||B (very good)|