Name: Minimal spanning trees
Creator: James H. Schmerl
Keywords: Applications of computability and recursion theory, 0103 physical sciences, reverse mathematics, 16. Peace & justice, Foundations of classical theories (including reverse mathematics), spanning trees, 01 natural sciences, Trees

descriptionPublicationkeyboard_double_arrow_right Article , Other literature type 12 Sep 2003 English Publisher:American Mathematical Society (AMS)Journal:Proceedings of the American Mathematical Society, volume 132, pages 333-340 (issn: 0002-9939, eissn: 1088-6826,

Authors: James H. Schmerl;

doi: 10.1090/s0002-9939-03-07182-x

Minimal spanning trees

- Summary
- Subjects
- Metrics

Abstract

The main result is that a recursive weighted graph having a minimal spanning tree has a minimal spanning tree that is Δ 2 0 \Delta ^0_2 . This leads to a proof of the failure of a conjecture of Clote and Hirst (1998) concerning Reverse Mathematics and minimal spanning trees.

Related Organizations

University of Connecticut
United States

Keywords

Applications of computability and recursion theory, reverse mathematics, Foundations of classical theories (including reverse mathematics), spanning trees, Trees

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	3
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average