Honest leftmost branch
id:
honest-leftmost-branch-200-1201720
title:
Honest leftmost branch
text:
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 smallest infinite ordinal (represented by the natural numbers N), and γ is some other ordinal.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Honest_leftmost_branch
date created:
date modified:
2024-03-04T08:26:55Z
main entity:
{"identifier":"Q5893284","url":"https://www.wikidata.org/entity/Q5893284"}
image:
fields total:
13
integrity:
13