Leaf management
From MaRDI portal
Publication:5131654
Abstract: Finding the set of leaves for an unbounded tree is a nontrivial process in both the Weihrauch and reverse mathematics settings. Despite this, many combinatorial principles for trees are equivalent to their restrictions to trees with leaf sets. For example, let denote the problem of choosing which trees in a sequence are well-founded, and let denote the problem of finding the perfect kernel of a tree. Let and denote the restrictions of these principles to trees with leaf sets. Then , , , and are all equivalent to over , and all strongly Weihrauch equivalent.
Recommendations
Cited in
(5)- Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
- Finding paths through narrow and wide trees
- Reverse mathematics and Weihrauch analysis motivated by finite complexity theory
- Algebraic properties of the first-order part of a problem
- The Weihrauch lattice at the level of \(\boldsymbol{\Pi }^1_1{-}\mathsf{CA}_0\): the Cantor-Bendixson theorem
This page was built for publication: Leaf management
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131654)