Honest leftmost branch


In set theory, an honest leftmost branch of a tree T on ω × γ is a branch ƒ ∈ such that for each branch g ∈ , one has ∀ n ∈ ω : ƒ ≤ g. Here, denotes the set of branches of maximal length of T, ω is the ordinal and γ is some other ordinal.