Honest leftmost branch

In graph theory, a honest leftmost branch of a tree "T" on ω×γ is a branch "f" ∈ ["T"] such that for each branch "g" ∈ ["T"] , one has ∀ "n" ∈ ω : "f"("n")≤"g"("n"). (Here, ["T"] denotes the set of branches of maximal length of "T", ω the ordinal (represented by the natural numbers) N and γ some other ordinal.)

ee also

* scale (computing)
* Suslin set

References

* Akihiro Kanamori, "The higher infinite", Perspectives in Mathematical Logic, Springer, Berlin, 1997.
* Yiannis N. Moschovakis, "Descriptive set theory", North-Holland, Amsterdam, 1980.