A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.
BIK-MLO Mathematical Logic Extent of teaching: 13KP+4KC Instructor: Klouda K. Completion: Z,ZK Department: 18105 Credits: 5 Semester: Z Annotation:
Students have knowledge of the syntax and semantics of the propositional and predicate logic. They master the Boolean algebra, both theoretically as an instance of universal algebra, and practically as a tool to describe the world of digital systems. They get skills to handle Boolean functions, normal forms, maps, and minimisation methods needed in the further modules.
Lecture syllabus:
1. Informal logic as the language of mathematics. Ambiguity of natural languages. Languages nad metalanguages. Formal languages. Language of propositional logic, syntax and semantics. Truth tables, time complexity of their processing. 2. Semantic consequence and semantic equivalence. Lindenbaum algebra of propositional logic formulas. Boolean algebra. CNF and DNF. Karnaugh maps. Boolean function minimization. 3. Basic concepts of the resolution algorithm in propositional logic. Formalizing natural language sentences, inadequacy of propositional logic. Syntax of predicate logic. 4. Semantics of predicate logic. Construction of simple models in predicate logic language. 5. Semantic consequence in predicate logic. Satisfiability. Semantic consequence problem, algorithmic point of view. 6. Formalizing natural language sentences in predicate logic. Syntactic derivation in propositional and predicate logic. Construction of successful tableaus. 7. Other logics used in CS. Seminar syllabus:
1. Formalization of simple statements. Truth tables, time complexity of their processing. Semantic consequence and semantic equivalence. CNF and DNF. Syntax and semantic of predicate logic. Resolution method in propositional logic. 2. Formalization of natural language sentences. Syntax of predicate logic. Semantic of predicate logic. Construction of simple models in predicate logic language. Semantic consequence in predicate logic. Satisfiability. Semantic consequence problem, algorithmic point of view. Proofs in propositional and predicate logic. Tableau method. Literature:
M. Demlová, B. Pondělíček: "Matematická logika." ČVUT Praha, 1997. J. Kolář, O. Štěpánková, M. Chytil: "Logika, algebry a grafy." SNTL Praha 1989. V. Švejdar: "Logika - neúplnost, složitost a nutnost." Academia Praha, 2002. A. Sochor: "Klasická matematická logika." Karolinum Praha, 2001. Requirements:
Předpokládá se schopnost práce s matematickou abstrakcí na úrovni získané středoškolským studiem matematiky.
Informace o předmětu a výukové materiály naleznete na https://courses.fit.cvut.cz/BI-MLO/ The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester BIK-SPOL.2015 Unspecified Branch/Specialisation of Study PP 1 BIK-BIT.2020 Computer Security and Information technology PP 1 BIK-WSI-SI.2015 Web and Software Engineering PP 1 BIK-BIT.2015 Computer Security and Information technology PP 1
Page updated 19. 4. 2024, semester: L/2020-1, L/2021-2, Z/2023-4, Z/2024-5, Z/2019-20, Z/2022-3, L/2019-20, L/2022-3, Z/2020-1, Z/2021-2, L/2023-4, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška