I learned the definition a set being complete as below.
An ordered set (X, =<) is said to be complete if for every non-empty subset of X which is bounded above (or below), there exists a supremum (or infimum).
But I'm not sure if an "ordered set" means only a totally ordered set or both a totally ordered set a partially ordered set. If it means the latter, I don't understand how a partially ordered set can be complete. Because I understood a partially ordered set can have elements which are not comparable and so there may not exist a supremum or infimum.
Does an "ordered set" mean only a totally ordered set or both a totally ordered set and a partially ordered set? And could you give me an example if it is the latter?
A typical example of a partially ordered, non-linearly ordered set is $\mathcal{P}(X)$, all subsets of $X$ (a set with at least $2$ elements) ordered by inclusion.
If $A$ and $B$ are non-comparable sets, they still have a lower bound $\emptyset$ and upper bound $X$. Consider what $\sup \{A,B\}$ is, we cannot have maximum as the sets are incomparable, but $A \cup B$ is a common upper bound and some thought reveals that if $C$ is an upper bound, so $A \subseteq C$ and $B \subseteq C$, then $A \cup B \subseteq C$ as well. So $A \cup B$ is the minimal element among all upper bounds of $\{A,B\}$ and is thus its supremum by definition.
In fact all subsets $\mathcal{A} \subseteq \mathcal{P}(X)$ have $\sup \mathcal{A} = \bigcup \mathcal{A}$. Likewise with infima and intersections.