Theory of 2-structures. II: Representation through labeled tree families (Q913823): Difference between revisions

This paper continues the investigation of the theory of 2-structures initiated in Part I (cf. the review above). Hierarchical representations of 2-structures through 2s-labeled tree families are studied. The main result states that every 2-structure is, in fact, 2s-labeled family of primitive, complete or linear 2-structures. Hence, each 2- structure can be decomposed into primitive, complete and linear 2- structures. Given a 2-structure (D,R). Denote by \(2^ D\) the set of all subsets of D. For \(X,Y\in 2^ D,\) X,Y are overlapping if \(X\setminus Y\neq \emptyset,\quad Y\setminus X\neq \emptyset,\quad X\cap Y\neq \emptyset.\) A 2s-labeled tree family is a triple (D,\({\mathcal F},\phi)\), where D is a finite set, \({\mathcal F}\subseteq 2^ D\) such that \(D\in {\mathcal F},\quad \emptyset \not\in {\mathcal F},\quad \{x\}\in {\mathcal F}\) for every \(x\in D\), for every \(X,Y\in {\mathcal F},\) X,Y are not overlapping and \(\phi\) (X) is a 2-structure for every \(X\in {\mathcal F}\).