Abstract.
A rank function for a directed graph G assigns elements of a well ordering to the vertices of G in a fashion that preserves the order induced by the edges. While topological sortings require a one-to-one matching of vertices and elements of the ordering, rank functions frequently must assign several vertices the same value. Theorems stating basic properties of rank functions vary significantly in logical strength. Using the techniques of reverse mathematics, we present results that require the subsystems \({\ensuremath{\vec{RCA}_0}}\), \({{\vec{ACA}_0}}\), \({{\vec{ATR}_0}}\), and \({{\vec{\Pi^1_1 - CA}_0}}\).
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 29 December 1998
Rights and permissions
About this article
Cite this article
Hirst, J. Reverse mathematics and rank functions for directed graphs. Arch. Math. Logic. 39, 569–579 (2000). https://doi.org/10.1007/s001530050165
Issue Date:
DOI: https://doi.org/10.1007/s001530050165