ABSTRACT
In this chapter we introduce the basics of set notation and fundamental notions that serve as technical support for our presentation: posets, lattices, and Boolean algebras. We will also state and prove the Knaster-Tarski fixpoint theorem, one of the fundamental results very often used in computer science. One caveat: this section is not meant to be the first contact for the reader with sets, posets, lattices and related concepts. Rather, it serves the purpose of setting up the terminology and “common language.”
