Honest leftmost branch
In set theory, an honest leftmost branch of a tree T on ω × γ is a branch (maximal chain) ƒ ∈ [T] such that for each branch g ∈ [T], one has ∀ n ∈ ω : ƒ(n) ≤ g(n). Here, [T] denotes the set of branches of maximal length of T, ω is the ordinal (represented by the natural numbers N) and γ is some other ordinal.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Honest leftmost branch
In set theory, an honest leftmost branch of a tree T on ω × γ is a branch (maximal chain) ƒ ∈ [T] such that for each branch g ∈ [T], one has ∀ n ∈ ω : ƒ(n) ≤ g(n). Here, [T] denotes the set of branches of maximal length of T, ω is the ordinal (represented by the natural numbers N) and γ is some other ordinal.
has abstract
In set theory, an honest leftm ...... ) and γ is some other ordinal.
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
941,010,392
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
comment
In set theory, an honest leftm ...... ) and γ is some other ordinal.
@en
label
Honest leftmost branch
@en