n-category = (n,n)-category
n-groupoid = (n,0)-category
Fix a meaning of -category, however weak or strict you wish. Then an -poset is an -category such that all parallel pairs of -morphisms are equivalent for . Thus, up to equivalence, there is no point in mentioning anything beyond -morphisms, not even whether two given parallel -morphisms are equivalent. This definition makes sense as low as ; the statement that parallel -morphisms are equivalent simply means that there exists an object (a -morphism).
The concept of -poset is trivial.
Because, by the definition of -category, we have that any two -morphisms with the same source and target are equivalent. Hence there is, up to equivalence, at most one morphism for every ordered pair of objects. The rest of the axioms say that this is all the information there is in a -category. Therefore, by the discussion at poset – As a category with extra properties, a -category is a poset. (See also thin category.)
In general, an -poset is an -category in which all parallel pairs of -morphisms are equal.
An -poset is the same thing as an -category.
In the light of the general definition, one must interpret ‘is’ up to equivalence of categories. The last statement also depends on how strict your definition of -category or -category is; it is actually simpler to define -posets from scratch as given above than to define them in terms of -categories.