This course aims to introduce the fundamental concepts and properties of sets, relations, and functions, to teach how to reason rigorously and write the reasoning used in an appropriate manner, and, last but not least, to serve as an introduction to the art of proof.
This course presents the essential techniques and tools for the study of the theory of representations of partially ordered sets. In particular, it covers the differentiation algorithms of Nazarova and Zavadskij and provides the classification of all finite-type posets and all sincere posets of finite type.