Galois connections are a particular kind of correspondence between ordered sets that preserve some but not all structure. In this thesis we explore examples and properties of Galois connections on preordered sets, and results such as the adjoint functor theorem. We lastly prove a version of the Lambek–Moser theorem using Galois connections and then give a few applications.