Mathematics for Computer Sciences II 
by R. Okazaki

2003 Spring Term

Click here for Japanese
This course is an introduction to the language of sets.
Its primary goal is a grasp of the basic notions related with sets, functions and relations.
Its secondary goal is a touch at the very basic notions related with mathematical structure.
After successfully learning basics from this course,
students will be familier to mathematical conception in computer sciences.

Plan

04/11 Sets as Extension
04/18 Logic and Sets
04/25 Inclusion of Sets
05/09 Basic Operations of Sets
05/16 Law of Operattions of Sets
05/23 -- No Lecture because of International Conference --
05/30 -- No Lecture because of International Conference --
06/06 Operation and Inclusion of Sets
06/13 Direct Product of Sets
06/20 Graph and Relation
06/27 Order as Relation
07/04 Equivalence Relation
07/11 Function as Special Relation
07/15 Operations of Functions
07/16 Mathematical Structure

Evaluation

Examination    100%

Through examination, achievement in several points will be verified:
understanding of concrete sets;
understanding of sets through diagram;
logical treatment of sets from description of elements;
ablility to perform calculation of sets;
some ability of inference in problems formulated with sets;
basic knowledge of functions, relations and structure.

How to Study

Students can touch the basic notions of sets, functions and relations
through rich material presented at the course.
Students can acquire the ability to understand and/or express notions of
discrete mathematics through diagrams, that are used everywhere in the course.
Students can become familier to sets because daily subjects will be often used as material.
Students can learn a basic view point of mathematics and computer sciences because
recovery of properties of aggregate objects from
information of individual objects will be repeatedly practiced in the course.