In mathematical order theory, an order-embedding is a special kind of monotone function, which provides a way to include one partially ordered set into another. Like Galois connections, order-embeddings constitute a notion which is strictly weaker than the concept of an order isomorphism. Both of these weakenings may be understood in terms of category theory.