More on Preorders
摘要
In this chapter we analyze certain combinatorial properties of preorders; in particular we focus on the one hand on the relations existing between a partial order and its boolean completion and on the other hand on the quasi-order introduced by Cohen to obtain the consistency of the failure of \(\mathsf {CH}\) by means of forcing, and we outline the key combinatorial features used to prove this result.