Reverse mathematics of some topics from algorithmic graph theory

被引:0
|
作者
Clote, PG
Hirst, JL
机构
[1] Boston Coll, Dept Comp Sci, Chestnut Hill, MA 02167 USA
[2] Appalachian State Univ, Dept Math Sci, Boone, NC 28608 USA
关键词
reverse mathematics; proof theory; recursion theory; graph theory;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
This paper analyzes the proof-theoretic strength of an infinite version of several theorems from algorithmic graph theory. In particular, theorems on reachability matrices, shortest path matrices, topological sorting, and minimal spanning trees are considered.
引用
收藏
页码:1 / 13
页数:13
相关论文
共 50 条