THE MATRIX DISTINGUISHING WAY OF A TRANSITIVE BINARY-RELATION IN A FINITE SET
Guo Shu-lin
Abstract
Guo Shu-lin
Abstract
The way of properties of a binary- relation researched on the matrix is simple and efficient. The four previous properties of binary - relations have had matrix distinguishing ways on the researches into the reflexive , antireflexiv, symmetric, antisymmetric and transitive binary- relations. This pager sets up a new matrix distinguishing way of a transitive binary-relation in a finite set based on analysis of transitive binary-relation.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The way of properties of a binary- relation researched on the matrix is simple and efficient. The four previous properties of binary - relations have had matrix distinguishing ways on the researches into the reflexive , antireflexiv, symmetric, antisymmetric and transitive binary- relations. This pager sets up a new matrix distinguishing way of a transitive binary-relation in a finite set based on analysis of transitive binary-relation.
Key concepts: Transitive relation, Binary relation, Logical matrix, Mathematics, Binary number, Simple (philosophy), Preorder, Matrix (chemical analysis)