The general quasi-order algorithm in number theory (Q1075347)

Summary: This paper deals with a generalization of the binary quasi-order theorem. This generalization involves a more complicated algorithm than in the previous papers [Publ., Secc. Mat., Univ. Autòn. Barc. 29, No.1, 31-64 (1985; Zbl 0583.51017); No.2/3, 123-144 (1985; see the preceding review)]. Some remarks are made on relative merits of two dual algorithms called the \(\psi\)-algorithm and the \(\phi\)-algorithm. Some illustrative examples are given.