Abstract
This paper deals with intransitive ordering problems which appear in some evaluation involving paired comparison. The main path diagram, the fundamental pattern, the extended fundamental pattern and the pseudo-interval ordering are defined to analyze the set of objects intransitively ordered. From those definitions and their basic meaning this paper obtains an algorithm to decompose the intransitively ordered set into subsets satisfying the property of the pseudo-interval ordering.
