IB000 Induction and Recursion

Faculty of Informatics
Spring 2006
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Petr Hliněný, Ph.D. (lecturer)
Mgr. Jan Holeček (seminar tutor)
doc. Mgr. Jan Obdržálek, PhD. (seminar tutor)
Mgr. Lukáš Másilko (lecturer)
RNDr. Václav Brožek, Ph.D. (seminar tutor)
RNDr. Vojtěch Forejt, Ph.D., LL.B. (Hons) (seminar tutor)
Mgr. Jitka Kudrnáčová (seminar tutor)
RNDr. Jana Tůmová, Ph.D. (seminar tutor)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Petr Hliněný, Ph.D.
Timetable
Thu 10:00–11:50 D1
  • Timetable of Seminar Groups:
IB000/sp: Tue 12:00–14:50 C416, Tue 13:00–14:50 C501, Fri 12:00–13:50 C502, L. Másilko
Prerequisites (in Czech)
! I000 Induction and Recursion
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Course objectives
This course is focused on understanding basic mathematical concepts necessary for describing program semantics and formalization of the relationship between intuitive program constructs and their mathematical meaning. This is essential for building up a set of basic concepts needed for other courses which fit theoretical essentials of the dicipline.
Syllabus
  • The course focuses on understanding basic mathematics as a tool for formal modeling and analysis of computer programs. Basic set theory. Relations between sets and their properties. Propositional logic and first-order logic. Inductively defined sets and functions, structural induction. Syntax nad semantics of a simple declarative programming language. Proving program corectness.
  • Basic set theory. Cantor theorem. The halting problem and its undecidability.
  • Relations between sets and their basic properties. Functions as relations. Operations over relations, relational databases.
  • Equivalences and quotients. Orders and preorders. Transitive (and other) closures.
  • Propositional logic, its syntax and semantics. NP-complete problems. First-order logic.
  • Inductively defined sets and functions. Structural induction.
  • A simple declarative language and its operational semantics. Proving program corectness by induction.
Literature
  • WAND, Mitchell. Induction, recursion, and programming. New York: North Holland, 1980, 202 s. ISBN 0444003223. info
Language of instruction
Czech
Further comments (probably available only in Czech)
Study Materials
The course is taught only once.
Listed among pre-requisites of other courses
Teacher's information
http://www.fi.muni.cz/~hlineny/Vyuka/UINF.html
The course is also listed under the following terms Autumn 2002, Autumn 2003, Autumn 2004, Autumn 2005, Autumn 2006, Autumn 2007, Spring 2008, Autumn 2008, Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019, Autumn 2020, Autumn 2021, Autumn 2022, Autumn 2023, Autumn 2024.
  • Enrolment Statistics (Spring 2006, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2006/IB000