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 widehatsfWF denote the problem of choosing which trees in a sequence are well-founded, and let sfPK denote the problem of finding the perfect kernel of a tree. Let widehatsfWFL and sfPKL denote the restrictions of these principles to trees with leaf sets. Then widehatsfWF, widehatsfWFL, sfPK, and sfPKL are all equivalent to Pi11m−sfCA0 over sfRCA0, and all strongly Weihrauch equivalent.












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)