Hypergraphs for describing complex structured objects

When studying the properties of objects, which consist of many elements that have some of the specified properties and are in specified relationships, a convenient tool to describe them is the use of predicate calculus formulas.In such a case, the relations between elements of such an object are set by atomic formulas in which the order of arguments is strictly defined.But if the relation does not depend on the order of the arguments (for example, it is commutative, as the relation "be friends"), then it becomes necessary to write out atomic formulas with all possible argument orders.It is even more difficult to write down such a property of a group of elements in which the number of elements for different groups of the same type is different.For example, a group of "family" elements can include from two to a sufficiently large number of elements.The use of special-type hypergraphs for the description and analysis of such objects, named hypergraphs of relations, is proposed below.The notion of such a hypergraph's isomrphism is defined.The above-mentioned concept is illustrated by model examples.