Given a strict partial order $>$ over a set $A$. Any two elements of $A$ can be comparable or incomparable. The information I have about $>$ is of the following form :
$(a,b)$ are comparable or $(a,b)$ are incomparable. For every pair of elements $a,b\in A$.
Can we define $>$ by having access to this type of information? If not, are there certain subclass of strict partial orders that can be identified by this type of information?