  In order theory, partially ordered sets are only equipped with one relation
which decides the entire structure/Hasse diagram of the set. In this paper, we
have presented how partially ordered sets can be studied under simultaneous
partially ordered relations which we have called binary posets. The paper is
motivated by the problem of operating a set simultaneously under two distinct
partially ordered relations. It has been shown that binary posets follow the
duality principle just like posets do. Within this framework, some new
definitions concerning maximal and minimal elements are also presented.
Furthermore, some theorems on order isomorphism and Galois connections are
derived.
