Branch (graph theory) Information & Branch (graph theory) Links at HealthHaven.com

In mathematics, especially mathematical logic and set theory, a branch of a tree T is a map f such that ∀n : f (n) ∈ T.

By a tree on a product set κ₁ ×···× κ_p we mean here a subset of the union of κ₁ⁱ×···×κ_pⁱ for all i < ω,

$T\subseteq\bigcup_{i<\omega} \kappa_1^i\times\cdots\times\kappa_p^i ~,$

closed under initial segments, and the set of branches of such a tree is then more explicitly the set

$[T]=\{ (f_1,...,f_p)\mid\forall n\in\omega: (f_1(n),...,f_p(n))\in T\} ~.$

This is a closed set for the usual product topology (see AD plus).

[edit] See also

This mathematical logic-related article is a stub. You can help Wikipedia by expanding it.