International Journal of Mathematics and Mathematical Sciences 
Volume 9 (1986), Issue 2, Pages 245-251
doi:10.1155/S0161171286000297

The general quasi-order algorithm in number theory

Peter Hilton1 and Jean Pedersen2

 1Department of Mathematical Sciences, State University of New York, Binghamton 13901, New York, USA
2Department of Mathematics, Santa Clara University, Santa Clara 95051, California, USA
Received 27 November 1985

Abstract

This paper deals with a generalization of the Binary Quasi-Order Theorem. This generalization involves a more complicated algorithm than (0.2)t. Some remarks are made on relative merits of two dual algorithms called the ψ-algorithm and the ϕ-algorithm. Some illustrative examples are given.